oj.uz

Submission #898328

# Submission time Handle Problem Language Result Execution time Memory
898328 2024-01-04T13:49:38 Z otarius Xoractive (IZhO19_xoractive) C++17
100 / 100
 4 ms 596 KB 
#include "interactive.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cstring>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>
using namespace std;

void __print(int x) { cerr << x; }

void __print(long x) { cerr << x; }

void __print(long long x) { cerr << x; }

void __print(unsigned x) { cerr << x; }

void __print(unsigned long x) { cerr << x; }

void __print(unsigned long long x) { cerr << x; }

void __print(float x) { cerr << x; }

void __print(double x) { cerr << x; }

void __print(long double x) { cerr << x; }

void __print(char x) { cerr << '\'' << x << '\''; }

void __print(const char *x) { cerr << '\"' << x << '\"'; }

void __print(const string &x) { cerr << '\"' << x << '\"'; }

void __print(bool x) { cerr << (x ? "true" : "false"); }

template<typename T, typename V>
void __print(const pair<T, V> &x) {
    cerr << '{';
    __print(x.first);
    cerr << ',';
    __print(x.second);
    cerr << '}';
}

template<typename T>
void __print(const T &x) {
    int f = 0;
    cerr << '{';
    for (auto &i: x) cerr << (f++ ? "," : ""), __print(i);
    cerr << "}";
}

void _print() { cerr << "]\n"; }

template<typename T, typename... V>
void _print(T t, V... v) {
    __print(t);
    if (sizeof...(v)) cerr << ", ";
    _print(v...);
}

#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair <int, int>
#define ull unsigned long long

// #define int long long
// #define int unsigned long long

const ll inf = 1e9 + 7;
const ll weirdMod = 998244353;

vector<int> opr(vector<int> cur) {
    map<int, int> cnt; cur.pb(1);
    vector<int> x = get_pairwise_xor(cur);
    cur.pop_back();
    vector<int> y = get_pairwise_xor(cur);
    for (int v : x) cnt[v]++;
    for (int v : y) {
        cnt[v]--;
        if (cnt[v] == 0)
            cnt.erase(v);
    } cnt.erase(0);
    vector<int> ans;
    for (auto v : cnt)
        ans.pb(v.ff);
    return ans;
}
vector<int> guess(int n) {
    if (n <= 4) {
        vector<int> ans(n);
        for (int i = 1; i <= n; i++)
            ans[i - 1] = ask(i);
        return ans;
    }
    int val = ask(1);
    vector<int> vec[10];
    for (int i = 2; i <= n; i++) {
        for (int j = 0; j < 7; j++) {
            if ((i >> j) % 2 == 1) vec[j].pb(i);
        }
    } map<int, int> mp;
    for (int i = 0; i < 7; i++) {
        vector<int> cur = opr(vec[i]);
        for (int v : cur) mp[v] += (1 << i);
    } vector<int> ans(n);
    ans[0] = val;
    for (auto v : mp)
        ans[v.sc - 1] = (val ^ v.ff);
    return ans;
}

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 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 344 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 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 2 ms 476 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 4 ms 344 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 3 ms 528 KB Output is correct
26 Correct 3 ms 344 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 3 ms 344 KB Output is correct
29 Correct 4 ms 344 KB Output is correct
30 Correct 3 ms 344 KB Output is correct
31 Correct 3 ms 596 KB Output is correct
32 Correct 3 ms 344 KB Output is correct
33 Correct 4 ms 596 KB Output is correct
34 Correct 3 ms 344 KB Output is correct
35 Correct 3 ms 344 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 4 ms 532 KB Output is correct
38 Correct 3 ms 344 KB Output is correct
39 Correct 2 ms 344 KB Output is correct
40 Correct 4 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 344 KB Output is correct
44 Correct 3 ms 524 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 528 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 352 KB Output is correct
53 Correct 3 ms 344 KB Output is correct
54 Correct 3 ms 348 KB Output is correct
55 Correct 2 ms 356 KB Output is correct
56 Correct 4 ms 356 KB Output is correct
57 Correct 3 ms 356 KB Output is correct
58 Correct 3 ms 356 KB Output is correct
59 Correct 2 ms 356 KB Output is correct
60 Correct 3 ms 356 KB Output is correct
61 Correct 3 ms 540 KB Output is correct
62 Correct 4 ms 356 KB Output is correct
63 Correct 2 ms 356 KB Output is correct
64 Correct 3 ms 356 KB Output is correct
65 Correct 3 ms 356 KB Output is correct
66 Correct 3 ms 512 KB Output is correct
67 Correct 2 ms 344 KB Output is correct
68 Correct 3 ms 516 KB Output is correct
69 Correct 3 ms 344 KB Output is correct
70 Correct 3 ms 344 KB Output is correct
71 Correct 3 ms 512 KB Output is correct
72 Correct 4 ms 596 KB Output is correct
73 Correct 3 ms 344 KB Output is correct
74 Correct 3 ms 496 KB Output is correct
75 Correct 2 ms 344 KB Output is correct
76 Correct 3 ms 344 KB Output is correct
77 Correct 3 ms 344 KB Output is correct
78 Correct 4 ms 344 KB Output is correct
79 Correct 2 ms 344 KB Output is correct
80 Correct 3 ms 528 KB Output is correct
81 Correct 3 ms 344 KB Output is correct
82 Correct 3 ms 344 KB Output is correct
83 Correct 2 ms 344 KB Output is correct
84 Correct 3 ms 344 KB Output is correct
85 Correct 4 ms 344 KB Output is correct
86 Correct 4 ms 344 KB Output is correct
87 Correct 2 ms 344 KB Output is correct
88 Correct 3 ms 344 KB Output is correct
89 Correct 3 ms 344 KB Output is correct
90 Correct 3 ms 344 KB Output is correct
91 Correct 3 ms 344 KB Output is correct
92 Correct 3 ms 344 KB Output is correct
93 Correct 3 ms 344 KB Output is correct
94 Correct 3 ms 340 KB Output is correct
95 Correct 2 ms 344 KB Output is correct
96 Correct 4 ms 344 KB Output is correct
97 Correct 3 ms 528 KB Output is correct
98 Correct 3 ms 528 KB Output is correct
99 Correct 2 ms 344 KB Output is correct
100 Correct 3 ms 548 KB Output is correct