oj.uz

Submission #224215

# Submission time Handle Problem Language Result Execution time Memory
224215 2020-04-17T13:37:21 Z bortoz Xoractive (IZhO19_xoractive) C++17
100 / 100
 11 ms 444 KB 
#include "bits/stdc++.h"
#include "interactive.h"
using namespace std;

vector<int> guess(int N) {
  vector<int> ans(N, -1);
  ans[0] = ask(1);

  vector<vector<int>> can(N);
  for (int k = 0; k < 7; k++) {
    vector<int> pos, A, B, C;

    for (int i = 0; i < N; i++) {
      if (~i & 1 << k) {
        pos.push_back(i + 1);
      }
    }

    A = get_pairwise_xor(pos);
    pos.erase(pos.begin());
    B = get_pairwise_xor(pos);
    set_difference(A.begin(), A.end(), B.begin(), B.end(), back_inserter(C));

    C.erase(find(C.begin(), C.end(), 0));
    for (int& i : C) {
      i ^= ans[0];
    }
    C.erase(unique(C.begin(), C.end()), C.end());
    sort(C.begin(), C.end());

    for (int i = 1; i < N; i++) {
      if (~i & 1 << k) {
        if (can[i].empty()) {
          can[i] = C;
        } else {
          can[i].erase(set_intersection(can[i].begin(), can[i].end(), C.begin(),
                                        C.end(), can[i].begin()), can[i].end());
        }
      }
    }
  }

  while (count(ans.begin(), ans.end(), -1)) {
    for (int i = 1; i < N; i++) {
      if (ans[i] == -1 && can[i].size() == 1) {
        ans[i] = can[i][0];
        for (int j = 1; j < N; j++) {
          auto it = find(can[j].begin(), can[j].end(), ans[i]);
          if (it != can[j].end()) {
            can[j].erase(it);
          }
        }
      }
    }
  }
  return ans;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct

Subtask #2
94.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 7 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 7 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 7 ms 384 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 8 ms 384 KB Output is correct
15 Correct 7 ms 384 KB Output is correct
16 Correct 7 ms 384 KB Output is correct
17 Correct 8 ms 384 KB Output is correct
18 Correct 7 ms 384 KB Output is correct
19 Correct 7 ms 384 KB Output is correct
20 Correct 7 ms 384 KB Output is correct
21 Correct 8 ms 384 KB Output is correct
22 Correct 8 ms 444 KB Output is correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 7 ms 384 KB Output is correct
25 Correct 7 ms 384 KB Output is correct
26 Correct 7 ms 384 KB Output is correct
27 Correct 7 ms 384 KB Output is correct
28 Correct 8 ms 384 KB Output is correct
29 Correct 8 ms 384 KB Output is correct
30 Correct 7 ms 384 KB Output is correct
31 Correct 7 ms 384 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 7 ms 384 KB Output is correct
34 Correct 7 ms 384 KB Output is correct
35 Correct 7 ms 384 KB Output is correct
36 Correct 7 ms 384 KB Output is correct
37 Correct 7 ms 384 KB Output is correct
38 Correct 7 ms 384 KB Output is correct
39 Correct 7 ms 384 KB Output is correct
40 Correct 7 ms 384 KB Output is correct
41 Correct 7 ms 384 KB Output is correct
42 Correct 7 ms 384 KB Output is correct
43 Correct 7 ms 384 KB Output is correct
44 Correct 8 ms 384 KB Output is correct
45 Correct 7 ms 384 KB Output is correct
46 Correct 7 ms 384 KB Output is correct
47 Correct 7 ms 384 KB Output is correct
48 Correct 8 ms 384 KB Output is correct
49 Correct 8 ms 384 KB Output is correct
50 Correct 8 ms 384 KB Output is correct
51 Correct 7 ms 384 KB Output is correct
52 Correct 8 ms 384 KB Output is correct
53 Correct 7 ms 384 KB Output is correct
54 Correct 7 ms 384 KB Output is correct
55 Correct 7 ms 384 KB Output is correct
56 Correct 8 ms 384 KB Output is correct
57 Correct 11 ms 384 KB Output is correct
58 Correct 7 ms 384 KB Output is correct
59 Correct 7 ms 384 KB Output is correct
60 Correct 7 ms 384 KB Output is correct
61 Correct 7 ms 384 KB Output is correct
62 Correct 8 ms 384 KB Output is correct
63 Correct 7 ms 384 KB Output is correct
64 Correct 7 ms 384 KB Output is correct
65 Correct 7 ms 384 KB Output is correct
66 Correct 8 ms 384 KB Output is correct
67 Correct 7 ms 384 KB Output is correct
68 Correct 7 ms 384 KB Output is correct
69 Correct 7 ms 256 KB Output is correct
70 Correct 7 ms 384 KB Output is correct
71 Correct 7 ms 384 KB Output is correct
72 Correct 8 ms 384 KB Output is correct
73 Correct 7 ms 384 KB Output is correct
74 Correct 7 ms 384 KB Output is correct
75 Correct 7 ms 384 KB Output is correct
76 Correct 7 ms 384 KB Output is correct
77 Correct 7 ms 384 KB Output is correct
78 Correct 7 ms 384 KB Output is correct
79 Correct 7 ms 384 KB Output is correct
80 Correct 11 ms 384 KB Output is correct
81 Correct 7 ms 384 KB Output is correct
82 Correct 8 ms 384 KB Output is correct
83 Correct 7 ms 384 KB Output is correct
84 Correct 7 ms 384 KB Output is correct
85 Correct 7 ms 384 KB Output is correct
86 Correct 7 ms 384 KB Output is correct
87 Correct 7 ms 384 KB Output is correct
88 Correct 7 ms 384 KB Output is correct
89 Correct 7 ms 384 KB Output is correct
90 Correct 8 ms 384 KB Output is correct
91 Correct 7 ms 384 KB Output is correct
92 Correct 7 ms 384 KB Output is correct
93 Correct 7 ms 384 KB Output is correct
94 Correct 7 ms 384 KB Output is correct
95 Correct 7 ms 384 KB Output is correct
96 Correct 7 ms 384 KB Output is correct
97 Correct 8 ms 384 KB Output is correct
98 Correct 7 ms 384 KB Output is correct
99 Correct 7 ms 384 KB Output is correct
100 Correct 8 ms 384 KB Output is correct