제출 #528999

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

servers

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

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, k; cin >> n >> k;
    int cnt[n+1] = {};
    vi data[n+1];
    rep (i,1,n) {
        data[i].pb(i);
        ++cnt[i];
    }

    rep (q,1,n+k-1) {
        char tp; cin >> tp;
        if (tp=='S') {
            int a, b; cin >> a >> b;
            int x = data[b].size();
            for (int el : data[a]) {
                data[b].pb(el);
                ++cnt[el];
            }
            rep (i,0,x-1) {
                data[a].pb(data[b][i]);
                ++cnt[data[b][i]];
            }
        }
        else if (tp=='Q') {
            int a, d; cin >> a >> d;
            if (find(all(data[a]), d)!=data[a].end()) {
                cout << "yes\n";
            }
            else {
                cout << "no\n";
            }
        }
        else {
            int d; cin >> d;
            cout << cnt[d] << "\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