oj.uz

Submission #505158

# Submission time Handle Problem Language Result Execution time Memory
505158 2022-01-10T19:27:42 Z rainliofficial Xoractive (IZhO19_xoractive) C++17
100 / 100
 6 ms 456 KB 
#include <bits/stdc++.h>
#include "interactive.h"
//#include "grader.cpp"
using namespace std;
#define ll long long
#define pii pair<int, int>
#define f first
#define s second

multiset<int> filter(vector<int>& all, vector<int>& exclude){
    multiset<int> allValues;
    for (int i : all){
        allValues.insert(i);
    }
    for (int i : exclude){
        if (allValues.find(i) != allValues.end()){
            allValues.erase(allValues.find(i));
        }
    }
    return allValues;
}
vector<int> guess(int n) {
	vector<int> ans(n);
	vector<int> allPositions(n);
    for (int i=0; i<n; i++){
        allPositions[i] = i+1;
    }
    vector<int> exludeFirst(n-1);
    for (int i=1; i<n; i++){
        exludeFirst[i-1] = i+1;
    }
    int first = ask(1);
    map<int, int> valToInd;
    // vector<int> allPairwiseXor = get_pairwise_xor(allPositions);
    // vector<int> excludeFirstXor = get_pairwise_xor(exludeFirst);
    // multiset<int> allValues = filter(allPairwiseXor, excludeFirstXor);
    valToInd[first] = 1;
    // Look at answer indexes by bit
    int maxBits = log2(n)+1;
    for (int i=0; i<=maxBits; i++){  
        vector<int> currSet; // The set of numbers with this bit ON
        for (int j=2; j<=n; j++){
            if (j & (1<<i)){ // This bit is ON
                currSet.push_back(j);
            }
        }
        if (currSet.empty()){
            continue; 
        }
        vector<int> currSetXor = get_pairwise_xor(currSet);
        currSet.push_back(1);
        vector<int> xorWithFirst = get_pairwise_xor(currSet);
        multiset<int> currSetResult = filter(xorWithFirst, currSetXor);
        set<int> processed;
        for (int curr : currSetResult){
            if (curr == 0 || processed.find(curr) != processed.end()){
                continue;
            }
            processed.insert(curr);
            int val = curr ^ first; // Convert XOR value to orig value
            valToInd[val] += 1<<i; 
        }
    }
    for (auto cur : valToInd){
        ans[cur.second-1] = cur.first;
    }
	return ans;
}

Subtask #1
6.0 / 6.0

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