oj.uz

답안 #881271

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
881271 2023-12-01T03:11:31 Z Chal1shkan Xoractive (IZhO19_xoractive) C++17
100 / 100
 4 ms 600 KB 
# include "interactive.h"
# include <bits/stdc++.h>
 
# define pb push_back
# define ff first
# define ss second
# define nl "\n"
# define sz(x) ((int)(x).size())
# define all(x) (x).begin(), (x).end()
# define deb(x) cerr << #x  << " = " << x << endl; 
# define pll pair <ll, ll>
# define pii pair <int, int>
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
const ll maxn = (ll)2e5 + 7;
const ll inf  = (ll)2e18 + 0;
const ll mod  = (ll)1e9 + 7;
const ll dx[] = {-1, 1, 0, 0};
const ll dy[] = {0, 0, -1, 1};
 
using namespace std;
mt19937 rng(239017);
 
vector <int> guess (int n) {
	vector <int> ans(n, 0);
	if (n <= 15) {
		for (int i = 1; i <= n; ++i) {
			ans[i - 1] = ask(i);
		}
		return ans;
	}
	ans[0] = ask(1);
	map <int, int> mp[7];
	set <int> st;
	for (int bit = 0; bit < 7; ++bit) {
		vector <int> q[2];
		for (int i = 2; i <= n; ++i) {
			if (i & (1LL << bit)) {
				q[0].pb(i);
				q[1].pb(i);
			}
		}
		q[1].pb(1);
		map <int, int> cnt;
		q[0] = get_pairwise_xor(q[0]);
		q[1] = get_pairwise_xor(q[1]);
		for (int x : q[1]) cnt[x]++;
		for (int x : q[0]) cnt[x]--;
		for (auto [x, y] : cnt) {
			if (y == 2) {
				int num = ans[0] ^ x;
				mp[bit][num]++;
				st.insert(num);
			}
		}
	}
	for (int x : st) {
		int id = 0;
		for (int bit = 0; bit < 7; ++bit) {
			if (mp[bit][x]) {
				id += (1LL << bit);
			}
		}
		ans[id - 1] = x;
	}
	return ans;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct

Subtask #2
94.0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 536 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 3 ms 536 KB Output is correct
21 Correct 3 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 344 KB Output is correct
25 Correct 3 ms 344 KB Output is correct
26 Correct 3 ms 344 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 3 ms 600 KB Output is correct
29 Correct 3 ms 344 KB Output is correct
30 Correct 3 ms 344 KB Output is correct
31 Correct 2 ms 344 KB Output is correct
32 Correct 3 ms 344 KB Output is correct
33 Correct 3 ms 344 KB Output is correct
34 Correct 3 ms 344 KB Output is correct
35 Correct 2 ms 344 KB Output is correct
36 Correct 3 ms 344 KB Output is correct
37 Correct 3 ms 344 KB Output is correct
38 Correct 3 ms 340 KB Output is correct
39 Correct 2 ms 344 KB Output is correct
40 Correct 3 ms 344 KB Output is correct
41 Correct 3 ms 344 KB Output is correct
42 Correct 3 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 3 ms 344 KB Output is correct
46 Correct 3 ms 344 KB Output is correct
47 Correct 2 ms 344 KB Output is correct
48 Correct 3 ms 344 KB Output is correct
49 Correct 3 ms 344 KB Output is correct
50 Correct 3 ms 528 KB Output is correct
51 Correct 2 ms 344 KB Output is correct
52 Correct 3 ms 344 KB Output is correct
53 Correct 3 ms 532 KB Output is correct
54 Correct 3 ms 344 KB Output is correct
55 Correct 2 ms 344 KB Output is correct
56 Correct 3 ms 544 KB Output is correct
57 Correct 3 ms 344 KB Output is correct
58 Correct 3 ms 344 KB Output is correct
59 Correct 2 ms 344 KB Output is correct
60 Correct 3 ms 544 KB Output is correct
61 Correct 3 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 3 ms 428 KB Output is correct
65 Correct 3 ms 344 KB Output is correct
66 Correct 3 ms 344 KB Output is correct
67 Correct 2 ms 344 KB Output is correct
68 Correct 3 ms 512 KB Output is correct
69 Correct 3 ms 344 KB Output is correct
70 Correct 3 ms 344 KB Output is correct
71 Correct 2 ms 344 KB Output is correct
72 Correct 3 ms 344 KB Output is correct
73 Correct 4 ms 344 KB Output is correct
74 Correct 3 ms 344 KB Output is correct
75 Correct 2 ms 348 KB Output is correct
76 Correct 3 ms 356 KB Output is correct
77 Correct 3 ms 352 KB Output is correct
78 Correct 3 ms 352 KB Output is correct
79 Correct 2 ms 356 KB Output is correct
80 Correct 3 ms 512 KB Output is correct
81 Correct 3 ms 368 KB Output is correct
82 Correct 3 ms 356 KB Output is correct
83 Correct 2 ms 356 KB Output is correct
84 Correct 3 ms 356 KB Output is correct
85 Correct 3 ms 356 KB Output is correct
86 Correct 3 ms 548 KB Output is correct
87 Correct 2 ms 356 KB Output is correct
88 Correct 3 ms 356 KB Output is correct
89 Correct 4 ms 356 KB Output is correct
90 Correct 3 ms 356 KB Output is correct
91 Correct 2 ms 356 KB Output is correct
92 Correct 3 ms 356 KB Output is correct
93 Correct 3 ms 352 KB Output is correct
94 Correct 3 ms 356 KB Output is correct
95 Correct 2 ms 356 KB Output is correct
96 Correct 3 ms 356 KB Output is correct
97 Correct 3 ms 352 KB Output is correct
98 Correct 3 ms 356 KB Output is correct
99 Correct 2 ms 356 KB Output is correct
100 Correct 3 ms 356 KB Output is correct