oj.uz

답안 #290781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
290781 2020-09-04T12:43:06 Z Plurm Xoractive (IZhO19_xoractive) C++11
88 / 100
 9 ms 1024 KB 
#include <bits/stdc++.h>
#include "interactive.h"
using namespace std;

vector<int> multisetDifference(vector<int> a, vector<int> b){
	sort(a.begin(), a.end());
	multiset<int> msb(b.begin(), b.end());
	vector<int> out;
	for(int x : a){
		if(msb.find(x) == msb.end()){
			out.push_back(x);
		}else{
			msb.erase(msb.find(x));
		}
	}
	return out;
}
vector<int> setDifference(vector<int> a, vector<int> b){
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	/*
	for(int i = 1; i < a.size(); i++) assert(a[i-1] <= a[i]);
	for(int i = 1; i < b.size(); i++) assert(b[i-1] <= b[i]);
	*/
	vector<int> out;
	for(int x : a){
		if(!binary_search(b.begin(), b.end(), x)) out.push_back(x);
	}
	return out;
}

int front;
int lb[256];
int rb[256];
vector<int> qdep[8];
vector<int> ansdep[8];
vector<int> seg[256];
void build(int c, int l, int r, int dep = 0){
	lb[c] = l;
	rb[c] = r;
	qdep[dep].push_back(c);
	if(l == r) return;
	int k = (l+r)/2; 
	build(2*c, l, k, dep+1);
	build(2*c+1, k+1, r, dep+1);
}
void propagate(int c, int dep = 0){
	if(c == 1) seg[1] = ansdep[0];
	else if(c % 2 == 0){
		seg[c] = setDifference(seg[c/2], seg[c+1]);
	}else{
		seg[c] = setDifference(seg[c/2], ansdep[dep]);
	}
	if(lb[c] == rb[c]) return;
	propagate(2*c+1, dep+1);
	propagate(2*c, dep+1);
}
void collect(int c, vector<int>& ans){
	if(lb[c] == rb[c]){
		ans.push_back(seg[c].front());
		return;
	}
	collect(2*c, ans);
	collect(2*c+1, ans);
}
vector<int> guess(int n) {
	front = ask(1);
	build(1, 1, n);
	for(int i = 0; i < 8; i++){
		if(qdep[i].empty()) break;
		vector<int> query;
		for(int x : qdep[i]){
			if(x % 2 == 0 || x == 1){
				for(int j = lb[x]; j <= rb[x]; j++) query.push_back(j);
			}
		}
		if(query.empty()) break;
		assert(query.front() == 1);
		vector<int> i1 = get_pairwise_xor(query);
		query.erase(query.begin());
		vector<int> i2 = query.empty() ? vector<int>() : get_pairwise_xor(query);
		vector<int> cur = multisetDifference(i1, i2);
		sort(cur.begin(), cur.end());
		cur.resize(unique(cur.begin(), cur.end()) - cur.begin());
		for(int& x : cur) x ^= front;
		if(cur.empty() || cur.front() != front) cur.insert(cur.begin(), front);
		ansdep[i] = cur;
	}
	propagate(1);
	vector<int> ans;
	collect(1, ans);
	return ans;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
82.0 / 94.0

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