Submission #944873

# Submission time Handle Problem Language Result Execution time Memory
944873 2024-03-13T07:12:16 Z Baizho Xoractive (IZhO19_xoractive) C++14
100 / 100
3 ms 528 KB
#include "interactive.h"

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt,sse3,avx")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(5e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
//const long double eps = 1e-15L;


int ask(int position);
std::vector<int> get_pairwise_xor(std::vector<int> positions);


vector<int> guess(int n) {
	int a[n + 1];
	a[1] = ask(1);
	map<int, int> pos;
	for(int i = 0; i < 7; i ++) {
		vector<int> v;
		for(int j = 2; j <= n; j ++) {
			if(j & (1 << i)) v.pb(j);
		}
		if(v.empty()) break;
		vector<int> get = get_pairwise_xor(v);
		v.pb(1);
		vector<int> get1 = get_pairwise_xor(v);
		map<int, int> cnt;
		for(auto x : get1) cnt[x] ++;
		for(auto x : get) cnt[x] --;
		for(auto x : cnt) {
			if(x.ff && x.ss) pos[(x.ff ^ a[1])] |= (1 << i);
 		}
	}
	for(auto x : pos) a[x.ss] = x.ff;
	vector<int> res;
	for(int i = 1; i <= n; i ++) {
		res.pb(a[i]);
	}
	return res;
}
# Verdict Execution time Memory 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
# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 3 ms 500 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 3 ms 352 KB Output is correct
13 Correct 3 ms 520 KB Output is correct
14 Correct 3 ms 348 KB Output is correct
15 Correct 2 ms 352 KB Output is correct
16 Correct 3 ms 356 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 3 ms 352 KB Output is correct
19 Correct 2 ms 356 KB Output is correct
20 Correct 3 ms 352 KB Output is correct
21 Correct 3 ms 356 KB Output is correct
22 Correct 3 ms 352 KB Output is correct
23 Correct 2 ms 356 KB Output is correct
24 Correct 3 ms 356 KB Output is correct
25 Correct 3 ms 352 KB Output is correct
26 Correct 3 ms 352 KB Output is correct
27 Correct 2 ms 352 KB Output is correct
28 Correct 3 ms 352 KB Output is correct
29 Correct 3 ms 352 KB Output is correct
30 Correct 3 ms 348 KB Output is correct
31 Correct 2 ms 344 KB Output is correct
32 Correct 3 ms 344 KB Output is correct
33 Correct 3 ms 344 KB Output is correct
34 Correct 3 ms 344 KB Output is correct
35 Correct 2 ms 500 KB Output is correct
36 Correct 3 ms 524 KB Output is correct
37 Correct 3 ms 344 KB Output is correct
38 Correct 3 ms 344 KB Output is correct
39 Correct 2 ms 344 KB Output is correct
40 Correct 3 ms 344 KB Output is correct
41 Correct 3 ms 344 KB Output is correct
42 Correct 3 ms 344 KB Output is correct
43 Correct 2 ms 492 KB Output is correct
44 Correct 3 ms 356 KB Output is correct
45 Correct 3 ms 344 KB Output is correct
46 Correct 3 ms 344 KB Output is correct
47 Correct 2 ms 344 KB Output is correct
48 Correct 3 ms 344 KB Output is correct
49 Correct 3 ms 344 KB Output is correct
50 Correct 3 ms 344 KB Output is correct
51 Correct 2 ms 344 KB Output is correct
52 Correct 3 ms 344 KB Output is correct
53 Correct 3 ms 344 KB Output is correct
54 Correct 3 ms 520 KB Output is correct
55 Correct 2 ms 344 KB Output is correct
56 Correct 3 ms 344 KB Output is correct
57 Correct 3 ms 344 KB Output is correct
58 Correct 3 ms 344 KB Output is correct
59 Correct 2 ms 344 KB Output is correct
60 Correct 3 ms 344 KB Output is correct
61 Correct 3 ms 344 KB Output is correct
62 Correct 3 ms 344 KB Output is correct
63 Correct 2 ms 344 KB Output is correct
64 Correct 3 ms 344 KB Output is correct
65 Correct 3 ms 344 KB Output is correct
66 Correct 3 ms 352 KB Output is correct
67 Correct 3 ms 456 KB Output is correct
68 Correct 3 ms 344 KB Output is correct
69 Correct 3 ms 348 KB Output is correct
70 Correct 3 ms 344 KB Output is correct
71 Correct 2 ms 352 KB Output is correct
72 Correct 3 ms 352 KB Output is correct
73 Correct 3 ms 344 KB Output is correct
74 Correct 3 ms 344 KB Output is correct
75 Correct 2 ms 344 KB Output is correct
76 Correct 3 ms 352 KB Output is correct
77 Correct 3 ms 348 KB Output is correct
78 Correct 3 ms 348 KB Output is correct
79 Correct 2 ms 348 KB Output is correct
80 Correct 3 ms 524 KB Output is correct
81 Correct 3 ms 352 KB Output is correct
82 Correct 3 ms 356 KB Output is correct
83 Correct 2 ms 348 KB Output is correct
84 Correct 3 ms 344 KB Output is correct
85 Correct 3 ms 344 KB Output is correct
86 Correct 3 ms 344 KB Output is correct
87 Correct 2 ms 352 KB Output is correct
88 Correct 3 ms 528 KB Output is correct
89 Correct 3 ms 352 KB Output is correct
90 Correct 3 ms 520 KB Output is correct
91 Correct 2 ms 352 KB Output is correct
92 Correct 3 ms 352 KB Output is correct
93 Correct 3 ms 344 KB Output is correct
94 Correct 3 ms 352 KB Output is correct
95 Correct 2 ms 348 KB Output is correct
96 Correct 3 ms 344 KB Output is correct
97 Correct 3 ms 348 KB Output is correct
98 Correct 3 ms 352 KB Output is correct
99 Correct 2 ms 344 KB Output is correct
100 Correct 3 ms 344 KB Output is correct