Submission #619014

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
619014	2022-08-02T09:09:24 Z	Zanite	Xoractive (IZhO19_xoractive)	C++17	100 / 100	5 ms	592 KB

Xoractive

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

vector<int> ans;
map<int, int> pos;

vector<int> guess(int n) {
	ans.assign(n, 0);
	ans[0] = ask(1);

	int logN = 31 - __builtin_clz(n);
	//cerr << logN << '\n';
	for (int b = 0; b <= logN; b++) {
		cerr << b << '\n';
		// get the values of ans[0] ^ ... for the indices whose b-th bit is on
		// by inserting 1 to said set of indices
		multiset<int> bitval;

		vector<int> toQuery, queryAns;
		for (int i = 2; i <= n; i++) {
			if (i & (1 << b)) {toQuery.push_back(i);}
		}

		toQuery.push_back(1);
		queryAns = get_pairwise_xor(toQuery);
		for (auto &i : queryAns) {bitval.insert(i);}

		toQuery.pop_back();
		queryAns = get_pairwise_xor(toQuery);
		for (auto &i : queryAns) {bitval.erase(bitval.lower_bound(i));}

		//for (auto &i : bitval) {cout << i << ' ';} cout << '\n';

		// remove 0 because all elements are distinct
		bitval.erase(0);

		for (auto &i : bitval) {
			pos[i ^ ans[0]] |= (1 << b);
			//cout << (i ^ ans[0]) << ' ' << b << '\n';
		}
	}

	for (auto &[val, idx] : pos) {
		ans[idx-1] = val;
	}
	
	//for (auto &i : ans) cout << i << ' '; cout << '\n';
	return ans;
}

// Grader
#ifdef Zanite
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;
}

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;
}
#endif

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

Submission #619014

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