Submission #969943

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
969943	2024-04-26T00:15:34 Z	ThegeekKnight16	Xoractive (IZhO19_xoractive)	C++17	100 / 100	3 ms	596 KB

Xoractive

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

vector<int> intervalXor(int id, vector<int> v, int valId)
{
	// cerr << "v: "; for (auto x : v) cerr << x << " "; cerr << '\n';
	if (v.empty()) return v;
	v.push_back(id);
	vector<int> r1 = get_pairwise_xor(v);
	v.pop_back();
	vector<int> r2 = get_pairwise_xor(v);
	vector<int> resp;
	int id2 = 0;
	for (int i = 0; i < r1.size(); i++)
	{
		if (r2[id2] == r1[i]) {id2++; continue;}
		resp.push_back(r1[i]);
	}
	if (resp[0] == 0) resp.erase(resp.begin());
	vector<int> realResp(1, resp[0]);
	for (int i = 1; i < resp.size(); i++) if (resp[i] != resp[i-1]) realResp.push_back(resp[i]);
	resp = realResp;
	for (auto &x : resp) x ^= valId;
	sort(resp.begin(), resp.end());
	// cerr << "resp: "; for (auto x : resp) cerr << x << " "; cerr << '\n';
	return resp;
}

vector<int> guess(int n) 
{
	// cerr << "BONGA" << '\n';
	vector<int> ans(n);
	ans[0] = ask(1);
	vector<int> ids(n-1); iota(ids.begin(), ids.end(), 2);
	// vector<int> nums = intervalXor(1, ids, ans[0]);
	vector<int> pos(n-1);
	set<int> nVals; vector<vector<int>> aux(7);
	for (int k = 6; k >= 0; k--)
	{
		ids.clear();
		for (int i = 2; i <= n; i++) 
			if (i & (1 << k))
				ids.push_back(i);
		aux[k] = intervalXor(1, ids, ans[0]);
		for (auto x : aux[k]) nVals.insert(x);
	}
	vector<int> nums(nVals.begin(), nVals.end());
	for (int k = 6; k >= 0; k--)
	{
		int idAux = 0;
		for (int i = 0; i < nums.size() && idAux < aux[k].size(); i++)
		{
			if (aux[k][idAux] == nums[i]) pos[i] |= (1 << k), idAux++;
		}
	}
	// cerr << "pos: "; for (auto x : pos) cerr << x << " "; cerr << '\n';
	for (int i = 0; i < pos.size(); i++) ans[pos[i]-1] = nums[i];
	// cerr << "n: " << n << ", ans: "; for (auto x : ans) cerr << x << " "; cerr << '\n';
	return ans;
}

Compilation message

Xoractive.cpp: In function 'std::vector<int> intervalXor(int, std::vector<int>, int)':
Xoractive.cpp:15:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |  for (int i = 0; i < r1.size(); i++)
      |                  ~~^~~~~~~~~~~
Xoractive.cpp:22:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |  for (int i = 1; i < resp.size(); i++) if (resp[i] != resp[i-1]) realResp.push_back(resp[i]);
      |                  ~~^~~~~~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:52:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   for (int i = 0; i < nums.size() && idAux < aux[k].size(); i++)
      |                   ~~^~~~~~~~~~~~~
Xoractive.cpp:52:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   for (int i = 0; i < nums.size() && idAux < aux[k].size(); i++)
      |                                      ~~~~~~^~~~~~~~~~~~~~~
Xoractive.cpp:58:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |  for (int i = 0; i < pos.size(); i++) ans[pos[i]-1] = nums[i];
      |                  ~~^~~~~~~~~~~~

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	344 KB	Output is correct
3	Correct	1 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	488 KB	Output is correct
7	Correct	1 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	1 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	2 ms	344 KB	Output is correct
14	Correct	2 ms	344 KB	Output is correct
15	Correct	1 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	1 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	344 KB	Output is correct
25	Correct	2 ms	344 KB	Output is correct
26	Correct	2 ms	344 KB	Output is correct
27	Correct	1 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	476 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	2 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	380 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	1 ms	344 KB	Output is correct
44	Correct	2 ms	344 KB	Output is correct
45	Correct	3 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	1 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	1 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	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	2 ms	344 KB	Output is correct
63	Correct	1 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	1 ms	344 KB	Output is correct
68	Correct	2 ms	344 KB	Output is correct
69	Correct	2 ms	344 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	1 ms	344 KB	Output is correct
80	Correct	2 ms	344 KB	Output is correct
81	Correct	2 ms	456 KB	Output is correct
82	Correct	2 ms	344 KB	Output is correct
83	Correct	1 ms	472 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	1 ms	344 KB	Output is correct
88	Correct	2 ms	344 KB	Output is correct
89	Correct	2 ms	596 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	348 KB	Output is correct
94	Correct	2 ms	348 KB	Output is correct
95	Correct	1 ms	348 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

Submission #969943

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