Submission #531928

#TimeUsernameProblemLanguageResultExecution timeMemory
5319284fectaInside information (BOI21_servers)C++17
2.50 / 100
224 ms524292 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)

const int MN = 120001;

int n, q, u, v;
bitset<MN> b[MN];
char c;

int32_t main() {
    boost();

    cin >> n >> q;
    for (int i = 1; i <= n; i++) b[i][i] = 1;
    for (int i = 1; i < n + q; i++) {
        cin >> c >> u;
        if (c != 'C') cin >> v;
        if (c == 'S') {

            b[u] |= b[v];
            b[v] |= b[u];
        } else if (c == 'Q') {

            if (b[u][v]) printf("yes\n");
            else printf("no\n");
        } else {
        }
    }

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...