Codeforces-292D:Connected Components(m个并查集)
来源:互联网 发布:淘宝售前客服技巧培训 编辑:程序博客网 时间:2024/05/17 09:23
We already know of the large corporation where Polycarpus works as a system administrator. The computer network there consists of ncomputers and m cables that connect some pairs of computers. In other words, the computer network can be represented as some non-directed graph with n nodes and m edges. Let's index the computers with integers from 1 to n, let's index the cables with integers from 1 to m.
Polycarpus was given an important task — check the reliability of his company's network. For that Polycarpus decided to carry out a series of k experiments on the computer network, where the i-th experiment goes as follows:
- Temporarily disconnect the cables with indexes from li to ri, inclusive (the other cables remain connected).
- Count the number of connected components in the graph that is defining the computer network at that moment.
- Re-connect the disconnected cables with indexes from li to ri (that is, restore the initial network).
Help Polycarpus carry out all experiments and for each print the number of connected components in the graph that defines the computer network through the given experiment. Isolated vertex should be counted as single component.
The first line contains two space-separated integers n, m (2 ≤ n ≤ 500; 1 ≤ m ≤ 104) — the number of computers and the number of cables, correspondingly.
The following m lines contain the cables' description. The i-th line contains space-separated pair of integers xi, yi (1 ≤ xi, yi ≤ n; xi ≠ yi)— the numbers of the computers that are connected by the i-th cable. Note that a pair of computers can be connected by multiple cables.
The next line contains integer k (1 ≤ k ≤ 2·104) — the number of experiments. Next k lines contain the experiments' descriptions. The i-th line contains space-separated integers li, ri (1 ≤ li ≤ ri ≤ m) — the numbers of the cables that Polycarpus disconnects during the i-th experiment.
Print k numbers, the i-th number represents the number of connected components of the graph that defines the computer network during the i-th experiment.
6 51 25 42 33 13 661 32 51 55 52 43 3
456342
#include<bits/stdc++.h>using namespace std;const int MAX=1e4+10;int pre[MAX][501];int suf[MAX][501];int A[501];int x[MAX],y[MAX];int f(int *p,int x) //如果这个函数写成 f(int *p,int x){return p[x]==x?x:p[x]=f(p,p[x]);}就TLE。。。。{ if(p[x]!=x)p[x]=f(p,p[x]); return p[x];}int main(){ int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=m;i++)scanf("%d%d",&x[i],&y[i]); for(int i=1;i<=n;i++)pre[0][i]=suf[m+1][i]=i; for(int j=1;j<=m;j++) { for(int i=1;i<=n;i++)pre[j][i]=pre[j-1][i]; int fx=f(pre[j],x[j]); int fy=f(pre[j],y[j]); if(fx!=fy)pre[j][fx]=fy; } for(int j=m;j>=1;j--) { for(int i=1;i<=n;i++)suf[j][i]=suf[j+1][i]; int fx=f(suf[j],x[j]); int fy=f(suf[j],y[j]); if(fx!=fy)suf[j][fx]=fy; } int T;scanf("%d",&T); while(T--) { int x,y; scanf("%d%d",&x,&y); x--; y++; for(int i=1;i<=n;i++)A[i]=pre[x][i]; for(int i=1;i<=n;i++) { int fx=f(A,i); int fy=f(suf[y],i); fy=f(A,fy); if(fx!=fy)A[fx]=fy; } int ans=0; for(int i=1;i<=n;i++)if(A[i]==i)ans++; printf("%d\n",ans); } return 0;}
- Codeforces-292D:Connected Components(m个并查集)
- CodeForces 292D Connected Components (并查集+YY)
- Codeforces 292D Connected Components (并查集)
- CodeForces 292D Connected Components(并查集 前后缀)
- CodeForces 292D Connected Components(变种并查集+预处理)
- Codeforces 292D [Connected Components]--并查集的巧妙应用
- Codeforces 292D. Connected Components
- 前缀并查集 Codeforces292D Connected Components
- CF292D Connected Components【并查集】
- Codeforces292D Connected Components 经典好题并查集
- CodeForces 25D(并查集)
- 2017多校训练第二周-Connected Components-并查集
- 中国(北方)大学生程序设计训练赛(第二周)(Problem G: Connected Components-并查集)
- Connected Component 并查集
- Croc Round1 D Connected Components
- cf 209 D. Connected Components
- Codeforces 292D (并查集巧妙运用)
- CodeForces 151D Quantity of Strings(并查集)
- Python的字典
- HBLT项目:第一阶段小结
- vue学习第9天,过渡 动画
- c语言预处理
- 深度学习总结笔记(二)
- Codeforces-292D:Connected Components(m个并查集)
- LaTex(PART XX)参考文献
- Swift 4.0 数组(Array)学习
- [NOTE]Android N SmartLock缺少很多功能
- [VS]头文件 库文件 路径设置
- Linux下TCP编程
- 广工AnyView数据结构-2
- 第七天(php)
- java字符串