UVa11175 From D to E and Back (结论)

 1 #include <cstdio>
 2 #include <cstdlib>
 3 #include <cstring>
 4 
 5 const int maxn = 300 + 5;
 6 
 7 int m, k;
 8 int G[maxn][maxn];
 9 
10 int main() {
11     int T;
12     scanf("%d", &T);
13     for (int kase = 1; kase <= T; kase++) {
14         memset(G, 0, sizeof(G));
15         scanf("%d%d", &m, &k);
16         while (k--) {
17             int x, y;
18             scanf("%d%d", &x, &y);
19             G[x][y] = 1;
20         }
21         bool ok = true;
22         for (int i = 0; i < m; i++)
23             for (int j = i + 1; j < m; j++) {
24                 int f1 = 0, f2 = 0;
25                 for (int k = 0; k < m; k++) {
26                     if (G[i][k] && G[j][k]) f1 = 1;
27                     if (G[i][k] ^ G[j][k]) f2 = 1;
28                 }
29                 if (f1 && f2) { ok = false; break; }
30             }
31         printf("Case #%d: ", kase);
32         if (ok) printf("Yes\n");
33         else printf("No\n");
34     }
35     return 0;
36 }