oj.uz

Submission #618687

# Submission time Handle Problem Language Result Execution time Memory
618687 2022-08-02T06:40:16 Z maximath_1 Xoractive (IZhO19_xoractive) C++11
0 / 100
 4 ms 464 KB 
#include "interactive.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> guess(int n) {
	vector<int> ans(n);
	ans[0] = ask(1);
	map<int, int> li;
	for(int lg = 0; lg <= 6; lg ++){
		vector<int> v;
		for(int j = 2; j <= n; j ++){
			if(j & (1 << lg)) v.push_back(j);
		}
		if(v.empty()) continue;
		vector<int> gtv = get_pairwise_xor(v);
		v.push_back(1);
		vector<int> gtvp = get_pairwise_xor(v);
		map<int, int> mp;
		for(int i : gtv) if(i) mp[i] --;
		for(int i : gtvp) if(i) mp[i] ++;
		for(auto i : mp){
			int cr = (i.first ^ ans[0]);
			li[cr] |= (1 << lg);
		}
	}

	for(auto i : li){
		ans[i.second - 1] = i.first;
	}
	return ans;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Output is not correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 94.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 464 KB Output is not correct
2 Halted 0 ms 0 KB -