oj.uz

Submission #443896

# Submission time Handle Problem Language Result Execution time Memory
443896 2021-07-12T11:20:29 Z zaneyu Xoractive (IZhO19_xoractive) C++14
100 / 100
 8 ms 456 KB 
#include "interactive.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<ll,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
const int MOD=1e9+9;
const ld PI=acos(-1);
const ld eps=1e-3;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
vector<int> arr[7];
vector<int> guess(int n) {
    int a0=ask(1);
    REP(j,7){
        vector<int> v;
        REP1(i,n-1){
            if(i&(1<<j)) v.pb(i+1);
        }
        if(!sz(v)){
            continue;
        }
        vector<int> a=get_pairwise_xor(v);
        v.pb(1);
        vector<int> b=get_pairwise_xor(v);
        multiset<int> bb;
        for(auto x:b) bb.insert(x);
        for(auto x:a){
            bb.erase(bb.find(x));
        }
        for(auto x:bb){
            arr[j].pb(x^a0);
        }
    }
    vector<int> ans;
    map<int,bool> in;
    for(int i=n-1;i>=1;i--){
        map<int,int> cnt;
        int z=0;
        REP(j,7){
            if(i&(1<<j)){
                for(auto x:arr[j]){
                    cnt[x]++;
                }
                ++z;
            }
        }
        for(auto x:cnt){
            if(x.s==2*z and !in.count(x.f)){
                in[x.f]=1;
                ans.pb(x.f);
                break;
            }
        }
    }
    ans.pb(a0);
    reverse(ALL(ans));
    return ans;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct

Subtask #2
94.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 328 KB Output is correct
2 Correct 6 ms 328 KB Output is correct
3 Correct 6 ms 440 KB Output is correct
4 Correct 7 ms 328 KB Output is correct
5 Correct 6 ms 328 KB Output is correct
6 Correct 6 ms 328 KB Output is correct
7 Correct 6 ms 328 KB Output is correct
8 Correct 6 ms 328 KB Output is correct
9 Correct 6 ms 328 KB Output is correct
10 Correct 6 ms 328 KB Output is correct
11 Correct 6 ms 328 KB Output is correct
12 Correct 6 ms 328 KB Output is correct
13 Correct 6 ms 328 KB Output is correct
14 Correct 6 ms 328 KB Output is correct
15 Correct 6 ms 328 KB Output is correct
16 Correct 6 ms 328 KB Output is correct
17 Correct 6 ms 328 KB Output is correct
18 Correct 6 ms 328 KB Output is correct
19 Correct 7 ms 328 KB Output is correct
20 Correct 6 ms 328 KB Output is correct
21 Correct 6 ms 328 KB Output is correct
22 Correct 6 ms 436 KB Output is correct
23 Correct 6 ms 328 KB Output is correct
24 Correct 6 ms 328 KB Output is correct
25 Correct 6 ms 328 KB Output is correct
26 Correct 6 ms 456 KB Output is correct
27 Correct 6 ms 328 KB Output is correct
28 Correct 6 ms 328 KB Output is correct
29 Correct 6 ms 328 KB Output is correct
30 Correct 6 ms 400 KB Output is correct
31 Correct 8 ms 328 KB Output is correct
32 Correct 7 ms 328 KB Output is correct
33 Correct 6 ms 328 KB Output is correct
34 Correct 6 ms 328 KB Output is correct
35 Correct 6 ms 328 KB Output is correct
36 Correct 6 ms 328 KB Output is correct
37 Correct 6 ms 328 KB Output is correct
38 Correct 6 ms 328 KB Output is correct
39 Correct 6 ms 436 KB Output is correct
40 Correct 6 ms 440 KB Output is correct
41 Correct 6 ms 328 KB Output is correct
42 Correct 6 ms 328 KB Output is correct
43 Correct 6 ms 328 KB Output is correct
44 Correct 6 ms 328 KB Output is correct
45 Correct 6 ms 328 KB Output is correct
46 Correct 6 ms 328 KB Output is correct
47 Correct 6 ms 328 KB Output is correct
48 Correct 6 ms 328 KB Output is correct
49 Correct 6 ms 328 KB Output is correct
50 Correct 6 ms 328 KB Output is correct
51 Correct 6 ms 328 KB Output is correct
52 Correct 7 ms 328 KB Output is correct
53 Correct 7 ms 436 KB Output is correct
54 Correct 6 ms 328 KB Output is correct
55 Correct 6 ms 328 KB Output is correct
56 Correct 6 ms 436 KB Output is correct
57 Correct 6 ms 440 KB Output is correct
58 Correct 6 ms 328 KB Output is correct
59 Correct 6 ms 328 KB Output is correct
60 Correct 6 ms 328 KB Output is correct
61 Correct 6 ms 328 KB Output is correct
62 Correct 6 ms 328 KB Output is correct
63 Correct 6 ms 328 KB Output is correct
64 Correct 6 ms 328 KB Output is correct
65 Correct 6 ms 456 KB Output is correct
66 Correct 6 ms 328 KB Output is correct
67 Correct 7 ms 328 KB Output is correct
68 Correct 6 ms 440 KB Output is correct
69 Correct 6 ms 328 KB Output is correct
70 Correct 6 ms 328 KB Output is correct
71 Correct 6 ms 328 KB Output is correct
72 Correct 6 ms 328 KB Output is correct
73 Correct 6 ms 328 KB Output is correct
74 Correct 6 ms 328 KB Output is correct
75 Correct 6 ms 328 KB Output is correct
76 Correct 6 ms 328 KB Output is correct
77 Correct 6 ms 328 KB Output is correct
78 Correct 6 ms 328 KB Output is correct
79 Correct 6 ms 328 KB Output is correct
80 Correct 7 ms 328 KB Output is correct
81 Correct 6 ms 328 KB Output is correct
82 Correct 6 ms 328 KB Output is correct
83 Correct 6 ms 328 KB Output is correct
84 Correct 6 ms 328 KB Output is correct
85 Correct 6 ms 328 KB Output is correct
86 Correct 6 ms 328 KB Output is correct
87 Correct 6 ms 328 KB Output is correct
88 Correct 6 ms 328 KB Output is correct
89 Correct 6 ms 456 KB Output is correct
90 Correct 6 ms 328 KB Output is correct
91 Correct 6 ms 328 KB Output is correct
92 Correct 6 ms 328 KB Output is correct
93 Correct 6 ms 328 KB Output is correct
94 Correct 6 ms 432 KB Output is correct
95 Correct 6 ms 328 KB Output is correct
96 Correct 6 ms 328 KB Output is correct
97 Correct 6 ms 328 KB Output is correct
98 Correct 6 ms 328 KB Output is correct
99 Correct 6 ms 328 KB Output is correct
100 Correct 6 ms 328 KB Output is correct