oj.uz

Submission #1039609

# Submission time Handle Problem Language Result Execution time Memory
1039609 2024-07-31T05:32:45 Z Plurm Inside information (BOI21_servers) C++11
2.5 / 100
 246 ms 56320 KB 
#include <bits/stdc++.h>
using namespace std;

vector<int> g[500005];
vector<int> rg[500005];
int cnt[500005];
int primpar[500005];
int par[500005][20];
int st[500005];
int ed[500005];
int dep[500005];
int t;
void dfs(int u, int p = 0){
    par[u][0] = p;
    dep[u] = dep[p] + 1;
    st[u] = ++t;
    for(int i = 1; i < 20; i++) par[u][i] = par[par[u][i-1]][i-1];
    for(int v : rg[u]){
        dfs(v, u);
    }
    ed[u] = t;
}
int FT[500005];
void add(int idx, int amt){
    while(idx < 500005){
        FT[idx] += amt;
        idx += idx & -idx;
    }
}
int sum(int idx){
    int ret = 0;
    while(idx > 0){
        ret += FT[idx];
        idx -= idx & -idx;
    }
    return ret;
}
int lca(int u, int v){
    if(dep[u] > dep[v]) swap(u, v);
    for(int i = 19; i >= 0; i--){
        if(dep[u] <= dep[par[v][i]]) v = par[v][i];
    }
    if(u == v) return u;
    for(int i = 19; i >= 0; i--){
        if(par[u][i] != par[v][i]){
            u = par[u][i];
            v = par[v][i];
        }
    }
    return par[u][0];
}
bool search(int a, int d){
    return lca(a, primpar[d]) == primpar[d];
}
int count(int d){
    return sum(ed[primpar[d]]) - sum(st[primpar[d]]-1);
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    k += n-1;
    vector<tuple<int,int,int>> cmds;
    vector<int> ids(n+1);
    for(int i = 1; i <= n; i++){
        ids[i] = i;
    }
    int last = n;
    for(int i = 0; i < k; i++){
        string cmd;
        cin >> cmd;
        int a, b, d;
        switch(cmd[0]){
            case 'S':
                cin >> a >> b;
                last++;
                if(ids[a] != a){
                    g[last].push_back(ids[a]);
                    rg[ids[a]].push_back(last);
                }else{
                    primpar[a] = last;
                }
                if(ids[b] != b){
                    g[last].push_back(ids[b]);
                    rg[ids[b]].push_back(last);
                }else{
                    primpar[b] = last;
                }
                ids[a] = ids[b] = last;
                cmds.push_back({0, a, b});
                break;
            case 'Q':
                cin >> a >> d;
                cmds.push_back({1, a, d});
                break;
            case 'C':
                cin >> d;
                cmds.push_back({2, d, 0});
                break;
        }
    }
    for(int i = n+1; i <= last; i++){
        if(st[i] == 0) dfs(i);
    }
    for(int i = 1; i <= n; i++){
        ids[i] = i;
        cnt[i]++;
    }
    last = n;
    for(int i = 0; i < k; i++){
        int a, b, d;
        switch(get<0>(cmds[i])){
            case 0:
                a = get<1>(cmds[i]);
                b = get<2>(cmds[i]);
                cnt[ids[a]]--;
                if(a != ids[a])
                    add(st[ids[a]], -1);
                cnt[ids[b]]--;
                if(b != ids[b])
                    add(st[ids[b]], -1);
                last++;
                ids[a] = ids[b] = last;
                cnt[last] += 2;
                add(st[last], 2);
                break;
            case 1:
                a = get<1>(cmds[i]);
                d = get<2>(cmds[i]);
                bool b;
                if(ids[a] <= n) b = a == d;
                else b = search(ids[a], d);
                if(b) cout << "yes" << endl;
                else cout << "no" << endl;
                break;
            case 2:
                d = get<1>(cmds[i]);
                cout << count(d) << endl;
                break;
        }
    }
    return 0;
}

Subtask #1
0 / 2.5

# Verdict Execution time Memory Grader output
1 Incorrect 148 ms 26812 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.5

# Verdict Execution time Memory Grader output
1 Incorrect 148 ms 26812 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 142 ms 26744 KB Output is correct
2 Correct 246 ms 56320 KB Output is correct
3 Correct 218 ms 56172 KB Output is correct

Subtask #4
0 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 142 ms 26744 KB Output is correct
2 Correct 246 ms 56320 KB Output is correct
3 Correct 218 ms 56172 KB Output is correct
4 Incorrect 142 ms 26824 KB Extra information in the output file
5 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 144 ms 26812 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 144 ms 26812 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 152 ms 26568 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 152 ms 26568 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.5

# Verdict Execution time Memory Grader output
1 Incorrect 145 ms 26816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.5

# Verdict Execution time Memory Grader output
1 Incorrect 145 ms 26816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 17.5

# Verdict Execution time Memory Grader output
1 Incorrect 146 ms 26824 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 17.5

# Verdict Execution time Memory Grader output
1 Incorrect 146 ms 26824 KB Output isn't correct
2 Halted 0 ms 0 KB -