# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
878857 | 2023-11-25T10:50:53 Z | 8pete8 | Xoractive (IZhO19_xoractive) | C++14 | 3 ms | 600 KB |
#include "interactive.h" #include <cstdio> #include <cstdlib> #include <cassert> #include <vector> #include <algorithm> #include<iostream> #include<stack> #include<map> #include<vector> #include<string> #include<unordered_map> #include <queue> #include<cstring> #include<limits.h> #include<cmath> #include<set> #include<algorithm> #include<bitset> using namespace std; #define ll long long #define f first #define endl "\n" #define s second #define pii pair<int,int> #define ppii pair<pii,pii> #define vi vector<int> #define pb push_back //#define p push #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define F(n) for(int i=0;i<n;i++) #define lb lower_bound #define ub upper_bound #define fastio ios::sync_with_stdio(false);cin.tie(NULL); #pragma GCC optimize ("03,unroll-lopps") using namespace std; const int mod=9901,mxn=3*1e5+5; vector<int> guess(int n){ int g=ask(1); map<int,int>pos; for(int i=0;i<7;i++){ vector<int>q; for(int j=2;j<=n;j++)if(j&(1<<i))q.pb(j); if(q.size()<=1){ for(auto j:q)pos[ask(j)]+=(1<<i); continue; } vector<int>a1=get_pairwise_xor(q); q.pb(1); vector<int>a2=get_pairwise_xor(q); int cur=0; for(int j=0;j<a2.size();j++){ if(cur<a1.size()&&a1[cur]==a2[j]){ cur++; continue; } pos[a2[j]^g]+=(1<<i); j++; } } vector<int>ans(n); ans[0]=g; for(auto i:pos)ans[i.s-1]=i.f; return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output is not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 600 KB | Output is not correct |
2 | Halted | 0 ms | 0 KB | - |