[HDOJ5510]Bazinga（并查集）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5510

普通集合会tle，换高贵的并查集。

 #include <algorithm>
 #include <iostream>
 #include <iomanip>
 #include <cstring>
 #include <climits>
 #include <complex>
 #include <fstream>
 #include <cassert>
 #include <cstdio>
 #include <bitset>
 #include <vector>
 #include <deque>
 #include <queue>
 #include <stack>
 #include <ctime>
 #include <set>
 #include <map>
 #include <cmath>

 using namespace std;

 const int maxn = ;
 const int maxm = ;
 int n, ans;
 int len[maxn];
 char s[maxn][maxm];
 set<int> rep[maxn];

 inline bool scan_d(int &num) {
     char in;bool IsN=false;
     in=getchar();
     if(in==EOF) return false;
     while(in!='-'&&(in<''||in>'')) in=getchar();
     if(in=='-'){ IsN=true;num=;}
     else num=in-'';
     while(in=getchar(),in>=''&&in<=''){
             num*=,num+=in-'';
     }
     if(IsN) num=-num;
     return true;
 }

 int main() {
     // freopen("in", "r", stdin);
     int T, _ = ;
     scan_d(T);
     while(T--) {
         ans = ;
         memset(s, , sizeof(s));
         memset(len, , sizeof(len));
         scan_d(n);
         for(int i = ; i <= n; i++) {
             scanf("%s", s[i]);
             rep[i].clear();
         }
         int ans = -;
         for(int i = ; i <= n; i++) {
             for(int j = i - ; j >= ; j--) {
                 if(len[i] < len[j]) continue;
                 if(rep[i].find(j) != rep[i].end()) continue;
                 if(strstr(s[i], s[j]) != NULL) {
                     rep[i].insert(j);
                 }
                 else {
                     ans = i;
                     break;
                 }
             }
         }
         printf("Case #%d: %d\n", _++, ans);
     }
     return ;
 }

TLE

 #include <algorithm>
 #include <iostream>
 #include <iomanip>
 #include <cstring>
 #include <climits>
 #include <complex>
 #include <fstream>
 #include <cassert>
 #include <cstdio>
 #include <bitset>
 #include <vector>
 #include <deque>
 #include <queue>
 #include <stack>
 #include <ctime>
 #include <set>
 #include <map>
 #include <cmath>

 using namespace std;

 const int maxn = ;
 const int maxm = ;
 int n, ans;
 int pre[maxn];
 int len[maxn];
 char s[maxn][maxm];

 int find(int x) {
     return x == pre[x] ? x : pre[x] = find(pre[x]);
 }
 bool check(int x, int y) {
     x = find(x);
     y = find(y);
     if(x == y) return ;
     return ;
 }

 int main() {
     // freopen("in", "r", stdin);
     int T, _ = ;
     scanf("%d", &T);
     while(T--) {
         ans = ;
         memset(s, , sizeof(s));
         memset(len, , sizeof(len));
         scanf("%d", &n);
         for(int i = ; i <= n; i++) {
             scanf("%s", s[i]);
         }
         for(int i = ; i <= n; i++) {
             pre[i] = i;
         }
         int ans = -;
         for(int i = ; i <= n; i++) {
             for(int j = i - ; j >= ; j--) {
                 if(len[i] < len[j]) continue;
                 if(check(i, j)) continue;
                 if(strstr(s[i], s[j]) != NULL) {
                     pre[i] = j;
                 }
                 else {
                     ans = i;
                     break;
                 }
             }
         }
         printf("Case #%d: %d\n", _++, ans);
     }
     return ;
 }