oj.uz

답안 #370638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370638 2021-02-24T10:38:42 Z Kevin_Zhang_TW Xoractive (IZhO19_xoractive) C++17
100 / 100
 8 ms 640 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV 
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
 
#include "interactive.h"
 
const int MAX_N = 18;
 
vector<int> operator +(vector<int> a, vector<int> b) { a.insert(end(a), AI(b)); return a; }
vector<int> operator &(vector<int> a, vector<int> b) {
	map<int,int> cnt;
	for (auto i : a) ++cnt[i];
	vector<int> res;
	for (auto i : b) if (cnt[i])
		res.pb(i), --cnt[i];
	return res;
}
vector<int> operator -(vector<int> a, vector<int> b) {
	map<int, int> cnt;
	for (auto i : a) ++cnt[i];
	for (auto i : b) --cnt[i];
	vector<int> res;
	for (auto [v, c] : cnt)
		while (c--) res.pb(v);
	return res;
}
 
 
 
int qcnt;
 
vector<int> ans;
// vector<int> get_pairwise_xor(vector<int>);
 
vector<int> get_values(vector<int> ids) {
	cerr << "get values at index: ";
	debug(AI(ids));
 
 
	auto allid = get_pairwise_xor(ids);
	auto id1 = ids;
	id1.pb(1);
	auto with1 = get_pairwise_xor(id1);
 
	auto onewithid = with1 - allid;
 
	sort(AI(onewithid));
 
	vector<int> res;
	for (int i = 2;i < onewithid.size();i += 2)
		res.pb(onewithid[i] ^ ans[0]);
 
	debug(AI(res));
 
	qcnt += 2;
	
	return res;
}
 
vector<int> have[MAX_N];
 
vector<int> guess(int n) {
	ans.pb(ask(1));
 
	if (n <= 15) {
		for (int i = 2;i <= n;++i)
			ans.pb(ask(i));
		return ans;
	}
 
//	vector<int> allvalue(n-1); iota(AI(allvalue), 2);
// 
//	allvalue = get_values(allvalue);
 
	int lg = 7;
 
	for (int d = 0;d < lg;++d) {
 
		vector<int> vec;
		for (int i = 1;i < n;++i)
			if ((i>>d)&1) vec.pb(i+1);
 
		have[d] = get_values(vec);
 
	}
 
	for (int i = 1;i < n;++i) {
		int lst = -1;
		vector<int> cand;
		for (int d = 0;d < lg;++d) 
			if (i>>d&1) {
				if (lst == -1) cand = have[d];
				cand = cand & have[d];
				lst = d;
			}
		for (int d = 0;d < lg;++d)
			if (~i>>d&1) {
				for (int x : have[d]) {
					auto it = find(AI(cand), x);
					if (it != end(cand))
						cand.erase(it);
				}
			}
		ans.pb(cand[0]);
	}
 
	DE(qcnt, n);
 
	return ans;
}

Compilation message

Xoractive.cpp: In function 'std::vector<int> get_values(std::vector<int>)':
Xoractive.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
Xoractive.cpp:50:2: note: in expansion of macro 'debug'
   50 |  debug(AI(ids));
      |  ^~~~~
Xoractive.cpp:63:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |  for (int i = 2;i < onewithid.size();i += 2)
      |                 ~~^~~~~~~~~~~~~~~~~~
Xoractive.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
Xoractive.cpp:66:2: note: in expansion of macro 'debug'
   66 |  debug(AI(res));
      |  ^~~~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
Xoractive.cpp:120:2: note: in expansion of macro 'DE'
  120 |  DE(qcnt, n);
      |  ^~

Subtask #1
6.0 / 6.0

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

Subtask #2
94.0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 6 ms 364 KB Output is correct
3 Correct 5 ms 364 KB Output is correct
4 Correct 8 ms 492 KB Output is correct
5 Correct 6 ms 364 KB Output is correct
6 Correct 6 ms 364 KB Output is correct
7 Correct 5 ms 364 KB Output is correct
8 Correct 6 ms 364 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 364 KB Output is correct
11 Correct 5 ms 364 KB Output is correct
12 Correct 7 ms 364 KB Output is correct
13 Correct 6 ms 364 KB Output is correct
14 Correct 7 ms 364 KB Output is correct
15 Correct 5 ms 364 KB Output is correct
16 Correct 7 ms 364 KB Output is correct
17 Correct 6 ms 364 KB Output is correct
18 Correct 8 ms 492 KB Output is correct
19 Correct 5 ms 364 KB Output is correct
20 Correct 7 ms 492 KB Output is correct
21 Correct 6 ms 364 KB Output is correct
22 Correct 8 ms 492 KB Output is correct
23 Correct 6 ms 364 KB Output is correct
24 Correct 7 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 5 ms 364 KB Output is correct
28 Correct 6 ms 364 KB Output is correct
29 Correct 7 ms 364 KB Output is correct
30 Correct 6 ms 364 KB Output is correct
31 Correct 7 ms 364 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Correct 6 ms 364 KB Output is correct
34 Correct 6 ms 364 KB Output is correct
35 Correct 5 ms 364 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 5 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 8 ms 364 KB Output is correct
43 Correct 5 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 5 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 8 ms 364 KB Output is correct
55 Correct 4 ms 364 KB Output is correct
56 Correct 6 ms 364 KB Output is correct
57 Correct 7 ms 492 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 7 ms 492 KB Output is correct
63 Correct 5 ms 364 KB Output is correct
64 Correct 6 ms 364 KB Output is correct
65 Correct 7 ms 640 KB Output is correct
66 Correct 7 ms 364 KB Output is correct
67 Correct 5 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 5 ms 364 KB Output is correct
72 Correct 7 ms 364 KB Output is correct
73 Correct 6 ms 364 KB Output is correct
74 Correct 6 ms 492 KB Output is correct
75 Correct 6 ms 364 KB Output is correct
76 Correct 6 ms 364 KB Output is correct
77 Correct 8 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 6 ms 364 KB Output is correct
85 Correct 7 ms 364 KB Output is correct
86 Correct 6 ms 364 KB Output is correct
87 Correct 5 ms 364 KB Output is correct
88 Correct 7 ms 364 KB Output is correct
89 Correct 6 ms 364 KB Output is correct
90 Correct 7 ms 364 KB Output is correct
91 Correct 5 ms 364 KB Output is correct
92 Correct 8 ms 492 KB Output is correct
93 Correct 7 ms 364 KB Output is correct
94 Correct 6 ms 364 KB Output is correct
95 Correct 4 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 5 ms 364 KB Output is correct
100 Correct 6 ms 364 KB Output is correct