제출 #970940

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
970940		kl0989e	Inside information (BOI21_servers)	C++17	5 / 100	1036 ms	524288 KiB

servers

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

#define ll long long
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define all(x) (x).begin(),(x).end()

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,k;
    cin >> n >> k;
    vector<unordered_set<int>> servers(n);
    vi count(n,1);
    for (int i=0; i<n; i++) {
        servers[i].insert(i);
    }
    char c;
    int a,b;
    for (int i=0; i<k+n-1; i++) {
        cin >> c;
        if (c=='S') {//S a b means servers 𝑎 and 𝑏 Share all their data.
            cin >> a >> b;
            a--;
            b--;
            if (servers[a].size()<servers[b].size()) {
                swap(a,b);
            }
            servers[a].merge(servers[b]);
            servers[b]=servers[a];
            for (auto aa:servers[a]) {
                count[aa]++;
            }
        }
        else if (c=='Q') {//Q a d means you Query whether server 𝑎 currently stores data chunk 𝑑.
            cin >> a >> b;
            a--;
            b--;
            if (servers[a].count(b)) {
                cout << "yes\n";
            }
            else {
                cout << "no\n";
            }
        }
        else {//C d means you query the Count (number) of servers that currently store data chunk 𝑑.
            cin >> a;
            a--;
            cout << count[a] << '\n';
        }
    }
    return 0;
}

• Subtask 1: 2.5 / 2.5
• Subtask 2: 2.5 / 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