oj.uz

Submission #696304

# Submission time Handle Problem Language Result Execution time Memory
696304 2023-02-06T07:54:13 Z Dan4Life Inside information (BOI21_servers) C++17
0 / 100
 26 ms 692 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxN = (int)130000;

int n, k, p[mxN], tim[mxN], sz[mxN];

int findSet(int i){ return i==p[i]?i:p[i]=findSet(p[i]); }
bool isSameSet(int i, int j) { return findSet(i)==findSet(j); }
void unionSet(int i, int j){
    int x = findSet(i);
    int y = findSet(j);
    if(x==y) return;
    if(sz[x]<sz[y]) swap(x,y);
    p[y]=x; sz[x]+=sz[y];
}

int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> k;
    for(int i = 1; i <= n; i++) p[i] = i, sz[i] = 1;
    for(int _ = 0; _ < n+k-1; _++){
        char t; int x, y;
        cin >> t >> x;
        if(t=='S'){
            cin >> y;
            tim[x]=tim[y]=_;
            unionSet(x,y);
        }
        else if(t=='Q'){
            cin >> y;
            if(isSameSet(x,y) and tim[x]>=tim[y]) cout << "yes";
            else cout << "no";
        }
        else{
            cout << sz[findSet(x)];
        }
        if(t!='S') cout << "\n";
    }
}

Subtask #1
0 / 2.5

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

Subtask #2
0 / 2.5

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

Subtask #3
0 / 2.5

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

Subtask #4
0 / 2.5

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 5.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 12.5

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

Subtask #10
0 / 12.5

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

Subtask #11
0 / 17.5

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

Subtask #12
0 / 17.5

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