oj.uz

Submission #346685

# Submission time Handle Problem Language Result Execution time Memory
346685 2021-01-10T16:40:33 Z milleniumEeee Xoractive (IZhO19_xoractive) C++17
100 / 100
 6 ms 492 KB 
#include "interactive.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
#define all(s) s.begin(), s.end()
#define szof(s) (int)s.size()
using namespace std;

int x;

vector <int> get_numbers(vector <int> pos) { // 2 queries
  vector <int> vec1, vec2;
  vec1.push_back(1);
  for (int el : pos) {
    vec1.push_back(el);
  }
  for (int el : pos) {
    vec2.push_back(el);
  }
  map <int, int> mp;
  vector <int> pairwise = get_pairwise_xor(vec1);
  for (int el : pairwise) {
    mp[el]++;
  }
  pairwise = get_pairwise_xor(vec2);
  for (int el : pairwise) {
    mp[el]--;
  }
  mp[0]--;
  vector <int> numbers;
  for (auto &el : mp) {
    el.second /= 2;
    for (int i = 1; i <= el.second; i++) {
      numbers.push_back((x ^ el.first));
    }
  }
  sort(all(numbers));
  return numbers;
}

bool exist(vector <int> &vec, int x) {
  return binary_search(all(vec), x);
}

vector<int> guess(int n) {
	vector <int> ans(n);
  x = ask(1);
  ans[0] = x;
  if (n == 1) {
    return ans;
  }
  vector <int> arr;
  for (int i = 2; i <= n; i++) {
    arr.push_back(i);
  }
  map <int, int> pos;
  for (int i = 0; i <= 7; i++) {
    vector <int> on;
    for (int mask = 2; mask <= n; mask++) {
      if (mask & (1 << i)) {
        on.push_back(mask);
      }
    }
    if (on.empty()) {
      continue;
    }
    vector <int> vec = get_numbers(on);
    for (int num : vec) {
      pos[num] += (1 << i);
    }
  }
  for (auto el : pos) {
    ans[el.second - 1] = el.first;
  }
  return ans;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct

Subtask #2
94.0 / 94.0

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