oj.uz

Submission #997051

# Submission time Handle Problem Language Result Execution time Memory
997051 2024-06-11T16:21:40 Z LOLOLO Experimental Charges (NOI19_charges) C++17
100 / 100
 18 ms 4444 KB 
#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.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3968 KB Output is correct
2 Correct 12 ms 3932 KB Output is correct
3 Correct 14 ms 3932 KB Output is correct
4 Correct 13 ms 3984 KB Output is correct
5 Correct 13 ms 3928 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 4188 KB Output is correct
2 Correct 16 ms 4444 KB Output is correct
3 Correct 15 ms 4444 KB Output is correct
4 Correct 16 ms 4436 KB Output is correct
5 Correct 17 ms 4280 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 4416 KB Output is correct
2 Correct 17 ms 4444 KB Output is correct
3 Correct 17 ms 4360 KB Output is correct
4 Correct 17 ms 4432 KB Output is correct
5 Correct 15 ms 4184 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 13 ms 3968 KB Output is correct
7 Correct 12 ms 3932 KB Output is correct
8 Correct 14 ms 3932 KB Output is correct
9 Correct 13 ms 3984 KB Output is correct
10 Correct 13 ms 3928 KB Output is correct
11 Correct 15 ms 4188 KB Output is correct
12 Correct 16 ms 4444 KB Output is correct
13 Correct 15 ms 4444 KB Output is correct
14 Correct 16 ms 4436 KB Output is correct
15 Correct 17 ms 4280 KB Output is correct
16 Correct 18 ms 4416 KB Output is correct
17 Correct 17 ms 4444 KB Output is correct
18 Correct 17 ms 4360 KB Output is correct
19 Correct 17 ms 4432 KB Output is correct
20 Correct 15 ms 4184 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 18 ms 4188 KB Output is correct
27 Correct 15 ms 4444 KB Output is correct
28 Correct 15 ms 4188 KB Output is correct
29 Correct 15 ms 4184 KB Output is correct
30 Correct 16 ms 4184 KB Output is correct