oj.uz

Submission #505132

# Submission time Handle Problem Language Result Execution time Memory
505132 2022-01-10T16:41:37 Z rainliofficial Xoractive (IZhO19_xoractive) C++17
0 / 100
 1 ms 328 KB 
#include <bits/stdc++.h>
#include "interactive.h"
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(all[i]);
    }
    for (int i : exclude){
        allValues.erase(allValues.find(i));
    }
    return allValues;
}
vector<int> guess(int n) {
	vector<int> ans;
	vector<int> allPositions(n);
    for (int i=0; i<n; i++){
        allPositions[i] = i+1;
    }
    vector<int> exludeFirst(n);
    for (int i=1; i<n; i++){
        allPositions[i] = i+1;
    }
    int first = ask(1);
    vector<int> allPairwiseXor = get_pairwise_xor(allPositions);
    vector<int> excludeFirstXor = get_pairwise_xor(exludeFirst);
    multiset<int> allValues = filter(allPairwiseXor, excludeFirstXor);
    vector<int> valToInd(n+1); // Maps an element to its answer index
    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) > 0){ // This bit is ON
                currSet.push_back(j);
            }
        }
        vector<int> currSetXor = get_pairwise_xor(currSet);
        currSet.push_back(1);
        vector<int> xorWithFirst = get_pairwise_xor(currSet);
        multiset<int> currSetResult = filter(currSetXor, xorWithFirst);
        for (int i : currSetResult){
            int val = i ^ first; // Convert XOR value to orig value
            valToInd[val] += 1<<i; 
        }
    }
    for (int i=1; i<=n; i++){
        ans[valToInd[i]-1] = i;
    }
	return ans;
}

Compilation message

Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:40:28: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   40 |             if (j & (1<<i) > 0){ // This bit is ON
      |                     ~~~~~~~^~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 200 KB Not unique
2 Halted 0 ms 0 KB -

Subtask #2
0 / 94.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Not unique
2 Halted 0 ms 0 KB -