Submission #1133950

#	Time	Username	Problem	Language	Result	Execution time	Memory
1133950		Agageldi	Xoractive (IZhO19_xoractive)	C++17	6 / 100	2 ms	408 KiB

Xoractive

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

#define ll long long
#define N 200005
#define pb push_back
#define ff first
#define ss second
#define sz(s) (int)s.size()

int val;
vector <int> a, b, h;
vector <pair<int,int> > answer;
map <int,int> vis, vip;

vector <int> guess(int n) {
	val = ask(n);
	for(int i = 0; i <= 7; i++) {
		b.clear();
		h.clear();
		vip.clear();
		for(int j = 1; j < n; j++) {
			if((j&(1 << i))) b.pb(j);
		}
		if(!sz(b)) continue;
		vector <int> a1 = get_pairwise_xor(b);
		b.pb(n);
		vector <int> a2 = get_pairwise_xor(b);
		for(auto j : a1) {
			vip[j]++;
		}
		for(auto j : a2) {
			vip[j]--;
		}
		for(auto j : vip) {
			if(j.ff && j.ss)
			vis[j.ff ^ val] |= (1 << i);
		}
	}
	for(auto i : vis) {
		if(i.ff && i.ss) answer.pb({i.ss,i.ff});
	}
	sort(answer.begin(),answer.end());
	assert(sz(answer) < n);
	for(auto i : answer) {
		a.pb(i.ss);
	}
	a.pb(val);
	assert(sz(a) == n);
	return a;
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 94