oj.uz

Submission #647948

# Submission time Handle Problem Language Result Execution time Memory
647948 2022-10-04T16:55:51 Z LeonaRaging Klasika (COCI20_klasika) C++14
33 / 110
 5000 ms 165228 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define ll long long
#define pb push_back
#define db(val) "[" #val " = " << (val) << "] "
 
const ll mod = 1e9 + 7;
const int maxn = 2e5 + 4;
const int INF = 1e9;
const int LOG = 30;
 
struct Query {
    int t, u, v, idx;
};
 
int n, q, tin[maxn], tout[maxn], dis[maxn];
vector<pair<int,int>> adj[maxn];
vector<Query> queries;
 
struct Trie {
    int num, nxt[30 * maxn][2];
    vector<int> mySet[30 * maxn];
    void add(int u) {
        int v = 0;
        for (int i = LOG; i >= 0; i--) {
            mySet[v].pb(tin[u]);
            sort(mySet[v].begin(), mySet[v].end());
            int c = (dis[u] >> i & 1);
            if (!nxt[v][c]) {
                nxt[v][c] = ++num;
            }
            v = nxt[v][c];
        }
        mySet[v].pb(tin[u]);
        sort(mySet[v].begin(), mySet[v].end());
    }
    bool ok(int u, int v) {
        int lo = lower_bound(mySet[v].begin(), mySet[v].end(), tin[u]) - mySet[v].begin();
        if (lo == (int)mySet[v].size() || mySet[v][lo] > tout[u]) return 0;
        return 1;
    }
    int get(int x, int u) {
        int v = 0, res = 0;
        for (int i = LOG; i >= 0; i--) {
            int c = (x >> i & 1) ^ 1;
            if (nxt[v][c] && ok(u, nxt[v][c])) {
                v = nxt[v][c];
                res += (1 << i);
            }
            else if (nxt[v][c ^ 1] && ok(u, nxt[v][c ^ 1]))
                v = nxt[v][c ^ 1];
            else break;
        }
        return res;
    }
} t;
 
void dfs(int u) {
    tin[u] = ++tin[0];
    for (auto it : adj[u]) {
        int v, w; tie(v, w) = it;
        dis[v] = dis[u] ^ w;
        dfs(v);
    }
    tout[u] = tin[0];
}
 
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen(".INP", "r", stdin);
    //freopen(".OUT", "w", stdout);
    cin >> q;
    n = 1;
    for (int i = 1; i <= q; i++) {
        string type; int u, v;
        cin >> type >> u >> v;
        if (type == "Add")
            adj[u].pb({++n, v});
        if (type == "Add")
            queries.pb({0, u, n, i});
        else queries.pb({1, u, v, i});
    }
    dfs(1);
    t.add(1);
    for (auto it : queries) {
        int type = it.t, u = it.u, v = it.v;
        if (type == 0) t.add(v);
        else cout << t.get(dis[u], v) << '\n';
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 145900 KB Output is correct
2 Correct 70 ms 145984 KB Output is correct
3 Correct 66 ms 146032 KB Output is correct
4 Correct 70 ms 145980 KB Output is correct
5 Correct 68 ms 145856 KB Output is correct
6 Correct 70 ms 145976 KB Output is correct
7 Correct 70 ms 145996 KB Output is correct
8 Correct 75 ms 146044 KB Output is correct
9 Correct 68 ms 145920 KB Output is correct
10 Correct 83 ms 146024 KB Output is correct
11 Correct 73 ms 146044 KB Output is correct
12 Correct 82 ms 145980 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 145900 KB Output is correct
2 Correct 70 ms 145984 KB Output is correct
3 Correct 66 ms 146032 KB Output is correct
4 Correct 70 ms 145980 KB Output is correct
5 Correct 68 ms 145856 KB Output is correct
6 Correct 70 ms 145976 KB Output is correct
7 Correct 70 ms 145996 KB Output is correct
8 Correct 75 ms 146044 KB Output is correct
9 Correct 68 ms 145920 KB Output is correct
10 Correct 83 ms 146024 KB Output is correct
11 Correct 73 ms 146044 KB Output is correct
12 Correct 82 ms 145980 KB Output is correct
13 Correct 73 ms 146268 KB Output is correct
14 Correct 83 ms 146736 KB Output is correct
15 Correct 109 ms 147148 KB Output is correct
16 Correct 114 ms 147436 KB Output is correct
17 Correct 88 ms 146300 KB Output is correct
18 Correct 104 ms 146624 KB Output is correct
19 Correct 129 ms 146952 KB Output is correct
20 Correct 164 ms 147408 KB Output is correct
21 Correct 90 ms 146352 KB Output is correct
22 Correct 92 ms 146656 KB Output is correct
23 Correct 114 ms 146948 KB Output is correct
24 Correct 150 ms 147308 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5054 ms 165228 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 145900 KB Output is correct
2 Correct 70 ms 145984 KB Output is correct
3 Correct 66 ms 146032 KB Output is correct
4 Correct 70 ms 145980 KB Output is correct
5 Correct 68 ms 145856 KB Output is correct
6 Correct 70 ms 145976 KB Output is correct
7 Correct 70 ms 145996 KB Output is correct
8 Correct 75 ms 146044 KB Output is correct
9 Correct 68 ms 145920 KB Output is correct
10 Correct 83 ms 146024 KB Output is correct
11 Correct 73 ms 146044 KB Output is correct
12 Correct 82 ms 145980 KB Output is correct
13 Correct 73 ms 146268 KB Output is correct
14 Correct 83 ms 146736 KB Output is correct
15 Correct 109 ms 147148 KB Output is correct
16 Correct 114 ms 147436 KB Output is correct
17 Correct 88 ms 146300 KB Output is correct
18 Correct 104 ms 146624 KB Output is correct
19 Correct 129 ms 146952 KB Output is correct
20 Correct 164 ms 147408 KB Output is correct
21 Correct 90 ms 146352 KB Output is correct
22 Correct 92 ms 146656 KB Output is correct
23 Correct 114 ms 146948 KB Output is correct
24 Correct 150 ms 147308 KB Output is correct
25 Execution timed out 5054 ms 165228 KB Time limit exceeded
26 Halted 0 ms 0 KB -