제출 #851197

#제출 시각아이디문제언어결과실행 시간메모리
851197epicci23Xoractive (IZhO19_xoractive)C++17
100 / 100
4 ms600 KiB
#include "interactive.h"
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define sz(x) ((int)(x).size())

vector<int> guess(int n) {
	vector <int> ans(n,0);
    
    if(n<=4){
    	if(1<=n) ans[0]=ask(1);
    	if(2<=n) ans[1]=ask(2);
    	if(3<=n) ans[2]=ask(3);
        if(4<=n) ans[3]=ask(4);
        return ans;
    }

    map<int,int> go;

    ans[0]=ask(1);

    for(int i=0;i<7;i++){
       vector<int> cur;
       for(int j=2;j<=n;j++){
       	  if(j>>i&1) cur.pb(j);
       }

       map<int,int> mp2,mp3;

       vector<int> gg=get_pairwise_xor(cur);

       for(int x:gg) mp2[x]++;
       
       for(int j=0;j<sz(cur);j++) mp2[0]--;

       for(auto& x:mp2) x.ss/=2;

       cur.pb(1);

       gg=get_pairwise_xor(cur);

       for(int x:gg) mp3[x]++;
       
       for(int j=0;j<sz(cur);j++) mp3[0]--;

       for(auto& x:mp3) x.ss/=2;

       for(auto x:mp2) mp3[x.ff]-=x.ss;

       for(auto x:mp3){
       	  if(x.ss){
       	  	go[x.ff^ans[0]]|=1LL<<i;
       	  }
       }
    }
    
    for(auto x:go) ans[x.ss-1]=x.ff;

	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...