oj.uz

Submission #328450

# Submission time Handle Problem Language Result Execution time Memory
328450 2020-11-16T16:00:59 Z ryansee Xoractive (IZhO19_xoractive) C++14
62 / 100
 9 ms 436 KB 
#include "interactive.h"

#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=int; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
map<ll,ll> mp;
vector<int> guess(int n) {
	vector<int> ans(n+1);
	ans[1]=ask(1), ans[2]=ask(2);
	vector<vector<ll>> v[2];
	auto fix=[&](vector<ll> x,vector<ll> y){
		vector<ll> z;
		reverse(all(x)), reverse(all(y));
		while(x.size()) {
			if(y.empty()) { z.eb(x.back()); x.pop_back(); continue; }
			if(x.back()==y.back()) x.pop_back(), y.pop_back();
			else z.eb(x.back()), x.pop_back();
		}
		return z;
	};
	FOR(i,0,6) {
		vector<ll> zero, one, tmp;
		FOR(j,3,n) {
			if(1<<i&j) one.eb(j);
			else zero.eb(j);
		}
		if(zero.size()){
			tmp=get_pairwise_xor(zero);
			zero.eb(1);
			zero=get_pairwise_xor(zero);
			zero=fix(zero, tmp);
			zero.resize(unique(all(zero))-zero.begin());
			if(zero[0]==0) zero.erase(zero.begin());
			for(auto&i:zero) i^=ans[1];
		}
		
		if(one.size()) {
			tmp=get_pairwise_xor(one);
			one.eb(2);
			one=get_pairwise_xor(one);
			one=fix(one, tmp);
			one.resize(unique(all(one))-one.begin());
			if(one[0]==0) one.erase(one.begin());
			for(auto&i:one) i^=ans[2];
		}
		
		v[0].eb(zero), v[1].eb(one);
	}
	FOR(j,3,n) {
		mp.clear();
		for(auto k:v[0]) for(auto j:k) ++ mp[j];
		for(auto k:v[1]) for(auto j:k) ++ mp[j];
		FOR(i,0,6) if(1<<i&j) {
			for(auto j:v[1][i]) -- mp[j];
		} else {
			for(auto j:v[0][i]) -- mp[j];
		}
		for(auto i:mp) if(i.s==0) ans[j]=i.f;
	}
	ans.erase(ans.begin());
	return ans;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 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
56.0 / 94.0

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