1029 False coin

wa了n次,枚举哪个硬币是不同的,带入条件验证是否有矛盾

要注意:

对于>和<,没有出现在两边的肯定是真的

对于=,出现在两边的肯定是真的

1. //3463503_AC_32MS_292K
2. #include<iostream>
3. #include<string>
4. #include<sstream>
5. using namespace std;
6. #define MAXN 100
8. struct Node
9. {
10.     bool a[MAXN],b[MAXN];
11. };
13. int i,j,n,k,t,pi,m,test,ans;
14. string s;
15. char c;
16. Node wit[MAXN];
17. bool use[MAXN];
18. bool temp[MAXN];
20. int fit(int x)
21. {
22.     int i,ret=0;
23.     for (i=0;i<m;++i)
24.     {
25.         if (!(wit[i].a[x]&&!wit[i].b[x]))
26.         {
27.             break;
28.         }
29.     }
30.     if (i==m)
31.     {
32.         ret++;
33.     }
34.     for (i=0;i<m;++i)
35.     {
36.         if (!(wit[i].b[x]&&!wit[i].a[x]))
37.         {
38.             break;
39.         }
40.     }
41.     if (i==m)
42.     {
43.         ret++;
44.     }
45.     return ret;
46. }
48. int main()
49. {
50.     //freopen("d:/in.txt","r",stdin);
51.     test=0;
52.     while (cin>>n>>k&&!(n==0&&k==0))
53.     {
54.         test++;
55.         memset(use,true,n);
56.         m=0;
57.         for (i=0;i<k;++i)
58.         {
59.             getchar();
60.             getline(cin,s);
61.             stringstream ss(s);
62.             ss>>pi;
63.             cin>>c;
64.             switch (c)
65.             {
66.             case '=':
67.                 for (j=0;j<pi*2;++j)
68.                 {
69.                     ss>>t;
70.                     use[t-1]=false;
71.                 }
72.                 break;
73.             case '<':
74.                 memset(temp,false,n);
75.                 memset(wit[m].a,false,n);
76.                 memset(wit[m].b,false,n);
77.                 for (j=0;j<pi;++j)
78.                 {
79.                     ss>>t;
80.                     wit[m].a[t-1]=true;
81.                     temp[t-1]=true;
82.                 }
83.                 for (j=0;j<pi;++j)
84.                 {
85.                     ss>>t;
86.                     wit[m].b[t-1]=true;
87.                     temp[t-1]=true;
88.                 }
89.                 m++;
90.                 for (j=0;j<n;++j)
91.                 {
92.                     if (!temp[j])
93.                     {
94.                         use[j]=false;
95.                     }
96.                 }
97.                 break;
98.             case '>':
99.                 memset(temp,false,n);
100.                 memset(wit[m].a,false,n);
101.                 memset(wit[m].b,false,n);
102.                 for (j=0;j<pi;++j)
103.                 {
104.                     ss>>t;
105.                     wit[m].b[t-1]=true;
106.                     temp[t-1]=true;
107.                 }
108.                 for (j=0;j<pi;++j)
109.                 {
110.                     ss>>t;
111.                     wit[m].a[t-1]=true;
112.                     temp[t-1]=true;
113.                 }
114.                 m++;
115.                 for (j=0;j<n;++j)
116.                 {
117.                     if (!temp[j])
118.                     {
119.                         use[j]=false;
120.                     }
121.                 }
122.                 break;
123.             }
124.         }
125.         ans=-1;
126.         for (i=0;i<n;++i)
127.         {
128.             if (use[i])
129.             {
130.                 if (fit(i)!=0)
131.                 {
132.                     if (ans!=-1)
133.                     {
134.                         ans=-1;
135.                         break;
136.                     }
137.                     else
138.                     {
139.                         ans=i;
140.                     }
141.                 }
142.             }
143.         }
144.         cout<<ans+1<<endl;
145.     }
146.     return 0;
147. }