Submission #696305

#	Time	Username	Problem	Language	Result	Execution time	Memory
696305		Dan4Life	Inside information (BOI21_servers)	C++17	0 / 100	32 ms	700 KiB

servers

#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
• Subtask 2: 0 / 2.5
• Subtask 3: 0 / 2.5
• Subtask 4: 0 / 2.5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 12.5
• Subtask 10: 0 / 12.5
• Subtask 11: 0 / 17.5
• Subtask 12: 0 / 17.5