Submission #990874

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
990874	2024-05-31T16:55:46 Z	ToniB	Xoractive (IZhO19_xoractive)	C++17	100 / 100	3 ms	512 KB

Xoractive

#include <bits/stdc++.h>
#include "interactive.h"
using namespace std;

vector<int> ans;

void reduce(vector<int>& v, int sz) {
	vector<int> cur = {};
	sort(v.begin(), v.end());
	for (int i = sz; i < (int)v.size(); i += 2) cur.push_back(v[i]);
	swap(cur, v);
}

vector<int> get_values(vector<int> pos) {
	vector<int> with = pos;
	with.push_back(1);
	sort(with.begin(), with.end());
	
	vector<int> xr_with = get_pairwise_xor(with);
	vector<int> xr_without = get_pairwise_xor(pos);

	reduce(xr_with, with.size());
	reduce(xr_without, pos.size());

	vector<int> vals = {};
	
	for (int val : xr_without) {
		for (int i = 0; i < (int)xr_with.size(); ++i) {
			if (xr_with[i] == val) {
				xr_with.erase(xr_with.begin() + i);
				break;
			}
		}
	}

	for (int val : xr_with) {
		vals.push_back(val ^ ans[0]);
	}

	return vals;
}

vector<int> guess(int n) {
	map<int, int> mp;
	ans.resize(n);
	ans[0] = ask(1);
	
	for (int i = 0; i < 7; ++i) {
		vector<int> cur;
		for (int j = 2; j <= n; ++j) {
			if (j & 1 << i) cur.push_back(j);
		}
		if (cur.empty()) continue;
		vector<int> v = get_values(cur);
		for (int val : v) {
			mp[val] += 1 << i;
		}
	}
	
	for (pair<int, int> p : mp) {
		ans[p.second - 1] = p.first;
	}

	return ans;
}

Subtask #1
6.0 / 6.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	344 KB	Output is correct
3	Correct	344 KB	Output is correct
4	Correct	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	484 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	480 KB	Output is correct
12	Correct	2 ms	344 KB	Output is correct
13	Correct	2 ms	512 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	340 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	2 ms	344 KB	Output is correct
23	Correct	2 ms	344 KB	Output is correct
24	Correct	2 ms	480 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	484 KB	Output is correct
30	Correct	2 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	2 ms	344 KB	Output is correct
34	Correct	2 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	2 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	2 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	2 ms	344 KB	Output is correct
51	Correct	2 ms	344 KB	Output is correct
52	Correct	2 ms	344 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	344 KB	Output is correct
57	Correct	2 ms	344 KB	Output is correct
58	Correct	2 ms	472 KB	Output is correct
59	Correct	2 ms	344 KB	Output is correct
60	Correct	3 ms	344 KB	Output is correct
61	Correct	2 ms	344 KB	Output is correct
62	Correct	2 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	2 ms	472 KB	Output is correct
70	Correct	2 ms	344 KB	Output is correct
71	Correct	2 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	344 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	484 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	348 KB	Output is correct
91	Correct	2 ms	352 KB	Output is correct
92	Correct	2 ms	496 KB	Output is correct
93	Correct	2 ms	356 KB	Output is correct
94	Correct	2 ms	348 KB	Output is correct
95	Correct	2 ms	484 KB	Output is correct
96	Correct	2 ms	348 KB	Output is correct
97	Correct	2 ms	348 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

Submission #990874

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 94.0 / 94.0

Subtask #1
6.0 / 6.0

Subtask #2
94.0 / 94.0