oj.uz

답안 #1091208

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091208 2024-09-20T06:48:40 Z kawaii Klasika (COCI20_klasika) C++17
33 / 110
 784 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define fi first
#define se second

const int MAXN = 2e5 + 5;
int t, n, m, k, node = 1, val[MAXN], tin[MAXN], tout[MAXN], cnt = 0;
string s;
vector<int> adj[MAXN];
mt19937_64 rng;

struct Query{
    char ch;
    int x, y;
};

Query q[MAXN];

void dfs(int u){
    tin[u] = ++cnt;
    for(auto i: adj[u]) dfs(i);
    tout[u] = cnt;
}

struct Node{
    int size = 0;
    vector<int> next[2];
    void add(int x){
        if(!size){   
            next[0].push_back(0);
            next[1].push_back(0);
        }
        int crr_id = 0;
        for(int i = 30; i >= 0; i--){
            bool bit = (((1 << i) & x) > 0);
            if(!next[bit][crr_id]){
                next[0].push_back(0);
                next[1].push_back(0);
                next[bit][crr_id] = ++size;
            }
            crr_id = next[bit][crr_id];
        }
    }
    int query(int x){
        if(!size){   
            next[0].push_back(0);
            next[1].push_back(0);
        }
        int crr_id = 0, ans = 0;
        for(int i = 30; i >= 0; i--){
            bool bit = !((1 << i) & x);
            if(!next[bit][crr_id]) bit = !bit;
            else ans |= (1 << i);
            crr_id = next[bit][crr_id]; 
        }
        return ans;
    }
};

Node st[MAXN * 4];

int get(int crr, int l, int r, int lf, int rt, int val){
    if(l > rt || r < lf) return 0;
    if(lf <= l && r <= rt) return st[crr].query(val);
    int mid = l + r >> 1;
    return max(get(crr * 2, l, mid, lf, rt, val), get(crr * 2 + 1, mid + 1, r, lf, rt, val));
}

void update(int crr, int l, int r, int id, int val){
    if(l > id || r < id) return;
    if(l == r){
        st[crr].add(val);
        return;
    }
    int mid = l + r >> 1;
    update(crr * 2, l, mid, id, val);
    update(crr * 2 + 1, mid + 1, r, id, val);
    st[crr].add(val);
}

void solve(){
    dfs(1);
    node = 1;
    update(1, 1, cnt, 1, 0);
    for(int i = 1; i <= n; i++){
        if(q[i].ch == 'A') node++, update(1, 1, cnt, tin[node], val[node]);
        else cout << get(1, 1, cnt, tin[q[i].y], tout[q[i].y], val[q[i].x]) << "\n";
    }
}

signed main(){
    ios_base::sync_with_stdio(NULL); cin.tie(nullptr); cout.tie(nullptr);
    // rng.seed((int)main ^ time(0));
    #ifdef Kawaii
        auto starttime = chrono::high_resolution_clock::now();
    #endif

    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> s >> q[i].x >> q[i].y;
        if(s == "Add"){
            q[i].ch = 'A';
            val[++node] = val[q[i].x] ^ q[i].y;
            adj[q[i].x].push_back(node);
        }
        else q[i].ch = 'Q';
    }
    solve();

    #ifdef Kawaii
        auto endtime = chrono::high_resolution_clock::now();
        auto duration = chrono::duration_cast<chrono::milliseconds>(endtime - starttime).count(); 
        cout << "\n=====" << "\nUsed: " << duration << " ms\n";
    #endif
}

Compilation message

klasika.cpp: In function 'int get(int, int, int, int, int, int)':
klasika.cpp:66:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |     int mid = l + r >> 1;
      |               ~~^~~
klasika.cpp: In function 'void update(int, int, int, int, int)':
klasika.cpp:76:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   76 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 48988 KB Output is correct
2 Correct 21 ms 48984 KB Output is correct
3 Correct 20 ms 49244 KB Output is correct
4 Correct 21 ms 49496 KB Output is correct
5 Correct 23 ms 48988 KB Output is correct
6 Correct 21 ms 49072 KB Output is correct
7 Correct 24 ms 49244 KB Output is correct
8 Correct 22 ms 49232 KB Output is correct
9 Correct 25 ms 48984 KB Output is correct
10 Correct 23 ms 49244 KB Output is correct
11 Correct 22 ms 49180 KB Output is correct
12 Correct 24 ms 49476 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 48988 KB Output is correct
2 Correct 21 ms 48984 KB Output is correct
3 Correct 20 ms 49244 KB Output is correct
4 Correct 21 ms 49496 KB Output is correct
5 Correct 23 ms 48988 KB Output is correct
6 Correct 21 ms 49072 KB Output is correct
7 Correct 24 ms 49244 KB Output is correct
8 Correct 22 ms 49232 KB Output is correct
9 Correct 25 ms 48984 KB Output is correct
10 Correct 23 ms 49244 KB Output is correct
11 Correct 22 ms 49180 KB Output is correct
12 Correct 24 ms 49476 KB Output is correct
13 Correct 26 ms 50016 KB Output is correct
14 Correct 25 ms 51548 KB Output is correct
15 Correct 29 ms 52820 KB Output is correct
16 Correct 31 ms 54480 KB Output is correct
17 Correct 24 ms 50272 KB Output is correct
18 Correct 24 ms 51612 KB Output is correct
19 Correct 25 ms 52580 KB Output is correct
20 Correct 28 ms 54352 KB Output is correct
21 Correct 25 ms 50000 KB Output is correct
22 Correct 28 ms 51536 KB Output is correct
23 Correct 26 ms 52572 KB Output is correct
24 Correct 30 ms 54108 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 205548 KB Output is correct
2 Correct 526 ms 368888 KB Output is correct
3 Correct 784 ms 520996 KB Output is correct
4 Runtime error 726 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 48988 KB Output is correct
2 Correct 21 ms 48984 KB Output is correct
3 Correct 20 ms 49244 KB Output is correct
4 Correct 21 ms 49496 KB Output is correct
5 Correct 23 ms 48988 KB Output is correct
6 Correct 21 ms 49072 KB Output is correct
7 Correct 24 ms 49244 KB Output is correct
8 Correct 22 ms 49232 KB Output is correct
9 Correct 25 ms 48984 KB Output is correct
10 Correct 23 ms 49244 KB Output is correct
11 Correct 22 ms 49180 KB Output is correct
12 Correct 24 ms 49476 KB Output is correct
13 Correct 26 ms 50016 KB Output is correct
14 Correct 25 ms 51548 KB Output is correct
15 Correct 29 ms 52820 KB Output is correct
16 Correct 31 ms 54480 KB Output is correct
17 Correct 24 ms 50272 KB Output is correct
18 Correct 24 ms 51612 KB Output is correct
19 Correct 25 ms 52580 KB Output is correct
20 Correct 28 ms 54352 KB Output is correct
21 Correct 25 ms 50000 KB Output is correct
22 Correct 28 ms 51536 KB Output is correct
23 Correct 26 ms 52572 KB Output is correct
24 Correct 30 ms 54108 KB Output is correct
25 Correct 297 ms 205548 KB Output is correct
26 Correct 526 ms 368888 KB Output is correct
27 Correct 784 ms 520996 KB Output is correct
28 Runtime error 726 ms 524288 KB Execution killed with signal 9
29 Halted 0 ms 0 KB -