Submission #367393

#	Time	Username	Problem	Language	Result	Execution time	Memory
367393		fishy15	Xoractive (IZhO19_xoractive)	C++14	100 / 100	6 ms	492 KiB

Xoractive

#include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>

#include "interactive.h"

#define ll long long
#define ld long double
#define eps 1e-8
#define MOD 1000000007

#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f

// change if necessary
#define MAXN 1000000

using namespace std;

vector<int> guess(int n) {
    int one = ask(1);

    map<int, int> ans_m;
    for (int j = 0; j < 7; j++) {
        vector<int> cur;
        for (int i = 1; i < n; i++) {
            if ((i >> j) & 1) {
                cur.push_back(i + 1);
            }
        }

        if (cur.empty()) continue;
        auto set1 = get_pairwise_xor(cur);
        cur.push_back(1);
        auto set2 = get_pairwise_xor(cur);

        map<int, int> cnt;
        for (int i : set2) {
            if (i) {
                cnt[i ^ one]++;
            }
        }
        for (int i : set1) {
            if (i) {
                cnt[i ^ one]--;
            }
        }

        for (auto p : cnt) {
            if (p.second) {
                ans_m[p.first] += (1 << j);
            }
        }
    }

    vector<int> ans(n);
    ans[0] = one;
    for (auto p : ans_m) {
        ans[p.second] = p.first;
    }

    return ans;
}

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