제출 #865293

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
865293		Halym2007	Xoractive (IZhO19_xoractive)	C++11	100 / 100	4 ms	768 KiB

Xoractive

#include <bits/stdc++.h>
#include "interactive.h"
#define ff first
#define ss second
#define pb push_back
#define sz size()
using namespace std;
int h[101];
vector<int> guess(int n) {
	int x = ask(n);
	map <int, int> m;
	for (int bit = 0; bit <= 6; ++bit) {
		vector <int> v, jog1, jog2;
		map <int, int> cnt;
		for (int i = 1; i < n; ++i) {
			if (i>>bit&1) {
				v.pb (i);
			}
		}
		if (v.empty()) continue;
		jog1 = get_pairwise_xor(v);
		v.pb (n);
		jog2 = get_pairwise_xor(v);
		for (int i : jog2) {
			cnt[i]++;
		}
		for (int i : jog1) {
			cnt[i]--;
		} 
		for (auto i : cnt) {
			if (i.ff and i.ss) {
				m[i.ff^x] |= (1<<bit);
			}
		}
	}
	vector <int> jogap;
	for (auto i : m) {
		h[i.ss] = i.ff;
	}
	h[n] = x;
	for (int i = 1; i <= n; ++i) {
		jogap.pb(h[i]);
	}
	return jogap;
}

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