제출 #1288001

#제출 시각아이디문제언어결과실행 시간메모리
1288001BahaminXoractive (IZhO19_xoractive)C++20
0 / 100
4 ms568 KiB
#include "interactive.h"
#include "bits/stdc++.h"
using namespace std;

vector<int> guess(int n) {
	int num = ask(1);
	map<int, int> ind;
	ind[num] = 1;
	for (int i = 0; (1 << i) <= n; i++)
	{
		if (i == 0 && n == 2) continue;
		vector<int> al;
		for (int j = 2; j <= n; j++) if (j & (1 << i)) al.push_back(j);
		auto x = get_pairwise_xor(al);
		multiset<int> al1;
		al.push_back(1);
		auto y = get_pairwise_xor(al);
		for (int y1 : y) al1.insert(y1);
		for (int y1 : x) al1.erase(al1.find(y1));
		al1.erase(0);
		for (int y1 : al1) ind[y1 ^ num] += (1 << i);
	}
	vector<int> ans(n);
	for (auto x : ind) ans[x.second - 1] = x.first;
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...