제출 #161963

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
161963		MvC	Xoractive (IZhO19_xoractive)	C++11	100 / 100	16 ms	632 KiB

Xoractive

#include "interactive.h"
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e2+50;
const int mod=1e9+7;
using namespace std;
int n,rs[nmax],i,j;
vector<int>ans,vca,vcb,qr;
map<int,int>mp,cur;
map<int,int>::iterator it;
vector<int> guess(int N) 
{
	n=N;
	rs[n]=ask(n);
	for(i=0;i<7;i++)
	{
		qr.clear();
		for(j=1;j<n;j++)if(j&(1<<i))qr.pb(j);
		vca.clear();
		if(!qr.empty())vca=get_pairwise_xor(qr);
		qr.pb(n);
		vcb=get_pairwise_xor(qr);
		cur.clear();
		for(j=0;j<(int)vca.size();j++)cur[vca[j]]--;
		for(j=0;j<(int)vcb.size();j++)cur[vcb[j]]++;
		for(it=cur.begin();it!=cur.end();it++)
		{
			if(!it->fr || !it->sc)continue;
			mp[it->fr^rs[n]]|=(1<<i);
		}
	}
	for(it=mp.begin();it!=mp.end();it++)rs[it->sc]=it->fr;
	for(i=1;i<=n;i++)ans.pb(rs[i]);
	return ans;
}

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