oj.uz

답안 #959619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959619 2024-04-08T13:52:13 Z Pring Xoractive (IZhO19_xoractive) C++17
100 / 100
 5 ms 852 KB 
#include <bits/stdc++.h>
#include "interactive.h"
using namespace std;

#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
using ll = long long;
typedef pair<int, int> pii;

namespace {
	const int MXN = 105;
	int n;
	vector<int> a;

	vector<int> XOR(vector<int> v) {
		for (auto &i : v) i++;
		return get_pairwise_xor(v);
	}

	multiset<int> GET_MS(vector<int> v) {
		multiset<int> MS;
		set<int> S;
		v.push_back(0);
		vector<int> w = XOR(v);
		for (auto &i : w) MS.insert(i);
		v.pop_back();
		w = XOR(v);
		for (auto &i : w) MS.erase(MS.find(i));
		MS.erase(MS.begin());
		for (auto i : MS) S.insert(i);
		MS.clear();
		for (auto i : S) MS.insert(i);
		return MS;
	}

	vector<int> solve() {
		multiset<int> MS[7];
		set<int> cand;
		a.resize(n);
		a[0] = ask(1);
		int h = __lg(n - 1) + 1;
		FOR(w, 0, h) {
			vector<int> v;
			FOR(i, 1, n) if (i & (1 << w)) v.push_back(i);
			MS[w] = GET_MS(v);
			for (auto j : MS[w]) cand.insert(j);
		}
		auto query = [&](int x) -> int {
			int id = 0;
			FOR(w, 0, h) {
				if (MS[w].find(x) != MS[w].end()) id |= (1 << w);
			}
			return id;
		};
		for (auto i : cand) a[query(i)] = i;
		FOR(i, 1, n) a[i] ^= a[0];
		return a;
	}
}

vector<int> guess(int N) {
	::n = N;
	return solve();
}

Subtask #1
6.0 / 6.0

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

Subtask #2
94.0 / 94.0

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