oj.uz

답안 #345521

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
345521 2021-01-07T14:24:43 Z mat_v Xoractive (IZhO19_xoractive) C++14
100 / 100
 6 ms 640 KB 
#include <bits/stdc++.h>
#include "interactive.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
#define mod 998244353
#define xx first
#define yy second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ll long long
#define pii pair<int,int>


using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;/// find_by_order(x)(x+1th) , order_of_key() (strictly less)
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());


vector<int> ans;
vector<int> up1;
vector<int> up2;

map<int,int> poj;
map<int,int> skup;
vector<int> svi;

vector<int> guess(int n){
    ff(i,0,n - 1)ans.pb(0);
    ans[0] = ask(1);
    ff(i,0,6){
        up1.clear();
        up2.clear();
        ff(j,2,n){
            if(j&(1<<i)){
                up1.pb(j);
                up2.pb(j);
            }
        }
        if(!up1.size())continue;
        up2.pb(1);
        vector<int> imap = get_pairwise_xor(up1);
        vector<int> imad = get_pairwise_xor(up2);
        poj.clear();
        for(auto c:imad)poj[c]++;
        for(auto c:imap)poj[c]--;
        poj[0]--;
        for(auto c:imad){
            if(poj[c] > 0){
                svi.pb(ans[0]^c);
                skup[ans[0]^c] |= (1<<i);
            }
        }
    }
    for(auto c:svi){
        ans[skup[c] - 1] = c;
    }
    return ans;
}

Compilation message

Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:7:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    7 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
Xoractive.cpp:33:5: note: in expansion of macro 'ff'
   33 |     ff(i,0,n - 1)ans.pb(0);
      |     ^~
Xoractive.cpp:7:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    7 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
Xoractive.cpp:35:5: note: in expansion of macro 'ff'
   35 |     ff(i,0,6){
      |     ^~
Xoractive.cpp:7:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    7 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
Xoractive.cpp:38:9: note: in expansion of macro 'ff'
   38 |         ff(j,2,n){
      |         ^~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct

Subtask #2
94.0 / 94.0

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