oj.uz

답안 #401195

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
401195 2021-05-09T14:44:50 Z Victor Xoractive (IZhO19_xoractive) C++17
100 / 100
 8 ms 584 KB 
#include <bits/stdc++.h>

#include "interactive.h"

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1000000007;

umap<int, bitset<101>> nums;

umap<int, int> process(vi vec) {
    umap<int, int> ret;
    rep(i, sqrt(sz(vec)), sz(vec))++ ret[vec[i++]];
    return ret;
}

bitset<101> pos_queries[15], dummy;
uset<int> nums_queries[15];
int cur_query = 0;

void queryyy(vi vec, int &last, int &n) {
    bitset<101> &pos_query = pos_queries[cur_query];
    auto &num_query = nums_queries[cur_query++];

    trav(num, vec) pos_query[num] = 1;

    auto prev = process(get_pairwise_xor(vec));
    vec.pb(n);
    auto cur = process(get_pairwise_xor(vec));

    trav(element, cur) {
        int num, cnt;
        tie(num, cnt) = element;

        if (prev[num] != cnt) {
            int num_add = num ^ last;
            num_query.insert(num_add);
            if (!nums.count(num_add)) nums[num_add] = dummy;
        }
    }
}

vector<int> guess(int n) {
    vector<int> ans(n, -1), qvec;
    int last = ask(n), queries = ceil(log2(n)), twopow = 1 << queries;
    vvi groups(1, vi());
    rep(i, 1, twopow + 1) groups[0].pb(i);

    rep(i, 1, n) dummy[i] = 1;

    rep(i, 0, queries) {
        vvi n_groups(sz(groups) << 1);
        int idx = 0;

        trav(group, groups) {

            rep(j, 0, sz(group) >> 1) {
                n_groups[idx].pb(group[j]);
                if (group[j] < n) qvec.pb(group[j]);
            }

            ++idx;
            rep(j, sz(group) >> 1, sz(group)) n_groups[idx].pb(group[j]);
            ++idx;
        }

        queryyy(qvec,last,n);
        groups = n_groups;
        qvec.clear();
    }

    rep(i, 0, queries) {
        bitset<101> &pos_query = pos_queries[i], rev = ~pos_query;
        auto &num_query = nums_queries[i];

        trav(element, nums) {
            int num = element.first;
            auto &positions = element.second;

            if (num_query.count(num))
                positions &= pos_query;

            else
                positions &= rev;
        }
    }

    trav(element, nums) {
        int num = element.first;
        auto &positions = element.second;
        ans[positions._Find_first()-1]=num;
    }

    ans[n - 1] = last;
    return ans;
}

Compilation message

Xoractive.cpp: In function 'std::unordered_map<int, int> process(vi)':
Xoractive.cpp:7:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for (int i = a; i < (b); ++i)
      |                                        ^
Xoractive.cpp:31:5: note: in expansion of macro 'rep'
   31 |     rep(i, sqrt(sz(vec)), sz(vec))++ ret[vec[i++]];
      |     ^~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:7:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for (int i = a; i < (b); ++i)
      |                                        ^
Xoractive.cpp:75:13: note: in expansion of macro 'rep'
   75 |             rep(j, 0, sz(group) >> 1) {
      |             ^~~
Xoractive.cpp:7:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for (int i = a; i < (b); ++i)
      |                                        ^
Xoractive.cpp:81:13: note: in expansion of macro 'rep'
   81 |             rep(j, sz(group) >> 1, sz(group)) n_groups[idx].pb(group[j]);
      |             ^~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 256 KB Output is correct

Subtask #2
94.0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 516 KB Output is correct
2 Correct 6 ms 456 KB Output is correct
3 Correct 3 ms 328 KB Output is correct
4 Correct 6 ms 456 KB Output is correct
5 Correct 6 ms 456 KB Output is correct
6 Correct 6 ms 456 KB Output is correct
7 Correct 3 ms 328 KB Output is correct
8 Correct 6 ms 456 KB Output is correct
9 Correct 6 ms 456 KB Output is correct
10 Correct 6 ms 456 KB Output is correct
11 Correct 3 ms 328 KB Output is correct
12 Correct 6 ms 456 KB Output is correct
13 Correct 6 ms 456 KB Output is correct
14 Correct 8 ms 456 KB Output is correct
15 Correct 4 ms 328 KB Output is correct
16 Correct 6 ms 456 KB Output is correct
17 Correct 6 ms 456 KB Output is correct
18 Correct 6 ms 456 KB Output is correct
19 Correct 3 ms 328 KB Output is correct
20 Correct 6 ms 456 KB Output is correct
21 Correct 6 ms 456 KB Output is correct
22 Correct 7 ms 524 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 6 ms 456 KB Output is correct
25 Correct 6 ms 456 KB Output is correct
26 Correct 6 ms 520 KB Output is correct
27 Correct 3 ms 328 KB Output is correct
28 Correct 6 ms 456 KB Output is correct
29 Correct 7 ms 456 KB Output is correct
30 Correct 6 ms 584 KB Output is correct
31 Correct 4 ms 328 KB Output is correct
32 Correct 7 ms 456 KB Output is correct
33 Correct 6 ms 456 KB Output is correct
34 Correct 6 ms 456 KB Output is correct
35 Correct 3 ms 328 KB Output is correct
36 Correct 6 ms 456 KB Output is correct
37 Correct 6 ms 456 KB Output is correct
38 Correct 6 ms 456 KB Output is correct
39 Correct 3 ms 328 KB Output is correct
40 Correct 6 ms 456 KB Output is correct
41 Correct 6 ms 456 KB Output is correct
42 Correct 6 ms 456 KB Output is correct
43 Correct 3 ms 328 KB Output is correct
44 Correct 6 ms 456 KB Output is correct
45 Correct 6 ms 456 KB Output is correct
46 Correct 7 ms 532 KB Output is correct
47 Correct 3 ms 328 KB Output is correct
48 Correct 6 ms 456 KB Output is correct
49 Correct 6 ms 456 KB Output is correct
50 Correct 6 ms 528 KB Output is correct
51 Correct 3 ms 328 KB Output is correct
52 Correct 6 ms 456 KB Output is correct
53 Correct 7 ms 456 KB Output is correct
54 Correct 6 ms 536 KB Output is correct
55 Correct 4 ms 328 KB Output is correct
56 Correct 6 ms 456 KB Output is correct
57 Correct 7 ms 456 KB Output is correct
58 Correct 6 ms 456 KB Output is correct
59 Correct 3 ms 328 KB Output is correct
60 Correct 6 ms 456 KB Output is correct
61 Correct 6 ms 456 KB Output is correct
62 Correct 8 ms 456 KB Output is correct
63 Correct 4 ms 328 KB Output is correct
64 Correct 6 ms 456 KB Output is correct
65 Correct 7 ms 456 KB Output is correct
66 Correct 6 ms 456 KB Output is correct
67 Correct 4 ms 328 KB Output is correct
68 Correct 6 ms 456 KB Output is correct
69 Correct 6 ms 456 KB Output is correct
70 Correct 6 ms 456 KB Output is correct
71 Correct 3 ms 328 KB Output is correct
72 Correct 6 ms 528 KB Output is correct
73 Correct 6 ms 456 KB Output is correct
74 Correct 6 ms 456 KB Output is correct
75 Correct 4 ms 364 KB Output is correct
76 Correct 8 ms 456 KB Output is correct
77 Correct 6 ms 456 KB Output is correct
78 Correct 6 ms 460 KB Output is correct
79 Correct 4 ms 328 KB Output is correct
80 Correct 6 ms 456 KB Output is correct
81 Correct 6 ms 456 KB Output is correct
82 Correct 6 ms 456 KB Output is correct
83 Correct 3 ms 328 KB Output is correct
84 Correct 6 ms 456 KB Output is correct
85 Correct 6 ms 456 KB Output is correct
86 Correct 6 ms 460 KB Output is correct
87 Correct 3 ms 328 KB Output is correct
88 Correct 6 ms 456 KB Output is correct
89 Correct 6 ms 456 KB Output is correct
90 Correct 6 ms 456 KB Output is correct
91 Correct 3 ms 328 KB Output is correct
92 Correct 6 ms 456 KB Output is correct
93 Correct 6 ms 456 KB Output is correct
94 Correct 6 ms 420 KB Output is correct
95 Correct 3 ms 328 KB Output is correct
96 Correct 6 ms 444 KB Output is correct
97 Correct 6 ms 520 KB Output is correct
98 Correct 6 ms 456 KB Output is correct
99 Correct 3 ms 328 KB Output is correct
100 Correct 6 ms 456 KB Output is correct