제출 #963967

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
963967		Pring	Inside information (BOI21_servers)	C++17	2.50 / 100	1886 ms	378544 KiB

servers

#include <bits/stdc++.h>
#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("avx2","popcnt","sse4","abm")
using namespace std;

#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
using ll = long long;
typedef pair<int, int> pii;
typedef array<int, 4> p4i;

const int MXN = 4005;
int n, q;
set<int> S[MXN];

void miku() {
    cin >> n >> q;
    FOR(i, 1, n + 1) S[i].insert(i);
    FOR(i, 0, n + q - 1) {
        char c;
        int a, b;
        cin >> c;
        if (c == 'S') {
            cin >> a >> b;
            vector<int> v;
            for (auto i : S[a]) v.push_back(i);
            for (auto i : S[b]) v.push_back(i);
            for (auto &i : v) {
                S[a].insert(i);
                S[b].insert(i);
            }
        } else if (c == 'Q') {
            cin >> a >> b;
            cout << (S[a].find(b) == S[a].end() ? "no" : "yes") << '\n';
        } else {
            cin >> a;
            cout << 0 << '\n';
        }
    }
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    miku();
    return 0;
}

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