oj.uz

Submission #689662

# Submission time Handle Problem Language Result Execution time Memory
689662 2023-01-29T05:04:41 Z vjudge1 Xoractive (IZhO19_xoractive) C++14
100 / 100
 5 ms 464 KB 
#include "interactive.h"
#include <bits/stdc++.h>
#define REP(v, i, j) for (int v = i; v != j; v++)
#define FORI(v) for (auto i : v)
#define FORJ(v) for (auto j : v)

#define OUT(v, a) \
    FORI(v)       \
    cout << i << a;
#define OUTS(v, a, b)      \
    cout << v.size() << a; \
    OUT(v, b)
#define in(a, n) \
    REP(i, 0, n) \
    cin >> a[i];

#define SORT(v) sort(begin(v), end(v))
#define REV(v) reverse(begin(v), end(v))
#define MEMSET(m) memset(m, -1, sizeof m)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

#define pb push_back
#define fi first
#define se second

#define detachIO                      \
    ios_base::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0);

using namespace std;

typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<pii, pii> piiii;

vector<int> getarr(int n, int mask, int a) {
	vector<int> q;
	REP(i,1,n+1)if(i&mask)q.pb(i);
	if(q.size()==0)return {};
	vector<int> res1=get_pairwise_xor(q);
	q.pb(n+1);
	vector<int> res2=get_pairwise_xor(q);
	multiset<int> st;
	FORI(res2)st.insert(i);
	FORI(res1)st.erase(st.lower_bound(i));
	vector<int> ans;
	FORI(st){
		if(i==0)continue;
		ans.pb(a^i);
	}
	return ans;
}

vector<int> guess(int n, int a) {
	map<int,int> mp;
	REP(i,0,12)FORJ(getarr(n,1<<i,a))mp[j]|=1<<i;
	vector<int> ans;
	ans.resize(n+1);
	ans[n]=a;
	FORI(mp)ans[i.se-1]=i.fi;
	return ans;
}


vector<int> guess(int n) {
	return guess(n-1, ask(n));
}

Subtask #1
6.0 / 6.0

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

Subtask #2
94.0 / 94.0

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