oj.uz

답안 #431392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
431392 2021-06-17T11:35:50 Z Runtime_error_ Xoractive (IZhO19_xoractive) C++14
100 / 100
 8 ms 520 KB 
#include "interactive.h"
#include <bits/stdc++.h>
#define pi pair<int,int>
#define pb push_back
#define mid (l+r)/2
using namespace std;
const int inf = 109;
int n,valn;
vector<int> numbers[inf],ans[inf];

vector<int> RemoveCommon(vector<int> v1,vector<int> v2){
    vector<int> ret;
    multiset<int>s;
    set<int> sret;

    for(auto &o:v2){
        if(o == 0)continue;
        s.insert(o);
    }
    for(auto &o:v1){
        if(o == 0)continue;
        if(!s.count(o))
            sret.insert(o^valn);
        else
            s.erase(s.find(o));
    }
    for(auto o:sret)
        ret.pb(o);

    return ret;
}


vector<int> GetValues(vector<int> query){
    vector<int> v1,v2;

    v2 = get_pairwise_xor(query);
    query.pb(n);
    v1 = get_pairwise_xor(query);

    return RemoveCommon(v1,v2);
}

queue<pair<int,int> > q;

vector<int> guess(int N) {
    vector<int> ret;
    n = N;
    valn = ask(n);
    for(int bit = 0;bit<7;bit++){
        for(int i=1;i<n;i++)
            if((1<<bit) & i)
                numbers[bit].pb(i);
        if(!numbers[bit].empty())
            ans[bit] = GetValues(numbers[bit]);
    }

    for(int i=1;i<n;i++){
        vector<int> candidate;
        for(int bit = 0;bit<7;bit++){
            if(!((1<<bit) & i))
                continue;
            if(candidate.empty())
                candidate = ans[bit];
            else{
                vector<int> new_candidate;
                for(auto o:ans[bit])
                    if(count(begin(candidate),end(candidate),o))
                        new_candidate.pb(o);
                candidate = new_candidate;
            }
        }
        for(int bit = 0;bit<7;bit++){
            if((1<<bit) &i)
                continue;
            for(auto o:ans[bit])
                if(count(begin(candidate),end(candidate),o))
                    candidate.erase(find(begin(candidate),end(candidate),o));
        }
        ret.pb(candidate[0]);
    }
    ret.pb(valn);
    return ret;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
94.0 / 94.0

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