답안 #376864

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
376864 2021-03-12T05:50:30 Z ijxjdjd Xoractive (IZhO19_xoractive) C++14
100 / 100
4 ms 512 KB
#include "interactive.h"
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
using namespace std;

int first = -1;
vector<int> getNums(vector<int> a) {
    vector<int> q(a.size()+1);
    for (int i = 0; i < a.size(); i++) {
        q[i] = a[i]+1;
    }
    q[a.size()] = 1;
    vector<int> tot = get_pairwise_xor(q);
    q.resize(a.size());

    vector<int> own = get_pairwise_xor(q);
    vector<int> res(2*a.size()+1);
    set_difference(all(tot), all(own), res.begin());
    sort(res.begin(), res.end());
    res.resize(unique(res.begin(), res.end())-res.begin());
    assert(res.size() == a.size()+1 && res[0] == 0);
    vector<int> ret(a.size());
    for (int i = 1; i < res.size(); i++) {
        ret[i-1] = res[i]^first;
    }
    sort(all(ret));
    return ret;
}
vector<int> guess(int n) {
	vector <int> ans(n);
//	if (n <= 15) {
//        for (int i = 0; i < n; i++) {
//            ans[i] = ask(i+1);
//        }
//        return ans;
//	}

	first = ask(1);
	ans[0] = first;
	vector<int> av(n-1);
	for (int i = 1; i < n; i++) {
        av[i-1] = i;
	}
    vector<vector<int>> on(7);
    vector<vector<int>> off(7, vector<int>(n));
    for (int i = 0; i < 7; i++) {
        vector<int> prep;
        for (int j = 0; j < n; j++) {
            if ((1<<i)&j) {
                prep.push_back(j);
            }
        }
        if (prep.size() != 0) {
            on[i] = getNums(prep);
        }
    }
    vector<int> c;
    vector<int> tot;
    for (int i = 0; i < 7; i++) {
        c.resize(n);
        c.resize(set_union(all(tot), all(on[i]), c.begin())-c.begin());
        tot = c;
    }
    for (int i = 0; i < 7; i++) {
        off[i].resize(set_difference(all(tot), all(on[i]), off[i].begin())-off[i].begin());
    }
    for (int i = 1; i < n; i++) {
        vector<int> cur(tot.size());
        copy(all(tot), cur.begin());
        for (int b = 0; b < 7; b++) {
            vector<int>& nxt = (((1<<b)&i) ? on[b] : off[b]);
            cur.resize(set_intersection(all(cur), all(nxt), cur.begin())-cur.begin());
        }
        assert(cur.size() == 1);
        ans[i] = cur[0];
    }
	return ans;
}

Compilation message

Xoractive.cpp: In function 'std::vector<int> getNums(std::vector<int>)':
Xoractive.cpp:9:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for (int i = 0; i < a.size(); i++) {
      |                     ~~^~~~~~~~~~
Xoractive.cpp:23:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for (int i = 1; i < res.size(); i++) {
      |                     ~~^~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 3 ms 364 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 3 ms 364 KB Output is correct
21 Correct 3 ms 364 KB Output is correct
22 Correct 3 ms 364 KB Output is correct
23 Correct 3 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 3 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 2 ms 364 KB Output is correct
32 Correct 4 ms 364 KB Output is correct
33 Correct 3 ms 364 KB Output is correct
34 Correct 2 ms 364 KB Output is correct
35 Correct 2 ms 364 KB Output is correct
36 Correct 2 ms 364 KB Output is correct
37 Correct 2 ms 364 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 2 ms 364 KB Output is correct
40 Correct 3 ms 364 KB Output is correct
41 Correct 3 ms 364 KB Output is correct
42 Correct 3 ms 364 KB Output is correct
43 Correct 2 ms 364 KB Output is correct
44 Correct 2 ms 364 KB Output is correct
45 Correct 2 ms 364 KB Output is correct
46 Correct 2 ms 364 KB Output is correct
47 Correct 2 ms 364 KB Output is correct
48 Correct 4 ms 364 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 3 ms 492 KB Output is correct
51 Correct 2 ms 364 KB Output is correct
52 Correct 2 ms 364 KB Output is correct
53 Correct 2 ms 364 KB Output is correct
54 Correct 2 ms 364 KB Output is correct
55 Correct 3 ms 364 KB Output is correct
56 Correct 2 ms 364 KB Output is correct
57 Correct 2 ms 364 KB Output is correct
58 Correct 2 ms 364 KB Output is correct
59 Correct 2 ms 364 KB Output is correct
60 Correct 3 ms 384 KB Output is correct
61 Correct 2 ms 364 KB Output is correct
62 Correct 2 ms 364 KB Output is correct
63 Correct 2 ms 364 KB Output is correct
64 Correct 3 ms 364 KB Output is correct
65 Correct 3 ms 364 KB Output is correct
66 Correct 2 ms 384 KB Output is correct
67 Correct 2 ms 364 KB Output is correct
68 Correct 2 ms 364 KB Output is correct
69 Correct 2 ms 364 KB Output is correct
70 Correct 2 ms 364 KB Output is correct
71 Correct 2 ms 364 KB Output is correct
72 Correct 3 ms 364 KB Output is correct
73 Correct 3 ms 364 KB Output is correct
74 Correct 3 ms 364 KB Output is correct
75 Correct 2 ms 364 KB Output is correct
76 Correct 3 ms 364 KB Output is correct
77 Correct 2 ms 364 KB Output is correct
78 Correct 2 ms 364 KB Output is correct
79 Correct 3 ms 364 KB Output is correct
80 Correct 2 ms 364 KB Output is correct
81 Correct 2 ms 364 KB Output is correct
82 Correct 2 ms 364 KB Output is correct
83 Correct 2 ms 364 KB Output is correct
84 Correct 3 ms 364 KB Output is correct
85 Correct 2 ms 364 KB Output is correct
86 Correct 3 ms 364 KB Output is correct
87 Correct 3 ms 364 KB Output is correct
88 Correct 2 ms 364 KB Output is correct
89 Correct 2 ms 364 KB Output is correct
90 Correct 2 ms 364 KB Output is correct
91 Correct 2 ms 364 KB Output is correct
92 Correct 2 ms 364 KB Output is correct
93 Correct 2 ms 364 KB Output is correct
94 Correct 2 ms 384 KB Output is correct
95 Correct 2 ms 364 KB Output is correct
96 Correct 2 ms 364 KB Output is correct
97 Correct 2 ms 364 KB Output is correct
98 Correct 2 ms 364 KB Output is correct
99 Correct 2 ms 364 KB Output is correct
100 Correct 3 ms 384 KB Output is correct