oj.uz

Submission #287872

# Submission time Handle Problem Language Result Execution time Memory
287872 2020-09-01T05:41:23 Z dvdg6566 Xoractive (IZhO19_xoractive) C++14
100 / 100
 7 ms 640 KB 
#include "interactive.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb emplace_back
#define mp make_pair
#define f first
#define s second
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
#define lb lower_bound
const int MAXN=1001000;
const ll MOD=998244353;

set<int> V[10];
int N;

set<int> query(vi A){
	if(SZ(A) == 0){
		set<int> K;
		return K;
	}
	vi a = get_pairwise_xor(A);
	A.pb(N);
	vi b = get_pairwise_xor(A);
	multiset<int> M;
	for(auto i:b)M.insert(i);
	for(auto i:a)M.erase(M.find(i));
	A.pop_back();
	set<int> T;
	for(auto i:M)T.insert(i);
	T.erase(0);
	assert(SZ(T) == SZ(A));
	return T;
}


vector<int> guess(int n) {
	N=n;
	int lst=ask(n);
	set<int> universe;
	
	for(int i=0;i<7;++i){
		vi X;
		for(int w=1;w<N;++w){
			if(w & (1<<i))X.pb(w);
		}
		if(!SZ(X))continue;
		V[i] = query(X);
		for(auto t:V[i])universe.insert(t);
	}

	vector <int> ans;
	// if(n > 1)universe.insert(ask(n-1) ^ lst);

	for(int i=1;i<N;++i){
		for(auto curv:universe){
			int fail = 0;
			for(int k=0;k<7;++k){
				int a = (V[k].find(curv) != V[k].end());
				int b = ((1<<k) & i) > 0;
				if(a!=b)fail=1;
			}
			if(fail)continue;
			ans.pb(curv^lst);
		}
	}
	ans.pb(lst);
	return ans;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct

Subtask #2
94.0 / 94.0

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