oj.uz

답안 #988380

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988380 2024-05-24T14:59:57 Z AlphaMale06 Xoractive (IZhO19_xoractive) C++17
100 / 100
 7 ms 600 KB 
#include <bits/stdc++.h>

//#include "interactive.h"

using namespace std;

int ask(int position);
vector<int> get_pairwise_xor(vector<int> positions);

vector<int> ers(vector<int> f, vector<int> s){
    vector<int> ret;
    int p = 0;
    for(int e : f){
        if(p<s.size() && s[p]==e){
            p++;
            continue;
        }
        ret.push_back(e);
    }
    return ret;
}

set<int> inter(set<int> a, set<int> b){
    set<int> ret;
    for(int e : a){
        if(b.find(e)!=b.end())ret.insert(e);
    }
    return ret;
}

vector<int> guess(int n) {
    vector<int> answer;
    set<int> vals;
    vector<int> queries[7];
    vector<int> answers[7];
    answer.resize(n);
    answer[0]=ask(1);
    if(n<=15){
        for(int i=2; i<=n; i++){
            answer[i-1]=ask(i);
        }
        return answer;
    }
    vector<int> q;
    for(int i=2; i<=n; i++){
        q.push_back(i);
    }
    for(int i=0; i< 7; i++){
        for(int j=2; j<=n; j++){
            if(!((j>>i)&1))queries[i].push_back(j);
        }
    }
    set<int> values[7];
    set<int> revals[7];
    for(int i=0; i< 7; i++){
        answers[i]=get_pairwise_xor(queries[i]);
        queries[i].push_back(1);
        answers[i]=ers(get_pairwise_xor(queries[i]), answers[i]);
        for(int j=1; j<answers[i].size(); j+=2)values[i].insert(answer[0]^answers[i][j]);
    }
    set<int> allvals;
    for(int i=0; i< 7; i++){
        for(int e : values[i])allvals.insert(e);
    }
    for(int i=0; i< 7; i++){
        for(int e : allvals){
            if(values[i].find(e)==values[i].end())revals[i].insert(e);
        }
    }
    for(int j=2; j<=n; j++){
        set<int> possible;
        for(int e : allvals)possible.insert(e);
        for(int i=0; i<7; i++){
            if(!((j>>i)&1)){
                possible = inter(possible, values[i]);
            }
            else possible = inter(possible, revals[i]);
        }
        answer[j-1] = (*possible.begin());
    }
    return answer;
}

Compilation message

Xoractive.cpp: In function 'std::vector<int> ers(std::vector<int>, std::vector<int>)':
Xoractive.cpp:14:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |         if(p<s.size() && s[p]==e){
      |            ~^~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:59:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |         for(int j=1; j<answers[i].size(); j+=2)values[i].insert(answer[0]^answers[i][j]);
      |                      ~^~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
94.0 / 94.0

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