제출 #1224521

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1224521		SpyrosAliv	Inside information (BOI21_servers)	C++20	5 / 100	748 ms	589824 KiB

servers

#include <bits/stdc++.h>
using namespace std;

const int MN = 120005;
const int MQ = 120005;
vector<set<int>> sets(MN);
vector<int> aps(MN, 1);
int n, q;

void merge(int u, int v) {
    if (sets[u].size() < sets[v].size()) swap(u, v);
    for (auto x: sets[v]) {
        sets[u].insert(x);
    }
    sets[v] = sets[u];
    for (auto x: sets[v]) aps[x]++;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        sets[i].insert(i);
    }
    for (int qq = 1; qq <= n + q - 1; qq++) {
        char s; cin >> s;
        if (s == 'S') {
            int a, b; cin >> a >> b;
            merge(a, b);
        }
        else if (s == 'Q') {
            int a, b; cin >> a >> b;
            if (sets[a].find(b) != sets[a].end()) cout << "yes\n";
            else cout << "no\n";
        }
        else if (s == 'C') {
            int u; cin >> u;
            cout << aps[u] << "\n";
        }
    }
}

• Subtask 1-1: 2 / 2
• Subtask 1-2: 3 / 3
• Subtask 2-1: 0 / 2
• Subtask 2-2: 0 / 3
• Subtask 3-1: 0 / 5
• Subtask 3-2: 0 / 5
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 12
• Subtask 5-2: 0 / 13
• Subtask 6-1: 0 / 17
• Subtask 6-2: 0 / 18