oj.uz

Submission #336942

# Submission time Handle Problem Language Result Execution time Memory
336942 2020-12-17T12:43:51 Z super_j6 Xoractive (IZhO19_xoractive) C++14
100 / 100
 5 ms 620 KB 
#include "interactive.h"
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
#define vi vector<int>

const int mxn = 100;
int k;
int a[mxn];
vi v, p, ans;
map<int, int> f;
/*
int ask(int x){
	return a[x - 1];
}

vi get_pairwise_xor(vi v){
	int n = v.size();
	vi ans;
	for(int i : v)
	for(int j : v){
		ans.push_back(a[i - 1] ^ a[j - 1]);
	}
	sort(ans.begin(), ans.end());
	return ans;
}
*/
vi guess(int n){
	k = __lg(n - 1) + 1;
	ans.resize(n);
	ans[0] = ask(1);
	for(int i = 0; i < k; i++){
		v.clear();
		for(int j = 1; j < n; j++) if((j >> i) & 1) v.push_back(j + 1);
		p = get_pairwise_xor(v);
		for(int j : p) if(j) f[j] -= (1 << i);
		v.push_back(1);
		p = get_pairwise_xor(v);
		for(int j : p) if(j) f[j] += (1 << i);
	}
	for(pi i : f) if(i.s) ans[i.s / 2] = i.f ^ ans[0];
	return ans;
}
/*
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	
	for(int i = 0; i < n; i++) cin >> a[i];
	
	vi v = guess(n);
	
	for(int i : v) cout << i << " ";
	cout << endl;

	return 0;
}
*/

Subtask #1
6.0 / 6.0

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