UVa1572 UVaLive6393 Self-Assembly

填坑系列(p.172)

注意“可以旋转和翻转”

然后将每个字母看成点

不然边数就是n^2级的

 #include<cstdio>
 #include<cstring>
 #include<cstdlib>
 #include<algorithm>
 #include<iostream>

 using namespace std;

 void setIO(const string& s) {
     freopen((s + ".in").c_str(), "r", stdin);
     freopen((s + ".out").c_str(), "w", stdout);
 }
 template<typename Q> Q read(Q& x) {
     static char c, f;
     for(f = ; c = getchar(), !isdigit(c); ) if(c == '-') f = ;
     for(x = ; isdigit(c); c = getchar()) x = x *  + c - '';
     if(f) x = -x;
     return x;
 }
 template<typename Q> Q read() {
     static Q x; read(x); return x;
 }

 int ID(char a1, char a2) {
     return (a1 - 'A') <<  | (a2 == '-');
 }

 int G[][];

 void AddEdge(char a1, char a2, char b1, char b2) {
     if(a1 == '' || b1 == '') return;
     int u = ID(a1, a2) ^ , v = ID(b1, b2);
     G[u][v] = ;
 }

 int vis[];

 bool dfs(int u) {
     vis[u] = -;
     for(int v = ; v < ; v++) if(G[u][v]) {
         if(vis[v] < ) return ;
         if(!vis[v] && dfs(v)) return ;
     }
     vis[u] = ;
     return ;
 }

 bool find() {
     memset(vis, , sizeof vis);
     for(int u = ; u < ; u++) if(!vis[u]) {
         if(dfs(u)) return ;
     }
     return ;
 }

 int main() {
 #ifdef DEBUG
     freopen("in.txt", "r", stdin);
     freopen("out.txt", "w", stdout);
 #endif

     int n;
     while(scanf("%d", &n) ==  && n) {
         memset(G, , sizeof G);
         char s[];
         for(int i = ; i < n; i++) {
             scanf("%s", s);
             for(int i = ; i < ; i++) {
                 for(int j = ; j < ; j++) if(i ^ j) {
                     AddEdge(s[i << ], s[i <<  | ], s[j << ] , s[j <<  | ]);
                 }
             }
         }
         if(find()) puts("unbounded");
         else puts("bounded");
     }

     return ;
 }