oj.uz

답안 #288956

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288956 2020-09-02T08:29:18 Z AMO5 Xoractive (IZhO19_xoractive) C++17
100 / 100
 40 ms 512 KB 
#include <bits/stdc++.h>
#include "interactive.h"

using namespace std;

#define ii pair<int,int>
#define vi vector<int>
#define sz(x) (int)x.size()

vi pos[111];

vi guess(int n){
	vi res;
	res.resize(n);
	if(n<=15){
		for(int i=0; i<n; i++)
			res[i]=ask(i+1);
		return res;
	}
	res[0]=(ask(1));
	int k=-1;
	while(n>(1<<++k)){}
	for(int i=0; i<k; i++){
		vi po;
		for(int j=0; j<n; j++){
			if(j>>i&1)po.emplace_back(j+1);
		}
		vi q = get_pairwise_xor(po);
		po.emplace_back(1);
		
		pos[i] = get_pairwise_xor(po);
		pos[i].erase(pos[i].begin());
		for(int x:q)
			pos[i].erase(find(pos[i].begin(),pos[i].end(),x));
		for(int &x:pos[i]){
			x=x^res[0];
		}
	}
	for(int i=1; i<n; i++){
		vi v;
		for(int j=0; j<k; j++){
			if((i>>j&1)^1)continue;
			//settle overlapping
			if(sz(v)){
				vi w;
				for(int x:pos[j]){
					if(find(v.begin(),v.end(),x)!=v.end())
						w.emplace_back(x);
				}
				v = w;
			}else{
				v = pos[j];
			}
		}
		for(int j=0; j<k; j++){
			if(i>>j&1)continue;
			for(int x:pos[j]){
				if(find(v.begin(),v.end(),x)!=v.end())
					v.erase(find(v.begin(),v.end(),x));
			}
		}
		res[i]=v[0];
	}
	return res;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 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 1 ms 256 KB Output is correct

Subtask #2
94.0 / 94.0

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