[NOI十连测] 二进制的世界

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <cstdlib>
 4 #include <cctype>
 5 #include <vector>
 6 using namespace std;
 7 #define F(i, a, b) for (register int i = (a); i <= (b); i++)
 8 inline int rd(void) {
 9     int f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == ‘-‘) f = -1;
10     int x = 0; for (; isdigit(c); c = getchar()) x = x*10+c-‘0‘; return x*f;
11 }
12 
13 const int N = 100005;
14 
15 int n, Ty, a[N]; char Op; vector<int> g[256];
16 inline int Compute(int x, int y) { return Op == ‘a‘ ? (x & y) : Op == ‘o‘ ? (x | y) : (x ^ y); }
17 
18 int main(void) {
19     #ifndef ONLINE_JUDGE
20         freopen("bin.in", "r", stdin);
21     #endif
22     
23     n = rd(); for (Op = getchar(); !isalpha(Op); Op = getchar()); Ty = rd();
24     F(i, 1, n) a[i] = rd();
25     
26     F(i, 2, n) {
27         g[a[i-1] >> 8].push_back(a[i-1]);
28         
29         static vector<int> List; List.clear(); int id = -1;
30         F(j, 0, 255) if (g[j].size() > 0) {
31             if (id == -1)
32                 List.push_back(id = j);
33             else if (Compute(a[i], j << 8) > Compute(a[i], id << 8))
34                 List.clear(), List.push_back(id = j);
35             else if (Compute(a[i], j << 8) == Compute(a[i], id << 8))
36                 List.push_back(j);
37         }
38         
39         int res = -1, cnt = 0;
40         for (vector<int>::iterator pos = List.begin(); pos != List.end(); pos++)
41             for (vector<int>::iterator it = g[*pos].begin(); it != g[*pos].end(); it++) {
42                 int t = Compute(a[i], *it);
43                 if (t > res) res = t, cnt = 1; else if (t == res) cnt++;
44             }
45         !Ty ? printf("%d\n", res) : printf("%d %d\n", res, cnt);
46     }
47     
48     return 0;
49 }