Submission #143611

# Submission time Handle Problem Language Result Execution time Memory
143611 2019-08-14T18:10:50 Z impetus_ Xoractive (IZhO19_xoractive) C++14
100 / 100
7 ms 504 KB
#include "interactive.h"
#include<bits/stdc++.h>

#define mp make_pair
#define pb push_back
#define f first
#define s second 
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define forn(i, x, y) for(int i = x; i <= y; i++)
#define forev(i, y, x) for(int i = y; i >= x; i--)

using namespace std;

const int maxn = (int)3e5 + 100;
const int mod = (int)1e9 + 7;
const int P = (int)1e6 + 7;
const int inf = (int)1e9 + 7;

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef long double ld;

using namespace std;
/*
int n, a[maxn];
int ask(int pos){
	return a[pos];
}
vi get_pairwise_xor(vi v){
	vi cur;
	for(auto x : v)
		for(auto y : v)
			cur.pb(a[x] ^ a[y]);
	sort(all(cur));
	return cur;
}
*/
vi clear(vi now, int kek){
	while(kek--) now.erase(now.begin());
	forn(i, 0, sz(now) - 1){
		if(i < sz(now))
			now.erase(now.begin() + i);
	}
	return now;
}
vi elements(vi cur){
	vi now = get_pairwise_xor(cur), v;
	int f = ask(cur[0]);
	now = clear(now, sz(cur));
	vi nxt = cur;
	nxt.erase(nxt.begin());
	nxt = get_pairwise_xor(nxt);
	nxt = clear(nxt, sz(cur) - 1);
	map<int, int> was;
	for(auto x : nxt) was[x] = 1;
	for(auto x : now)
		if(!was[x])
			v.pb(x ^ f);
	v.pb(f);
	return v;
}
int End[maxn];
vector<int> guess(int n) {
	vector <int> ans;
	map<int, int> pos;
	int f=ask(1);
	for(int bit = 0; bit <= 30; bit++){
		vi cur;
		for(int i = 0; i < n; i++){
			if((i >> bit) & 1)
				cur.pb(i+1);
		}
		if(!sz(cur)) break;
		vi b=get_pairwise_xor(cur);
		cur.pb(1);
		vi now=get_pairwise_xor(cur);
		now.erase(now.begin());
		for(auto d:b)
		now.erase(find(all(now), d));
		for(auto &d:now)
			d ^= f;
		forn(i,0,sz(now)-1)
			now.erase(now.begin()+i);
		for(auto x:now){
			pos[x]+=(1<<bit);
		}
	}
	ans.resize(n);
	ans[0]=f;
	for(auto x : pos)
		ans[x.s] = x.f;
	return ans;
}/*
int main () {
	cin >> n;
	map<int,int>used;
	forn(i, 0, n-1){
		a[i]=i
	}
	for(auto x : guess(n))
		cout << x << " ";
}*/
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 404 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 6 ms 248 KB Output is correct
8 Correct 6 ms 372 KB Output is correct
9 Correct 6 ms 252 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 6 ms 248 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 6 ms 248 KB Output is correct
19 Correct 6 ms 252 KB Output is correct
20 Correct 6 ms 248 KB Output is correct
21 Correct 6 ms 376 KB Output is correct
22 Correct 6 ms 248 KB Output is correct
23 Correct 6 ms 248 KB Output is correct
24 Correct 7 ms 376 KB Output is correct
25 Correct 6 ms 376 KB Output is correct
26 Correct 7 ms 404 KB Output is correct
27 Correct 6 ms 376 KB Output is correct
28 Correct 6 ms 248 KB Output is correct
29 Correct 6 ms 376 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 6 ms 376 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 6 ms 276 KB Output is correct
34 Correct 6 ms 376 KB Output is correct
35 Correct 6 ms 376 KB Output is correct
36 Correct 6 ms 376 KB Output is correct
37 Correct 6 ms 376 KB Output is correct
38 Correct 6 ms 376 KB Output is correct
39 Correct 6 ms 376 KB Output is correct
40 Correct 6 ms 248 KB Output is correct
41 Correct 6 ms 376 KB Output is correct
42 Correct 6 ms 376 KB Output is correct
43 Correct 6 ms 376 KB Output is correct
44 Correct 6 ms 504 KB Output is correct
45 Correct 6 ms 356 KB Output is correct
46 Correct 6 ms 376 KB Output is correct
47 Correct 6 ms 376 KB Output is correct
48 Correct 6 ms 252 KB Output is correct
49 Correct 6 ms 376 KB Output is correct
50 Correct 6 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 6 ms 376 KB Output is correct
53 Correct 6 ms 376 KB Output is correct
54 Correct 6 ms 376 KB Output is correct
55 Correct 5 ms 376 KB Output is correct
56 Correct 6 ms 376 KB Output is correct
57 Correct 6 ms 376 KB Output is correct
58 Correct 6 ms 376 KB Output is correct
59 Correct 6 ms 248 KB Output is correct
60 Correct 6 ms 376 KB Output is correct
61 Correct 6 ms 376 KB Output is correct
62 Correct 6 ms 248 KB Output is correct
63 Correct 5 ms 376 KB Output is correct
64 Correct 6 ms 248 KB Output is correct
65 Correct 6 ms 376 KB Output is correct
66 Correct 6 ms 456 KB Output is correct
67 Correct 6 ms 376 KB Output is correct
68 Correct 6 ms 372 KB Output is correct
69 Correct 6 ms 248 KB Output is correct
70 Correct 7 ms 376 KB Output is correct
71 Correct 6 ms 376 KB Output is correct
72 Correct 6 ms 376 KB Output is correct
73 Correct 6 ms 376 KB Output is correct
74 Correct 6 ms 376 KB Output is correct
75 Correct 6 ms 376 KB Output is correct
76 Correct 6 ms 504 KB Output is correct
77 Correct 6 ms 248 KB Output is correct
78 Correct 6 ms 376 KB Output is correct
79 Correct 5 ms 376 KB Output is correct
80 Correct 6 ms 376 KB Output is correct
81 Correct 6 ms 248 KB Output is correct
82 Correct 6 ms 376 KB Output is correct
83 Correct 5 ms 248 KB Output is correct
84 Correct 6 ms 248 KB Output is correct
85 Correct 6 ms 376 KB Output is correct
86 Correct 6 ms 376 KB Output is correct
87 Correct 6 ms 376 KB Output is correct
88 Correct 7 ms 464 KB Output is correct
89 Correct 6 ms 252 KB Output is correct
90 Correct 6 ms 376 KB Output is correct
91 Correct 6 ms 376 KB Output is correct
92 Correct 6 ms 376 KB Output is correct
93 Correct 6 ms 248 KB Output is correct
94 Correct 6 ms 248 KB Output is correct
95 Correct 6 ms 380 KB Output is correct
96 Correct 6 ms 376 KB Output is correct
97 Correct 6 ms 376 KB Output is correct
98 Correct 6 ms 376 KB Output is correct
99 Correct 6 ms 376 KB Output is correct
100 Correct 6 ms 376 KB Output is correct