제출 #941171

#제출 시각아이디문제언어결과실행 시간메모리
941171LucaIlieInside information (BOI21_servers)C++17
2.50 / 100
285 ms524288 KiB
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1.2e5;
bitset<MAX_N + 1> d[MAX_N + 1];

int main() {
    int n, q;

    cin >> n >> q;
    for ( int i = 1; i <= n; i++ )
        d[i][i] = true;
    q += n - 1;
    while ( q-- ) {
        char t;

        cin >> t;
        if ( t == 'S' ) {
            int a, b;
            cin >> a >> b;
            d[a] |= d[b];
            d[b] |= d[a];
        } else if ( t == 'Q' ) {
            int a, b;
            cin >> a >> b;
            cout << (d[a][b] ? "yes" : "no") << "\n";
        } else if ( t == 'C' ) {
            int a;
            cin >> a;
            cout << 0 << "\n";
        }
    }

    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...