Submission #339564

#TimeUsernameProblemLanguageResultExecution timeMemory
339564fixikmilaXoractive (IZhO19_xoractive)C++14
6 / 100
1 ms364 KiB
#include <bits/stdc++.h>
#include<interactive.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,ll>pll;
typedef long double ld;
ll bin_pow(ll a,ll b){
    if(b==0)return 1;
    if(b%2==0){
        ll t=bin_pow(a,b/2);
        return t*t%MOD;
    }
    else return a*bin_pow(a,b-1)%MOD;
}

vector<int> guess(int n){
    vector<int>a(n);
    a[0]=ask(1);
    a[1]=ask(2);
    a[2]=ask(3);
    a[3]=ask(4);
    for(int i=0;i<n;i+=2){
        int x=ask(i+1);
        vector<int>c,y;
        c.push_back(i+1);
        c.push_back(i+2);
        y=get_pairwise_xor(c);
        int z=y.back()^x;
        a[i]=x;
        a[i+1]=z;
    }
    return a;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...