oj.uz

Submission #259858

# Submission time Handle Problem Language Result Execution time Memory
259858 2020-08-08T17:31:39 Z Osama_Alkhodairy Xoractive (IZhO19_xoractive) C++17
100 / 100
 4 ms 512 KB 
#include <bits/stdc++.h>
#include "interactive.h"
//~ #include "grader.cpp"
using namespace std;

vector <int> get(vector <int> &c){
    if(c.size() == 0) return {};
    auto d = get_pairwise_xor(c);
    reverse(d.begin(), d.end());
    while(d.size() && d.back() == 0){
        d.pop_back();
    }
    vector <int> ret;
    for(int i = 1 ; i < (int)d.size() ; i += 2){
        ret.push_back(d[i]);
    }
    reverse(ret.begin(), ret.end());
    return ret;
}
vector <int> intersect(vector <int> a, vector <int> b){
    vector <int> ret;
    while(a.size() && b.size()){
        if(a.back() == b.back()){
            ret.push_back(a.back());
            a.pop_back();
            b.pop_back();
        }
        else if(a.back() > b.back()){
            a.pop_back();
        }
        else{
            b.pop_back();
        }
    }
    reverse(ret.begin(), ret.end());
    return ret;
}
vector <int> del(vector <int> a, vector <int> b){
    vector <int> ret;
    while(a.size()){
        if(b.size()){
            if(b.back() > a.back()){
                b.pop_back();
                continue;
            }
            else if(b.back() == a.back()){
                a.pop_back();
                b.pop_back();
                continue;
            }
        }
        ret.push_back(a.back());
        a.pop_back();
    }
    reverse(ret.begin(), ret.end());
    return ret;
}
vector <int> guess(int n){
    vector <int> ids;
    ids.push_back(0);
    for(int i = 1 ; i <= n ; i++){
        ids.push_back(i);
    }
    ids.back() = (1 << 7) - 1;
    vector <int> ans(n + 1);
    ans[n] = ask(n);
    vector <vector <int> > f(7);
    for(int i = 0 ; i < 7 ; i++){
        vector <int> all;
        for(int j = 1 ; j <= n ; j++){
            if((ids[j] >> i) & 1) all.push_back(j);
        }
        auto g = get(all);
        all.erase(find(all.begin(), all.end(), n));
        auto h = get(all);
        f[i] = del(g, h);
        f[i].push_back(0);
        for(auto &j : f[i]) j ^= ans[n];
    }
    vector <int> all;
    for(int i = 0 ; i < 7 ; i++){
        sort(f[i].begin(), f[i].end());
        for(auto &j : f[i]){
            all.push_back(j);
        }
    }
    sort(all.begin(), all.end());
    all.erase(unique(all.begin(), all.end()), all.end());
    for(int i = 1 ; i <= n ; i++){
        vector <int> cands = all;
        for(int j = 0 ; j < 7 ; j++){
            if((ids[i] >> j) & 1){
                cands = intersect(cands, f[j]);
            }
            else{
                cands = del(cands, f[j]);
            }
        }
        ans[i] = cands[0];
    }
    ans.erase(ans.begin());
    return ans;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
94.0 / 94.0

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