답안 #370681

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370681 2021-02-24T13:25:10 Z fhvirus Xoractive (IZhO19_xoractive) C++17
100 / 100
9 ms 640 KB
// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define FOR(i,n) for(int i = 0; i < (n); ++i)
#define FOO(i,a,b) for(int i = (a); i <= (b); ++i)
#define AI(x) (x).begin(),(x).end()
template<typename I> bool chmax(I &a, I b){ return a < b ? (a = b, true) : false;}
template<typename I> bool chmin(I &a, I b){ return a > b ? (a = b, true) : false;}
#ifdef OWO
#define debug(args...) LKJ("[ " + string(#args) + " ]", args)
void LKJ(){ cerr << endl;}
template<typename I, typename...T> void LKJ(I&&x, T&&...t){ cerr<<x<<", ", LKJ(t...);}
template<typename I> void DE(I a, I b){ while(a < b) cerr<<*a<<" \n"[next(a)==b], ++a;}
#else
#define debug(...) 0
#define DE(...) 0
#endif
#include "interactive.h"
using namespace std;
vector<int> guess(int n) {
	int k = -1;
	while(n>1<<++k);
	vector<int> ans;
	vector<vector<int>> ss(k, vector<int>());
	ans.pb(ask(1));
	FOR(j,k){
		vector<int> q;
		FOR(i,n) if(i>>j&1) q.pb(i+1);
		vector<int> r = get_pairwise_xor(q);
		
		q.pb(1);
		ss[j] = get_pairwise_xor(q);
		ss[j].erase(ss[j].begin()); // a[0] ^ a[0]
		for(int x: r) ss[j].erase(find(AI(ss[j]), x));
		for(int &i: ss[j]) i ^= ans[0];
	}
	FOO(i,1,n-1){
		vector<int> v;
		FOR(j,k){
			if((i>>j&1)^1) continue;
			if(v.empty()) v = ss[j];
			else{
				vector<int> w;
				for(int x: ss[j])
					if(find(AI(v), x) != v.end())
						w.pb(x);
				v.swap(w);
			}
		}
		FOR(j,k){
			if(i>>j&1) continue;
			for(int x: ss[j]){
				auto it = find(AI(v), x);
				if(it != v.end()) v.erase(it);
			}
		}
		ans.pb(v[0]);
	}
	return ans;
}

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