Submission #384372

# Submission time Handle Problem Language Result Execution time Memory
384372 2021-04-01T13:27:54 Z vanic Xoractive (IZhO19_xoractive) C++14
100 / 100
4 ms 512 KB
#include "interactive.h"
#include <cmath>
#include <iostream>
#include <algorithm>
#include <set>
#include <cassert>

using namespace std;

const int Log=7;

vector < int > sol;
vector < int > q;
vector < int > odg1, odg2;
vector < int > komp;
vector < int > val[Log];

vector < int > tren;

void probaj(int x){
	int pos;
	for(int i=0; i<Log; i++){
		if((1<<i)&x){
			if(tren.empty()){
				tren=val[i];
			}
			else{
				pos=0;
				for(int j=0; j<(int)tren.size(); j++){
					while(pos<(int)val[i].size() && val[i][pos]<tren[j]){
						pos++;
					}
//					cout << val[i][pos] << endl;
					if(pos>=(int)val[i].size() || tren[j]!=val[i][pos]){
//						cout << "brisem " << j << endl;
						tren.erase(tren.begin()+j);
						j--;
					}
					else{
						pos++;
					}
				}
			}
		}
/*		for(int i=0; i<tren.size(); i++){
			cout << tren[i] << ' ';
		}
		cout << endl;*/
	}
	while(tren.size()>1 && tren.back()==tren[0]){
		tren.pop_back();
	}
	assert(!tren.empty());
	if(tren.size()>1){
		tren={ask(x+1)};
	}
//	assert(tren.size()==1);
	for(int i=0; i<Log; i++){
		if((1<<i)&x){
			val[i].erase(find(val[i].begin(), val[i].end(), tren[0]));
		}
	}
	sol[x]=tren[0];
	tren.clear();
}

vector < int > guess(int n){
	sol.resize(n, 0);
	sol[0]=ask(1);
	for(int j=0; j<Log; j++){
		for(int i=1; i<n; i++){
			if(i&(1<<j)){
				q.push_back(i+1);
			}
		}
		if(q.empty()){
			break;
		}
		odg2=get_pairwise_xor(q);
		q.push_back(1);
		odg1=get_pairwise_xor(q);
		q.clear();
		int pos1=0, pos2=0;
		for(int i=0; i<(int)odg1.size(); i++){
			if(pos2<(int)odg2.size() && odg1[pos1]==odg2[pos2]){
				pos1++;
				pos2++;
			}
			else{
				komp.push_back(odg1[pos1]);
				pos1++;
			}
		}
		for(int i=1; i<(int)komp.size(); i+=2){
			val[j].push_back(sol[0]^komp[i]);
//			cout << val[j].back() << ' ';
		}
		sort(val[j].begin(), val[j].end());
//		cout << endl;
		komp.clear();
	}
//	cout << endl;
	for(int i=n-1; i>0; i--){
		probaj(i);
	}
/*	for(int i=0; i<n; i++){
		cout << sol[i] << ' ';
	}
	cout << endl;*/
	return sol;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 364 KB Output is correct
2 Correct 3 ms 364 KB Output is correct
3 Correct 3 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 364 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 3 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 3 ms 364 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 3 ms 364 KB Output is correct
17 Correct 4 ms 364 KB Output is correct
18 Correct 3 ms 364 KB Output is correct
19 Correct 3 ms 364 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 364 KB Output is correct
22 Correct 3 ms 364 KB Output is correct
23 Correct 3 ms 364 KB Output is correct
24 Correct 3 ms 364 KB Output is correct
25 Correct 3 ms 364 KB Output is correct
26 Correct 3 ms 364 KB Output is correct
27 Correct 3 ms 364 KB Output is correct
28 Correct 3 ms 364 KB Output is correct
29 Correct 3 ms 364 KB Output is correct
30 Correct 3 ms 364 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 3 ms 364 KB Output is correct
33 Correct 4 ms 364 KB Output is correct
34 Correct 4 ms 364 KB Output is correct
35 Correct 3 ms 364 KB Output is correct
36 Correct 3 ms 364 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
38 Correct 3 ms 364 KB Output is correct
39 Correct 3 ms 364 KB Output is correct
40 Correct 3 ms 380 KB Output is correct
41 Correct 3 ms 364 KB Output is correct
42 Correct 3 ms 364 KB Output is correct
43 Correct 3 ms 364 KB Output is correct
44 Correct 3 ms 364 KB Output is correct
45 Correct 3 ms 364 KB Output is correct
46 Correct 3 ms 364 KB Output is correct
47 Correct 2 ms 364 KB Output is correct
48 Correct 3 ms 364 KB Output is correct
49 Correct 3 ms 364 KB Output is correct
50 Correct 3 ms 364 KB Output is correct
51 Correct 3 ms 364 KB Output is correct
52 Correct 3 ms 364 KB Output is correct
53 Correct 3 ms 364 KB Output is correct
54 Correct 3 ms 364 KB Output is correct
55 Correct 3 ms 364 KB Output is correct
56 Correct 3 ms 364 KB Output is correct
57 Correct 3 ms 364 KB Output is correct
58 Correct 3 ms 364 KB Output is correct
59 Correct 3 ms 364 KB Output is correct
60 Correct 3 ms 364 KB Output is correct
61 Correct 3 ms 364 KB Output is correct
62 Correct 3 ms 364 KB Output is correct
63 Correct 2 ms 364 KB Output is correct
64 Correct 3 ms 364 KB Output is correct
65 Correct 3 ms 364 KB Output is correct
66 Correct 3 ms 364 KB Output is correct
67 Correct 3 ms 364 KB Output is correct
68 Correct 3 ms 364 KB Output is correct
69 Correct 3 ms 364 KB Output is correct
70 Correct 3 ms 364 KB Output is correct
71 Correct 3 ms 364 KB Output is correct
72 Correct 3 ms 364 KB Output is correct
73 Correct 3 ms 364 KB Output is correct
74 Correct 3 ms 364 KB Output is correct
75 Correct 3 ms 364 KB Output is correct
76 Correct 3 ms 364 KB Output is correct
77 Correct 3 ms 364 KB Output is correct
78 Correct 3 ms 364 KB Output is correct
79 Correct 3 ms 364 KB Output is correct
80 Correct 3 ms 364 KB Output is correct
81 Correct 3 ms 364 KB Output is correct
82 Correct 3 ms 364 KB Output is correct
83 Correct 3 ms 364 KB Output is correct
84 Correct 3 ms 364 KB Output is correct
85 Correct 4 ms 364 KB Output is correct
86 Correct 4 ms 364 KB Output is correct
87 Correct 3 ms 364 KB Output is correct
88 Correct 3 ms 364 KB Output is correct
89 Correct 3 ms 364 KB Output is correct
90 Correct 3 ms 364 KB Output is correct
91 Correct 3 ms 364 KB Output is correct
92 Correct 3 ms 364 KB Output is correct
93 Correct 3 ms 364 KB Output is correct
94 Correct 3 ms 364 KB Output is correct
95 Correct 3 ms 364 KB Output is correct
96 Correct 3 ms 364 KB Output is correct
97 Correct 3 ms 364 KB Output is correct
98 Correct 3 ms 364 KB Output is correct
99 Correct 3 ms 364 KB Output is correct
100 Correct 3 ms 364 KB Output is correct