oj.uz

Submission #345617

# Submission time Handle Problem Language Result Execution time Memory
345617 2021-01-07T16:34:29 Z georgerapeanu Xoractive (IZhO19_xoractive) C++11
100 / 100
 14 ms 492 KB 
#include "interactive.h"
#include <map>
#include <algorithm>

using namespace std;

vector<int> intersect(const vector<int> &a,const vector<int> &b){
    vector<int> ans;

    map<int,int> fr;

    for(auto it:a){
        fr[it]++;
    }
    
    for(auto it:b){
        fr[it]++;
    }

    for(auto it:fr){
        if(it.second > 1){
            ans.push_back(it.first);
        }
    }

    return ans;
}

vector<int> diff(const vector<int> &a,const vector<int> &b){

    vector<int> ans;
    map<int,int> fr;

    for(auto it:a){
        fr[it]++;
    }
    
    for(auto it:b){
        fr[it]--;
    }

    for(auto it:fr){
        if(it.first && it.second > 0){
            ans.push_back(it.first);
        }
    }

    return ans;
}

vector<int> uni(const vector<int> &a,const vector<int> &b){
    vector<int> ans;

    for(auto it:a){
        ans.push_back(it);
    }

    for(auto it:b){
        ans.push_back(it);
    }

    sort(ans.begin(),ans.end());

    ans.resize(unique(ans.begin(),ans.end()) - ans.begin());

    return ans;
}

vector<int> query(vector<int> v){
    vector<int> a = get_pairwise_xor(v);
    v.push_back(1);
    vector<int> b = get_pairwise_xor(v);

    return diff(b,a);
}

vector<int> guess(int n) {
	vector <int> bit[7];
    vector <int> all;

    for(int i = 0;i < 7;i++){
        for(int j = 1;j < n;j++){
            if((j >> i) & 1){
                bit[i].push_back(j + 1);
            }
        }
        if(bit[i].empty() == false){
            bit[i] = query(bit[i]);
        }
        else{
            bit[i] = vector<int>();
        }
        all = uni(all,bit[i]);
    }
    
    int fst = ask(1);

    vector<int> ans = {fst};

    for(int i = 1;i < n;i++){
        vector<int> num = all;
        for(int h = 0;h < 7;h++){
            if((i >> h) & 1){
                num = intersect(num,bit[h]);
            }else{
                num = intersect(num,diff(all,bit[h]));
            }
        }
        ans.push_back(num[0] ^ fst);
    }

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