oj.uz

Submission #896694

# Submission time Handle Problem Language Result Execution time Memory
896694 2024-01-01T21:35:09 Z vgtcross Xoractive (IZhO19_xoractive) C++17
100 / 100
 3 ms 596 KB 
#include <bits/stdc++.h>

#define MODE 0

#if MODE
#define debug(x) cout << #x << ": " << (x) << endl
#define log(x) cout << (x) << endl
#define test(x) x
#else
#define debug(x)
#define log(x)
#define test(x)
#endif

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
#define X real()
#define Y imag()

using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using P = complex<ll>;

template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}

const ll M = 1000000007; // 998244353

int ask(int i)
#if MODE == 0
;
#else
{
    cout << "ask " << i << endl;
    int v;
    cin >> v;
    return v;
}
#endif

vector<int> get_pairwise_xor(vector<int> pos)
#if MODE == 0
;
#else
{
    cout << "xor ";
    for (int i : pos) cout << i << ' ';
    cout << endl;
    vector<int> v(pos.size() * pos.size());
    for (int &i : v) cin >> i;
    return v;
}
#endif

vector<int> diff(vector<int> &a, vector<int> &b) {
    sort(all(a));
    sort(all(b));
    vector<int> c;
    int j = 0;
    for (int i = 0; i < a.size(); ++i) {
        if (j < b.size() && a[i] == b[j]) ++j;
        else c.push_back(a[i]);
    }
    return c;
}

vector<int> guess(int n) {
    int x = ask(n);
    map<int, int> mp;
    for (int i = 1; i < n; i *= 2) {
        vector<int> v;
        for (int j = 1; j < n; ++j) if (j & i) v.push_back(j);
        auto a = get_pairwise_xor(v);
        v.push_back(n);
        auto b = get_pairwise_xor(v);
        auto c = diff(b, a);
        for (int j = 1; j < c.size(); j += 2) mp[c[j] ^ x] += i;
    }
    
    vector<int> ans(n);
    ans[n-1] = x;
    for (pii p : mp) ans[p.se-1] = p.fi;
    return ans;
}

#if MODE
int main() {
    cin.tie(0) -> sync_with_stdio(0);
    
    int n;
    cin >> n;
    
    auto ans = guess(n);
    for (int i : ans) cout << i << ' ';
    cout << endl;
    
    return 0;
}
#endif

Compilation message

Xoractive.cpp: In function 'std::vector<int> diff(std::vector<int>&, std::vector<int>&)':
Xoractive.cpp:67:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for (int i = 0; i < a.size(); ++i) {
      |                     ~~^~~~~~~~~~
Xoractive.cpp:68:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         if (j < b.size() && a[i] == b[j]) ++j;
      |             ~~^~~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:84:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |         for (int j = 1; j < c.size(); j += 2) mp[c[j] ^ x] += i;
      |                         ~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

# 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

Subtask #2
94.0 / 94.0

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