oj.uz

답안 #340977

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
340977 2020-12-28T19:06:16 Z rqi Xoractive (IZhO19_xoractive) C++14
100 / 100
 7 ms 512 KB 
#include "interactive.h"
#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;

#define f first
#define s second
#define mp make_pair
#define pb push_back

#define ins insert

#define sz(x) (int)(x).size()

int n;
int val;
vi subqs[10];
vi res[10];

vi querySub(vi sub){
	
	if(sz(sub) == 0) return sub;
	for(auto &u: sub){
		u++;
	}

	// cout << "sub: ";
	// for(auto u: sub){
	// 	cout << u << " ";
	// }
	// cout << "\n";


	vi vals;
	map<int, int> freq;
	vi q1 = get_pairwise_xor(sub);

	// cout << "q1: ";
	// for(auto u: q1){
	// 	cout << u << " ";
	// }
	// cout << "\n";

	sub.pb(n);
	vi q2 = get_pairwise_xor(sub);

	// cout << "q2: ";
	// for(auto u: q2){
	// 	cout << u << " ";
	// }
	// cout << "\n";

	for(auto u: q2){
		freq[u]++;
	}
	for(auto u: q1){
		freq[u]--;
	}
	freq[0]--;

	for(auto u: freq){
		assert(u.s == 0 || u.s == 2);
		if(u.s == 2){
			vals.pb(u.f^val);
		}
	}

	// cout << "vals: ";
	// for(auto u: vals) cout << u << " ";
	// cout << "\n";

	return vals;
}

void assignQ(int L = 0, int R = 127, int ind = 0){
	int M = (L+R)/2;
	for(int i = L; i <= M; i++){
		if(0 <= i && i <= n-2){
			subqs[ind].pb(i);
		}
	}
	if(L == M) return;
	assignQ(L, M, ind+1);
	assignQ(M+1, R, ind+1);
}

int getPos(int v, int L = 0, int R = 127, int ind = 0){
	if(L == R) return L;
	int M = (L+R)/2;
	bool found = 0;
	for(auto u: res[ind]){
		if(v == u) found = 1;
	}
	if(found){
		return getPos(v, L, M, ind+1);
	}
	return getPos(v, M+1, R, ind+1);
}

vi guess(int _n) {
	n = _n;
	vi ans(n, 0);
	val = ask(n);
	ans[n-1] = val;

	assignQ();

	for(int i = 0; i < 10; i++){
		if(sz(subqs[i]) == 0) break;
		res[i] = querySub(subqs[i]); //what numbers are in this subset?
	}

	set<int> allvals;
	for(int i = 0; i < 10; i++){
		for(auto u: res[i]){
			allvals.ins(u);
		}
	}

	// cout << "allvals: ";
	// for(auto u: allvals) cout << u << " ";
	// cout << "\n";

	for(auto u: allvals){
		ans[getPos(u)] = u;
	}

	return ans;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
94.0 / 94.0

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