Submission #914992

# Submission time Handle Problem Language Result Execution time Memory
914992 2024-01-23T05:24:42 Z shenfe1 Xoractive (IZhO19_xoractive) C++17
94 / 100
5 ms 2900 KB
#include <bits/stdc++.h>
#include "interactive.h"
 
 
#pragma GCC optimize("03")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
using namespace std;
 
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
 
const int MAX=3e5+15;
const int B=2e5;
const int N=104;
const int block=450;
const int maxB=MAX/B+10;
const ll inf=1e18;  
const int mod=1e9+7;
const int mod1=1e9+9;
const ld eps=1e-9;
 
int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};
 
int a[MAX],b[MAX];
map<int,int> mp;

// int ask(int pos){
//   return b[pos];
// }

// vector<int> get_pairwise_xor(vector<int> f){
//   vector<int> res;
//   for(int x:f){
//     for(int y:f){
//       res.pb(b[x]^b[y]);
//     }
//   }
//   sort(all(res));
//   return res;
// }

vector<int> guess(int n){
  vector<int> ans;
  a[1]=ask(1);
  for(int i=0;i<7;i++){
    vector<int> ask,ask1;
    for(int j=2;j<=n;j++){
      if((j>>i)&1){
        ask.pb(j);
        ask1.pb(j);
      }
    }
    ask1.pb(1);
    sort(all(ask1));
    vector<int> v=get_pairwise_xor(ask);
    vector<int> v1=get_pairwise_xor(ask1);
    // for(int pos:ask)cout<<pos<<" ";
    // cout<<"\n";
    // for(int pos:ask1)cout<<pos<<" ";
    // cout<<"\n";
    multiset<int> st;
    for(int x:v1)st.in(x);
    for(int x:v){
      st.erase(st.find(x));
    }
    st.erase(st.find(0));
    set<int> st1;
    for(int x:st)st1.in(x);
    for(int x:st1){
      mp[(x^a[1])]+=(1<<i);
    }
  }
  for(pii x:mp){
    a[x.S]=x.F;
  }
  for(int i=1;i<=n;i++)ans.pb(a[i]);
  return ans;
}

// int main(){
//   int n;
//   cin>>n;
//   for(int i=1;i<=n;i++)cin>>b[i];
//   vector<int> f=guess(n);
//   for(int x:f)cout<<x<<" ";
// }
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB Not correct size
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2648 KB Output is correct
2 Correct 4 ms 2392 KB Output is correct
3 Correct 3 ms 2648 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 4 ms 2392 KB Output is correct
6 Correct 4 ms 2392 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Correct 3 ms 2640 KB Output is correct
9 Correct 4 ms 2392 KB Output is correct
10 Correct 3 ms 2392 KB Output is correct
11 Correct 3 ms 2392 KB Output is correct
12 Correct 4 ms 2392 KB Output is correct
13 Correct 4 ms 2392 KB Output is correct
14 Correct 3 ms 2648 KB Output is correct
15 Correct 3 ms 2392 KB Output is correct
16 Correct 4 ms 2392 KB Output is correct
17 Correct 3 ms 2648 KB Output is correct
18 Correct 3 ms 2392 KB Output is correct
19 Correct 3 ms 2392 KB Output is correct
20 Correct 3 ms 2648 KB Output is correct
21 Correct 4 ms 2648 KB Output is correct
22 Correct 4 ms 2392 KB Output is correct
23 Correct 4 ms 2644 KB Output is correct
24 Correct 4 ms 2648 KB Output is correct
25 Correct 3 ms 2392 KB Output is correct
26 Correct 3 ms 2392 KB Output is correct
27 Correct 4 ms 2588 KB Output is correct
28 Correct 4 ms 2392 KB Output is correct
29 Correct 4 ms 2392 KB Output is correct
30 Correct 3 ms 2392 KB Output is correct
31 Correct 4 ms 2648 KB Output is correct
32 Correct 4 ms 2392 KB Output is correct
33 Correct 4 ms 2648 KB Output is correct
34 Correct 4 ms 2392 KB Output is correct
35 Correct 4 ms 2392 KB Output is correct
36 Correct 3 ms 2636 KB Output is correct
37 Correct 4 ms 2392 KB Output is correct
38 Correct 3 ms 2392 KB Output is correct
39 Correct 3 ms 2648 KB Output is correct
40 Correct 4 ms 2648 KB Output is correct
41 Correct 4 ms 2392 KB Output is correct
42 Correct 4 ms 2392 KB Output is correct
43 Correct 3 ms 2392 KB Output is correct
44 Correct 3 ms 2392 KB Output is correct
45 Correct 4 ms 2392 KB Output is correct
46 Correct 3 ms 2392 KB Output is correct
47 Correct 3 ms 2392 KB Output is correct
48 Correct 3 ms 2392 KB Output is correct
49 Correct 4 ms 2392 KB Output is correct
50 Correct 5 ms 2388 KB Output is correct
51 Correct 3 ms 2392 KB Output is correct
52 Correct 3 ms 2392 KB Output is correct
53 Correct 3 ms 2392 KB Output is correct
54 Correct 3 ms 2648 KB Output is correct
55 Correct 3 ms 2392 KB Output is correct
56 Correct 4 ms 2648 KB Output is correct
57 Correct 4 ms 2648 KB Output is correct
58 Correct 4 ms 2392 KB Output is correct
59 Correct 3 ms 2392 KB Output is correct
60 Correct 3 ms 2392 KB Output is correct
61 Correct 3 ms 2392 KB Output is correct
62 Correct 4 ms 2648 KB Output is correct
63 Correct 3 ms 2392 KB Output is correct
64 Correct 4 ms 2644 KB Output is correct
65 Correct 4 ms 2648 KB Output is correct
66 Correct 4 ms 2392 KB Output is correct
67 Correct 3 ms 2648 KB Output is correct
68 Correct 4 ms 2392 KB Output is correct
69 Correct 4 ms 2392 KB Output is correct
70 Correct 3 ms 2648 KB Output is correct
71 Correct 3 ms 2648 KB Output is correct
72 Correct 3 ms 2392 KB Output is correct
73 Correct 3 ms 2648 KB Output is correct
74 Correct 3 ms 2392 KB Output is correct
75 Correct 3 ms 2640 KB Output is correct
76 Correct 4 ms 2388 KB Output is correct
77 Correct 4 ms 2392 KB Output is correct
78 Correct 4 ms 2392 KB Output is correct
79 Correct 3 ms 2392 KB Output is correct
80 Correct 3 ms 2392 KB Output is correct
81 Correct 4 ms 2396 KB Output is correct
82 Correct 4 ms 2392 KB Output is correct
83 Correct 4 ms 2648 KB Output is correct
84 Correct 3 ms 2400 KB Output is correct
85 Correct 4 ms 2400 KB Output is correct
86 Correct 4 ms 2648 KB Output is correct
87 Correct 3 ms 2648 KB Output is correct
88 Correct 4 ms 2648 KB Output is correct
89 Correct 3 ms 2392 KB Output is correct
90 Correct 3 ms 2392 KB Output is correct
91 Correct 3 ms 2648 KB Output is correct
92 Correct 4 ms 2392 KB Output is correct
93 Correct 4 ms 2392 KB Output is correct
94 Correct 3 ms 2392 KB Output is correct
95 Correct 3 ms 2392 KB Output is correct
96 Correct 3 ms 2644 KB Output is correct
97 Correct 3 ms 2392 KB Output is correct
98 Correct 4 ms 2392 KB Output is correct
99 Correct 3 ms 2392 KB Output is correct
100 Correct 4 ms 2648 KB Output is correct