oj.uz

답안 #487906

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
487906 2021-11-17T02:17:05 Z hoanghq2004 Klasika (COCI20_klasika) C++14
33 / 110
 1278 ms 524292 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;

const int Nmax = 2e5 + 10;

int sz;
struct node {
    int to[2];
    set <int> s;
} trie[Nmax * 31];

void add(int x, int ti) {
    int u = 0;
    for (int i = 29; i >= 0; --i) {
        if (!trie[u].to[x >> i & 1]) trie[u].to[x >> i & 1] = ++sz;
        u = trie[u].to[x >> i & 1];
        trie[u].s.insert(ti);
    }
}

int get(int x, int L, int R) {
    int u = 0;
    int ans = 0;
    for (int i = 29; i >= 0; --i) {
        auto iter = trie[trie[u].to[x >> i & 1 ^ 1]].s.lower_bound(L);
        if (iter == trie[trie[u].to[x >> i & 1 ^ 1]].s.end() || *iter > R) u = trie[u].to[x >> i & 1];
        else ans += (1 << i), u = trie[u].to[x >> i & 1 ^ 1];
    }
    return ans;
}

int q;
vector <pair <int, int> > e[Nmax];
int in[Nmax], out[Nmax], ti, d[Nmax];

void dfs(int u) {
    in[u] = ++ti;
    for (auto [v, w]: e[u]) {
        d[v] = d[u] ^ w;
        dfs(v);
    }
    out[u] = ti;
}

vector <tuple <string, int, int> > queries;

int main() {
    ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> q;
    int n = 1;
    while (q--) {
        string s;
        int x, y;
        cin >> s >> x >> y;
        if (s == "Add") ++n, e[x].push_back({n, y}), queries.push_back({s, n, y});
        else queries.push_back({s, x, y});
    }
    dfs(1);
    add(d[1], in[1]);
    for (auto [s, x, y]: queries) {
        if (s == "Add") add(d[x], in[x]);
        else cout << get(d[x], in[y], out[y]) << '\n';
    }
}

Compilation message

klasika.cpp: In function 'int get(int, int, int)':
klasika.cpp:28:44: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   28 |         auto iter = trie[trie[u].to[x >> i & 1 ^ 1]].s.lower_bound(L);
      |                                     ~~~~~~~^~~
klasika.cpp:29:44: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   29 |         if (iter == trie[trie[u].to[x >> i & 1 ^ 1]].s.end() || *iter > R) u = trie[u].to[x >> i & 1];
      |                                     ~~~~~~~^~~
klasika.cpp:30:53: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   30 |         else ans += (1 << i), u = trie[u].to[x >> i & 1 ^ 1];
      |                                              ~~~~~~~^~~
klasika.cpp: In function 'void dfs(int)':
klasika.cpp:41:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   41 |     for (auto [v, w]: e[u]) {
      |               ^
klasika.cpp: In function 'int main()':
klasika.cpp:63:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   63 |     for (auto [s, x, y]: queries) {
      |               ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 344720 KB Output is correct
2 Correct 152 ms 344772 KB Output is correct
3 Correct 154 ms 345032 KB Output is correct
4 Correct 164 ms 344880 KB Output is correct
5 Correct 155 ms 344692 KB Output is correct
6 Correct 155 ms 344864 KB Output is correct
7 Correct 153 ms 344900 KB Output is correct
8 Correct 174 ms 344900 KB Output is correct
9 Correct 153 ms 344732 KB Output is correct
10 Correct 155 ms 344876 KB Output is correct
11 Correct 151 ms 344812 KB Output is correct
12 Correct 153 ms 344888 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 344720 KB Output is correct
2 Correct 152 ms 344772 KB Output is correct
3 Correct 154 ms 345032 KB Output is correct
4 Correct 164 ms 344880 KB Output is correct
5 Correct 155 ms 344692 KB Output is correct
6 Correct 155 ms 344864 KB Output is correct
7 Correct 153 ms 344900 KB Output is correct
8 Correct 174 ms 344900 KB Output is correct
9 Correct 153 ms 344732 KB Output is correct
10 Correct 155 ms 344876 KB Output is correct
11 Correct 151 ms 344812 KB Output is correct
12 Correct 153 ms 344888 KB Output is correct
13 Correct 173 ms 345380 KB Output is correct
14 Correct 154 ms 346052 KB Output is correct
15 Correct 161 ms 346548 KB Output is correct
16 Correct 157 ms 347144 KB Output is correct
17 Correct 159 ms 345404 KB Output is correct
18 Correct 155 ms 345976 KB Output is correct
19 Correct 165 ms 346628 KB Output is correct
20 Correct 164 ms 347036 KB Output is correct
21 Correct 172 ms 345448 KB Output is correct
22 Correct 156 ms 345992 KB Output is correct
23 Correct 159 ms 346564 KB Output is correct
24 Correct 157 ms 347124 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 720 ms 413436 KB Output is correct
2 Correct 1130 ms 472224 KB Output is correct
3 Runtime error 1278 ms 524292 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 344720 KB Output is correct
2 Correct 152 ms 344772 KB Output is correct
3 Correct 154 ms 345032 KB Output is correct
4 Correct 164 ms 344880 KB Output is correct
5 Correct 155 ms 344692 KB Output is correct
6 Correct 155 ms 344864 KB Output is correct
7 Correct 153 ms 344900 KB Output is correct
8 Correct 174 ms 344900 KB Output is correct
9 Correct 153 ms 344732 KB Output is correct
10 Correct 155 ms 344876 KB Output is correct
11 Correct 151 ms 344812 KB Output is correct
12 Correct 153 ms 344888 KB Output is correct
13 Correct 173 ms 345380 KB Output is correct
14 Correct 154 ms 346052 KB Output is correct
15 Correct 161 ms 346548 KB Output is correct
16 Correct 157 ms 347144 KB Output is correct
17 Correct 159 ms 345404 KB Output is correct
18 Correct 155 ms 345976 KB Output is correct
19 Correct 165 ms 346628 KB Output is correct
20 Correct 164 ms 347036 KB Output is correct
21 Correct 172 ms 345448 KB Output is correct
22 Correct 156 ms 345992 KB Output is correct
23 Correct 159 ms 346564 KB Output is correct
24 Correct 157 ms 347124 KB Output is correct
25 Correct 720 ms 413436 KB Output is correct
26 Correct 1130 ms 472224 KB Output is correct
27 Runtime error 1278 ms 524292 KB Execution killed with signal 9
28 Halted 0 ms 0 KB -