Submission #997051

#	Time	Username	Problem	Language	Result	Execution time	Memory
997051		LOLOLO	Experimental Charges (NOI19_charges)	C++17	100 / 100	18 ms	4444 KiB

charges

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 3e5 + 10;
int p[N], sz[N], is[N];

pair <int, int> get(int x) {
    if (p[x] == 0)
        return {0, x};

    auto t = get(p[x]);
    t.f ^= is[x];
    return t;
}

void unite(int a, int b, int t) {
    pair <int, int> A = get(a), B = get(b);
    a = A.s, b = B.s;
    if (a == b)
        return;

    if (sz[a] < sz[b])
        swap(a, b);

    p[b] = a;
    sz[a] += sz[b];
    is[b] = A.f ^ B.f ^ t;
}

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

    int n, q;
    cin >> n >> q;

    for (int i = 1; i <= n; i++)
        sz[i] = 1;

    for (int i = 1; i <= q; i++) {
        char type;
        cin >> type;

        if (type == 'A') {
            int a, b;
            cin >> a >> b;
            unite(a, b, 1);
        }

        if (type == 'R') {
            int a, b;
            cin >> a >> b;
            unite(a, b, 0);
        }

        if (type == 'Q') {
            int a, b;
            cin >> a >> b;
            pair <int, int> A = get(a), B = get(b);
            if (A.s != B.s) {
                cout << "?";
            } else {
                if (A.f == B.f) { 
                    cout << "R";
                } else {
                    cout << "A";
                }
            }

            cout << '\n';
        }
    }

    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