几个并查集的例子.docVIP

几个并查集题目代码 eulerray?发表于?-?2008-2-21 20:13:00 贴几个并查集题目的代码，WA或TLE的郁闷的可以看看。一共是5个题目，想学好并查集的建议都做一下POJ 1611 The SuspectsPOJ 1703 Find them, Catch themPOJ 1988 Cube StackingPOJ 2236 Wireless NetworkPOJ 2492 A Bugs Life???????????? POJ 1611 The SuspectsProblem: 1611??? ??? User: eulerrayMemory: 448K??? ??? Time: 15MSLanguage: GCC??? ??? Result: Accepted Source Code ＃i nclude stdio.hint a[30000], c[30000];int root(int i){ int r, p; for(r = i; a[r] != -1 ; r = a[r]) ; while(a[i] != r){ p = i; i = a[i]; a[i] = r; } return r;}void merge(int i, int j){ i = root(i); j = root(j); if(i == j) return ; if(c[i] c[j]){ a[i] = j; c[j] += c[i]; } else{ a[j] = i; c[i] += c[j]; }}int main(){ int n, m, i, j, num, ni, q; while(scanf(%d %d, n, m)){ if(n == 0 m == 0) break; if(m == 0){ printf(1\n); continue; } for(i = 0; i n; i++){ a[i] = -1; c[i] = 1; } for(i = 0; i m; i++){ scanf(%d %d, q, num); for(j = 1; j q; j++){ scanf(%d, ni); merge(num, ni); } } printf(%d\n, c[root(0)]); } return 0;}POJ 1703 Find them, Catch them Problem: 1703??? ??? User: eulerrayMemory: 1320K??? ??? Time: 265MSLanguage: C??? ??? Result: Accepted Source Code ＃i nclude stdio.h#define MAXSIZE 100001int a[MAXSIZE], rank[MAXSIZE], ot[MAXSIZE];int root(int i){ int r, p; if(i == -1) return -1; for(r = i; a[r] != r; r = a[r]) ; while(a[i] != r){ p = i; i = a[i]; a[p] = r; } return r;}int merge(int i, int j){ if(i == -1) return j; if(j == -1) return i; if(rank[i] = rank[j]){ a[i] = j; if(rank[i] == rank[j]) rank[j]++; return j; } else{ a[j] = i; return i; }}void dif(int i, int j){ int mi, mj; i = root(i); j = root(j); mi = merge(i, ot[j]); mj = merge(ot[i], j); ot[mi] = mj; ot[mj] = mi;}int main(){ int c, k, i, p, q, n, m; char ch; scanf(%d, c); for(k = 0; k c; k++){ scanf(%d %d, n, m); for(i = 1; i = n; i++){ a[i] = i; rank[i] = 0;