# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
686599 | minhcool | Xoractive (IZhO19_xoractive) | C++17 | 1 ms | 208 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "interactive.h"
using namespace std;
//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int N = 3e5 + 5;
const int oo = 1e18 + 7, mod = 1e9 + 7;
vector<int> guess(int n){
vector<int> ans;
int x = ask(1);
ans.pb(x);
for(int i = 2; i <= n; i++){
vector<int> pos;
pos.pb(i - 1), pos.pb(i);
vector<int> temp = get_pairwise_xor(pos);
x ^= temp.back();
ans.pb(x);
}
return ans;
}
/*
void process(){
}
signed main(){
ios_base::sync_with_stdio(0);
int t;
cin >> t;
while(t--) process();
}
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |