oj.uz

답안 #241963

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
241963 2020-06-26T12:35:24 Z valerikk Xoractive (IZhO19_xoractive) C++17
100 / 100
 11 ms 512 KB 
#include "interactive.h"
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
//#define int ll

#define mp make_pair
#define pb push_back
#define x first
#define y second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()

vector<int> get_xor(vector<int> pos) {
  if (pos.empty()) return {};
  for (auto &i : pos) i++;
  auto kek = get_pairwise_xor(pos);
  map<int, int> cnt;
  for (auto i : kek) {
    if (i != 0) cnt[i]++;
  }
  vector<int> flex;
  for (auto i : cnt) {
    i.y /= 2;
    while (i.y--) {
      flex.pb(i.x);
    }
  }
  return flex;
}

vector<int> get_kek(int a1, vector<int> pos) {
  auto kek1 = get_xor(pos);
  pos.pb(0);
  auto kek2 = get_xor(pos);
  map<int, int> cnt;
  for (auto i : kek2) cnt[i]++;
  for (auto i : kek1) cnt[i]--;
  vector<int> res;
  for (auto i : cnt) {
    if (i.y) {
      res.pb(i.x ^ a1);
    }
  }
  return res;
}

vector<int> guess(int n) {
  vector<int> a(n);
  a[0] = ask(1);
  set<int> st;
  vector<set<int>> have(7);
  for (int i = 0; i < 7; i++) {
    vector<int> pos;
    for (int j = 1; j < n; j++) {
      if ((j >> i) & 1) pos.pb(j);
    }
    auto kek = get_kek(a[0], pos);
    for (auto flex : kek) {
      st.insert(flex);
      have[i].insert(flex);
    }
  }
  for (auto i : st) {
    int ind = 0;
    for (int j = 0; j < 7; j++) {
      if (have[j].count(i)) ind += 1 << j;
    }
    a[ind] = i;
  }
  return a;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #2
94.0 / 94.0

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