oj.uz

답안 #1098641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1098641 2024-10-09T16:19:05 Z hiensumi Klasika (COCI20_klasika) C++14
33 / 110
 1411 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
#define fod(i,a,b) for(int i = (int) (a); i <= (int) (b); i++)
#define fok(i,a,b) for(int i = (int) (a); i >= (int) (b); i--)
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define el '\n'
#define ve vector
#define vi ve<int>
#define vll ve<ll>
#define mask(a) (1LL<<(a))
#define BIT(msk,i) (msk>>(i)&1LL)
using namespace std;
template <class T> bool mini(T &a, T b){ return (a > (b)) ? a = (b), 1 : 0; }
template <class T> bool maxi(T &a, T b){ return (a < (b)) ? a = (b), 1 : 0; }
#define name "klasika"

int n = 1, q;

const int N = 2e5;

struct Query{
    bool new_node;
    int x, y;
}query[N + 5];

ve <ve<pii>> g;

int in[N + 5], out[N + 5], timedfs = 0;
int f[N + 5];

void dfs(int u, int p){
    in[u] = ++timedfs;
    for(pii who : g[u]) if(who.fi != p){
        int v, w; tie(v, w) = who;
        f[v] = f[u] xor w;
        dfs(v, u);
    }
    out[u] = timedfs;
}

struct Node{
    set <int> ids;
    Node* nxt[31];
    Node(){
        ids.clear();
        fod(j,0,30) nxt[j] = NULL;
    }
};

Node* root = new Node();

inline void add(int val, int id){
    Node* cur = root;
    fok(j,30,0){
        int w = BIT(val, j);
        if(cur -> nxt[w] == NULL) cur -> nxt[w] = new Node();
        cur = cur -> nxt[w];
        cur -> ids.insert(id);
    }
}

int get(int val, int l, int r){
    Node* cur = root;
    int res = 0;

    fok(j,30,0){
        int w = BIT(val, j);
        if(cur -> nxt[w^1] == NULL) cur = cur -> nxt[w];
        else{
            if(cur -> nxt[w^1] -> ids.lower_bound(l) == cur -> nxt[w^1] -> ids.upper_bound(r)){
                cur = cur -> nxt[w];
                continue;
            }
            res += mask(j);
            cur = cur -> nxt[w^1];
        }
    }

    return res;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> q;

    g.resize(q + 1);

    fod(i,1,q){
        string s; cin >> s;
        int x, y; cin >> x >> y;

        if(s == "Add"){
            n++;
            g[x].pb(mp(n, y));
            g[n].pb(mp(x, y));
            query[i] = Query{1, n, y};
        }
        else query[i] = Query{0, x, y};
    }

    dfs(1, 0);

    add(f[1], in[1]);

    fod(i,1,q){
        if(query[i].new_node){
            add(f[query[i].x], in[query[i].x]);
        }
        else{
            cout << get(f[query[i].x], in[query[i].y], out[query[i].y]) << el;
        }
    }

    return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 2 ms 1628 KB Output is correct
9 Correct 1 ms 728 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 2 ms 1624 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 2 ms 1628 KB Output is correct
9 Correct 1 ms 728 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 2 ms 1624 KB Output is correct
13 Correct 4 ms 3932 KB Output is correct
14 Correct 5 ms 7028 KB Output is correct
15 Correct 7 ms 10140 KB Output is correct
16 Correct 8 ms 12636 KB Output is correct
17 Correct 4 ms 3676 KB Output is correct
18 Correct 5 ms 6748 KB Output is correct
19 Correct 9 ms 9784 KB Output is correct
20 Correct 10 ms 12628 KB Output is correct
21 Correct 4 ms 3676 KB Output is correct
22 Correct 6 ms 6880 KB Output is correct
23 Correct 11 ms 9816 KB Output is correct
24 Correct 13 ms 12632 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 861 ms 261168 KB Output is correct
2 Correct 1411 ms 489432 KB Output is correct
3 Runtime error 1301 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 2 ms 1628 KB Output is correct
9 Correct 1 ms 728 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 2 ms 1624 KB Output is correct
13 Correct 4 ms 3932 KB Output is correct
14 Correct 5 ms 7028 KB Output is correct
15 Correct 7 ms 10140 KB Output is correct
16 Correct 8 ms 12636 KB Output is correct
17 Correct 4 ms 3676 KB Output is correct
18 Correct 5 ms 6748 KB Output is correct
19 Correct 9 ms 9784 KB Output is correct
20 Correct 10 ms 12628 KB Output is correct
21 Correct 4 ms 3676 KB Output is correct
22 Correct 6 ms 6880 KB Output is correct
23 Correct 11 ms 9816 KB Output is correct
24 Correct 13 ms 12632 KB Output is correct
25 Correct 861 ms 261168 KB Output is correct
26 Correct 1411 ms 489432 KB Output is correct
27 Runtime error 1301 ms 524288 KB Execution killed with signal 9
28 Halted 0 ms 0 KB -