oj.uz

답안 #762007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
762007 2023-06-20T14:15:31 Z NK_ Xoractive (IZhO19_xoractive) C++17
100 / 100
 5 ms 444 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
#include "interactive.h"

using namespace std;

#define nl '\n'
#define pb push_back

template<class T> using V = vector<T>;

V<int> sub(V<int> A, V<int> B){
	unordered_map<int, int> C; 
	
	for(auto& v : A) C[v]++;
	for(auto& v : B) C[v]--;
	
	V<int> RES; 
	for(auto p : C) for(int t = 0; t < p.second; t++) RES.push_back(p.first);
	return RES;
}

V<int> add(V<int> A, V<int> B){
	unordered_map<int, int> C; 
	
	for(auto& v : A) C[v]++;
	for(auto& v : B) C[v]++;
	
	V<int> RES; 
	for(auto p : C) for(int t = 0; t < p.second; t++) RES.push_back(p.first);
	return RES;
}

const int LG = 7;
V<int> guess(int N) {
	V<int> ans(N);

	auto XOR = [&](int x, bool IN) {
		V<int> idx; for(int i = 0; i < N; i++) if ((i >> x) & 1) idx.pb(i + 1);
		if (IN) idx.pb(1);

		if (size(idx) <= 1) return V<int>();

		V<int> K = get_pairwise_xor(idx);

		unordered_map<int, int> C; for(auto& v : K) C[v]++;

		V<int> RES; for(auto p : C) if (p.first != 0) {
			for(int t = 0; t < p.second / 2; t++) RES.push_back(p.first);
		}

		return RES;
	};

	auto ASK = [&](int x) { return ask(x + 1); };


	V<V<int>> R(LG), L(LG), D(LG);
	V<int> ALL;

	for(int b = 0; b < LG; b++) { 
		R[b] = sub(XOR(b, 1), XOR(b, 0));
	}

	for(int b = LG - 1; b >= 1; b--) {
		D[b] = add(R[b], L[b]);
		L[b - 1] = sub(D[b], R[b - 1]);
	}

	ALL = add(L[0], R[0]);

	ans[0] = ASK(0);

	for(auto& x : ALL) {
		int pos = 0;
		
		for(int i = 0; i < LG; i++) if (find(begin(R[i]), end(R[i]), x) != end(R[i])) {
			pos ^= (1 << i);
		}

		ans[pos] = x ^ ans[0];
	}

	return ans;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 220 KB Output is correct

Subtask #2
94.0 / 94.0

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