Submission #491640

#	Time	Username	Problem	Language	Result	Execution time	Memory
491640		Jomnoi	Experimental Charges (NOI19_charges)	C++17	100 / 100	27 ms	2512 KiB

charges

#include <bits/stdc++.h>
#define DEBUG 0
using namespace std;
using pii = pair <int, int>;

const int N = 1e5 + 10;

int parent[2 * N];

int root(int u) {
    if(u == parent[u]) {
        return u;
    }
    return parent[u] = root(parent[u]);
}

void Union(int u, int v) {
    parent[root(u)] = root(v);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, q;
    cin >> n >> q;
    for(int i = 1; i <= 2 * n; i++) {
        parent[i] = i;
    }
    while(q--) {
        char t;
        int a, b;
        cin >> t >> a >> b;
        if(t == 'R') {
            Union(a, b);
            Union(a + n, b + n);
        }
        else if(t == 'A') {
            Union(a, b + n);
            Union(a + n, b);
        }
        else {
            if(root(a) == root(b) && root(a) == root(b + n)) {
                cout << "?\n";
            }
            else if(root(a) == root(b + n)) {
                cout << "A\n";
            }
            else if(root(a) == root(b)) {
                cout << "R\n";
            }
            else {
                cout << "?\n";
            }
        }

        if(DEBUG) {
            for(int i = 1; i <= 2 * n; i++) {
                cout << i << " " << root(i) << endl;
            }
        }
    }
    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 14 / 14
• Subtask 4: 12 / 12
• Subtask 5: 25 / 25
• Subtask 6: 31 / 31