oj.uz

Submission #519231

# Submission time Handle Problem Language Result Execution time Memory
519231 2022-01-26T04:24:55 Z Ai7081 Xoractive (IZhO19_xoractive) C++17
100 / 100
 3 ms 448 KB 
#include <bits/stdc++.h>
using namespace std;

vector<int> a;

int ask(int i);/* {
    return a[i];
}*/

vector<int> get_pairwise_xor(vector<int> pos);/* {
    vector<int> ret;
    for (auto i : pos) {
        for (auto j : pos) ret.push_back(a[i]^a[j]);
    }
    sort(ret.begin(), ret.end());
    return ret;
}*/

vector<int> guess(int n) {
    vector<int> ret(n);
    ret[0] = ask(1);
    //cout << "ret[0] : " << ret[0] << endl;

    vector<int> q;
    vector<vector<int>> bit(7);
    for (int i=0; i<7; i++) {
        //cout << "i " << i << endl;
        q.clear();
        for (int j=1; j<=n; j++) {
            if ((j>>i)%2 && j>1) q.push_back(j);//, cout << "push " << j << endl;
        }
        if (q.empty()) continue;
        vector<int> res1, res2;
        res1 = get_pairwise_xor(q);
        q.push_back(1);
        res2 = get_pairwise_xor(q);
/*
        cout << "res1 : ";
        for (auto it : res1) cout << it << ' ';
        cout << endl << "res2 : ";
        for (auto it : res2) cout << it << ' ';
        cout << endl;
*/
        int ii=0, jj=1;
        vector<int> tmp;
        while (ii<res1.size() && jj<res2.size()) {
            if (res1[ii] > res2[jj]) {
                tmp.push_back(res2[jj]);
                jj++;
            }
            else if (res1[ii] == res2[jj]) {
                ii++;
                jj++;
            }
        }
        while (jj < res2.size()) {
            tmp.push_back(res2[jj]);
            jj++;
        }
        for (int j=0; j<tmp.size(); j+=2) bit[i].push_back(tmp[j] ^ ret[0]);
        /*
        cout << "bit " << i << " : ";
        for (auto it : bit[i]) cout << it << ' ';
        cout << endl;
        */
    }

    vector<pair<int, int>> v;
    for (int i=0; i<7; i++) {
        for (auto x : bit[i]) {
            bool ok = false;
            for (int j=0; j<v.size(); j++) {
                if (x == v[j].first) {
                    v[j].second += (1<<i);
                    ok = true;
                    break;
                }
            }
            if (!ok) {
                v.push_back({x, (1<<i)});
            }
        }
    }
    for (auto [x, idx] : v) ret[idx-1] = x;
    return ret;
}
/*
int main() {
    a = {0, 2, 4, 3, 109};
    vector<int> g = guess(4);
    cout << "ans : ";
    for (auto x : g) cout << x << ' ';
}
*/

Compilation message

Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:46:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         while (ii<res1.size() && jj<res2.size()) {
      |                ~~^~~~~~~~~~~~
Xoractive.cpp:46:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         while (ii<res1.size() && jj<res2.size()) {
      |                                  ~~^~~~~~~~~~~~
Xoractive.cpp:56:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         while (jj < res2.size()) {
      |                ~~~^~~~~~~~~~~~~
Xoractive.cpp:60:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for (int j=0; j<tmp.size(); j+=2) bit[i].push_back(tmp[j] ^ ret[0]);
      |                       ~^~~~~~~~~~~
Xoractive.cpp:72:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             for (int j=0; j<v.size(); j++) {
      |                           ~^~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 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 2 ms 328 KB Output is correct
2 Correct 2 ms 328 KB Output is correct
3 Correct 2 ms 328 KB Output is correct
4 Correct 2 ms 328 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 2 ms 288 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 2 ms 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 2 ms 328 KB Output is correct
13 Correct 3 ms 328 KB Output is correct
14 Correct 2 ms 284 KB Output is correct
15 Correct 2 ms 328 KB Output is correct
16 Correct 2 ms 328 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 2 ms 328 KB Output is correct
19 Correct 2 ms 276 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 2 ms 284 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 328 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 2 ms 328 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 300 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 2 ms 336 KB Output is correct
35 Correct 2 ms 336 KB Output is correct
36 Correct 2 ms 448 KB Output is correct
37 Correct 2 ms 336 KB Output is correct
38 Correct 2 ms 336 KB Output is correct
39 Correct 2 ms 332 KB Output is correct
40 Correct 2 ms 336 KB Output is correct
41 Correct 2 ms 264 KB Output is correct
42 Correct 2 ms 352 KB Output is correct
43 Correct 2 ms 336 KB Output is correct
44 Correct 2 ms 336 KB Output is correct
45 Correct 2 ms 292 KB Output is correct
46 Correct 2 ms 328 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 2 ms 336 KB Output is correct
49 Correct 2 ms 336 KB Output is correct
50 Correct 2 ms 336 KB Output is correct
51 Correct 2 ms 336 KB Output is correct
52 Correct 2 ms 336 KB Output is correct
53 Correct 2 ms 336 KB Output is correct
54 Correct 2 ms 336 KB Output is correct
55 Correct 2 ms 336 KB Output is correct
56 Correct 2 ms 336 KB Output is correct
57 Correct 2 ms 296 KB Output is correct
58 Correct 2 ms 336 KB Output is correct
59 Correct 2 ms 336 KB Output is correct
60 Correct 2 ms 336 KB Output is correct
61 Correct 2 ms 332 KB Output is correct
62 Correct 2 ms 336 KB Output is correct
63 Correct 2 ms 332 KB Output is correct
64 Correct 2 ms 328 KB Output is correct
65 Correct 2 ms 288 KB Output is correct
66 Correct 2 ms 328 KB Output is correct
67 Correct 2 ms 280 KB Output is correct
68 Correct 2 ms 328 KB Output is correct
69 Correct 2 ms 328 KB Output is correct
70 Correct 2 ms 288 KB Output is correct
71 Correct 2 ms 336 KB Output is correct
72 Correct 2 ms 332 KB Output is correct
73 Correct 2 ms 328 KB Output is correct
74 Correct 2 ms 328 KB Output is correct
75 Correct 2 ms 328 KB Output is correct
76 Correct 2 ms 328 KB Output is correct
77 Correct 2 ms 328 KB Output is correct
78 Correct 2 ms 328 KB Output is correct
79 Correct 2 ms 328 KB Output is correct
80 Correct 2 ms 328 KB Output is correct
81 Correct 2 ms 328 KB Output is correct
82 Correct 2 ms 328 KB Output is correct
83 Correct 2 ms 328 KB Output is correct
84 Correct 2 ms 328 KB Output is correct
85 Correct 2 ms 328 KB Output is correct
86 Correct 2 ms 328 KB Output is correct
87 Correct 2 ms 344 KB Output is correct
88 Correct 2 ms 328 KB Output is correct
89 Correct 2 ms 328 KB Output is correct
90 Correct 2 ms 328 KB Output is correct
91 Correct 2 ms 328 KB Output is correct
92 Correct 2 ms 328 KB Output is correct
93 Correct 2 ms 328 KB Output is correct
94 Correct 2 ms 332 KB Output is correct
95 Correct 1 ms 336 KB Output is correct
96 Correct 2 ms 336 KB Output is correct
97 Correct 2 ms 336 KB Output is correct
98 Correct 2 ms 332 KB Output is correct
99 Correct 2 ms 336 KB Output is correct
100 Correct 2 ms 336 KB Output is correct