제출 #268658

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
268658		aZvezda	Xoractive (IZhO19_xoractive)	C++14	0 / 100	3 ms	384 KiB

Xoractive

#include <iostream>
#include <bits/stdc++.h>

#include "interactive.h"
using namespace std;

/*abcdefghijklmnopqrstuvwxyz
ABCDEFGHIJKLMNOPQRSTUVWXYZ
1234567890*/


map<int, int> mp;

vector<int> guess(int n) {
    int zer = ask(1);
    vector<int> ret(n);
    for(int bit = 0; bit < 7; bit ++) {
        vector<int> curr;
        for(int i = 0; i < n; i ++) if(i & (1 << bit)) {
            curr.push_back(i + 1);
        }
        if(curr.empty()) {continue;}
        vector<int> ans1, ans2, ans3;
        ans1 = get_pairwise_xor(curr);
        curr.push_back(1);
        ans2 = get_pairwise_xor(curr);
        int cnt = 0;
        ans1.push_back(-1);
        for(int i = ans1.size() - 2; i >= 0; i --) {
            ans1[i + 1] = ans1[i];
        }
        ans1[0] = 0;
        for(auto it : ans2) {
            if(cnt >= (int)ans1.size() || ans1[cnt] != it) {
                ans3.push_back(it ^ zer);
            } else {
                cnt ++;
            }
        }
        for(auto it : ans3) {
            mp[it] |= (1 << bit);
        }
    }
    for(auto it : mp) {
        ret[it.second] = it.first;
    }
    return ret;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 94