Submission #567633

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
567633	2022-05-23T21:22:10 Z	perchuts	Xoractive (IZhO19_xoractive)	C++17	100 / 100	3 ms	340 KB

Xoractive

#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define pb push_back
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#include "interactive.h"

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ii = pair<int,int>;
using iii = tuple<int,int,int>;

const int inf = 2e9+1;
const int mod = 1e9+7;
const int maxn = 1e5+100;

template<typename X, typename Y> bool ckmin(X& x, const Y& y) { return (y < x) ? (x=y,1):0; }
template<typename X, typename Y> bool ckmax(X& x, const Y& y) { return (x < y) ? (x=y,1):0; }



// namespace {
//     const int MAX_VALUE_OF_N = 100;
//     const int MAX_VALUE_OF_Q = 200;
//     int numberOfQueries = 0;
//     int n;
//     std::vector<int> a;

//     void wrong_answer(const char *MSG) {
//         printf("-1\n");
//         exit(0);
//     }
// }

// void query() {
//     numberOfQueries++;

//     if (numberOfQueries > MAX_VALUE_OF_Q) {
//         wrong_answer("Number of queries exceeded");
//     }
// }

// int ask(int position) {
//     query();
    
//     if (position < 1 || position > n) {
//         wrong_answer("Not correct position");
//     }
//     return a[position - 1];

// }
// vector<int> get_pairwise_xor(vector<int> positions) {
//     query();
    
//     if (positions.empty() || positions.size() > n) {
//         wrong_answer("Not correct size");
//     }
    
//     sort(positions.begin(), positions.end());
    
//     for (int i = 1; i < positions.size(); i++) {
//         if (positions[i] == positions[i - 1]) {
//             wrong_answer("Not unique");
//         }
//     }

//     for (int i = 0; i < positions.size(); i++) {
//         if (positions[i] < 1 || positions[i] > n) {
//             wrong_answer("Not correct position");
//         }
//     }

//     vector<int> pairwise_xor;
    
//     for (int i = 0; i < positions.size(); i++) {
//         for (int j = 0; j < positions.size(); j++) {
//             pairwise_xor.push_back(a[positions[i] - 1] ^ a[positions[j] - 1]);
//         }
//     }
//     sort(pairwise_xor.begin(), pairwise_xor.end());

//     return pairwise_xor;
// }

vector<int> guess(int n) {
	vector<int>ans(n);
	map<int,int>where;//{number,position}
	ans[0] = ask(1);
	for(int i=0;i<7;++i){
		if((1<<i)>n)break;
		vector<int>cur;
		for(int j=0;j<(1<<6);++j){
			int act = ((j - (j&((1<<i)-1)))<<1) + (j&((1<<i)-1)) + (1<<i);
			if(act>n)break;
			if(act!=1)cur.pb(act);
		}
		vector<int>resp1 = get_pairwise_xor(cur);
		cur.pb(1);
		vector<int> resp2 = get_pairwise_xor(cur);
		int x = 0, y = 0;
		while(x<sz(resp2)){
			while(x<sz(resp2)&&(y==sz(resp1)||resp2[x]!=resp1[y])){
				if(resp2[x]!=0)where[resp2[x]^ans[0]]|=(1<<i);
				++x;
			}
			++y, ++x;
		}
	}
	for(auto [x,y]:where)ans[y-1] = x;
	return ans;
}


// int main() {
//     assert(scanf("%d", &n) == 1);

//     assert(1 <= n && n <= MAX_VALUE_OF_N);
//     for (int i = 1; i <= n; i++) {
//         int x;
//         assert(scanf("%d", &x) == 1);
//         assert(x >= 0 && x <= 1000 * 1000 * 1000);

//         a.push_back(x);
//     }
//     vector<int> participant_solution = guess(n);

//     if (participant_solution.size() != n) {
//         wrong_answer("-1");
//     }

// 	printf("%d\n", n);
    
//     for (auto i: participant_solution) {
//         printf("%d ", i);
//     }
//     printf("\n");
//     printf("%d\n", numberOfQueries);
//     return 0;
// }

Subtask #1
6.0 / 6.0

#	Verdict	Memory	Grader output
1	Correct	208 KB	Output is correct
2	Correct	208 KB	Output is correct
3	Correct	208 KB	Output is correct
4	Correct	208 KB	Output is correct

Subtask #2
94.0 / 94.0

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

Submission #567633

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 94.0 / 94.0

Subtask #1
6.0 / 6.0

Subtask #2
94.0 / 94.0