oj.uz

Submission #910940

# Submission time Handle Problem Language Result Execution time Memory
910940 2024-01-18T09:55:31 Z daoquanglinh2007 Xoractive (IZhO19_xoractive) C++17
100 / 100
 3 ms 600 KB 
#include <bits/stdc++.h>
#include "interactive.h"
using namespace std;
 
#define isz(a) (int)(a).size()
#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair
 
map <int, int> cnt[7], tmp;
 
vector <int> comp(vector <int> a, vector <int> b){
	vector <int> c(0);
	int j = 0;
	for (int i = 0; i < isz(b); i++){
		while (j < isz(a) && a[j] < b[i]) c.push_back(a[j++]);
		j++;
	}
	while (j < isz(a)) c.push_back(a[j++]);
	return c;
}
 
bool cmp(int x, int y){
	return __builtin_popcount(x) > __builtin_popcount(y);
}
 
vector <int> guess(int n){
	vector <int> ans(n);
	ans[0] = ask(1);
	for (int i = 0; (1<<i) < n; i++){
		vector <int> a(0), b(0);
		for (int j = 1; j < n; j++)
			if ((j>>i)&1) b.push_back(j+1);
			
		a = b;
		a.push_back(1);
		
		vector <int> c = comp(get_pairwise_xor(a), get_pairwise_xor(b));
		
		for (int j = 1; j < isz(c); j += 2) cnt[i][c[j]^ans[0]]++;
	}
	
	vector <int> ord(0);
	for (int i = n-1; i >= 1; i--) ord.push_back(i);
	//sort(ord.begin(), ord.end(), cmp);
	
	for (int t = 0; t < isz(ord); t++){
		int i = ord[t];
		for (int j = 0; (1<<j) < n; j++)
			if ((i>>j)&1){
				for (pii P : cnt[j]){
					if (P.se == 0) continue;
					bool ok = 1;
					for (int k = j+1; (1<<k) < n; k++)
						if (((i>>k)&1) && cnt[k][P.fi] == 0){
							ok = 0;
							break;
						}
					if (ok){
						ans[i] = P.fi;
						for (int k = 0; (1<<k) < n; k++)
							if ((i>>k)&1){
								cnt[k][P.fi]--;
							}
						break;
					}
				}
				break;
			}
	}
	
	return ans;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
94.0 / 94.0

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