oj.uz

Submission #647499

# Submission time Handle Problem Language Result Execution time Memory
647499 2022-10-03T01:42:29 Z LeonaRaging Experimental Charges (NOI19_charges) C++14
100 / 100
 49 ms 8436 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define ll long long
#define pb push_back
#define db(val) "[" #val " = " << (val) << "] "

const ll mod = 1e9 + 7;
const int maxn = 1e5 + 4;
const int INF = 1e9;

int n, q, sign[maxn];

struct DisjointSet {
    int par[maxn];
    vector<int> mySet[maxn];
    DisjointSet(int n) {
        for (int i = 1; i <= n; i++)
            par[i] = i, mySet[i].pb(i);
    }
    int find(int x) {
        if (x != par[x]) par[x] = find(par[x]);
        return par[x];
    }
    bool join(int u, int v, int type) {
        int flag = sign[u] == sign[v];
        u = find(u); v = find(v);
        if (u == v) return 0;
        if (mySet[v].size() > mySet[u].size()) 
            swap(mySet[u], mySet[v]);
        for (int x : mySet[v]) {
            if (type == flag) sign[x] ^= 1;
            mySet[u].pb(x);
        }
        mySet[v].clear();
        par[v] = u;
        return 1;
    }
};

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen(".INP", "r", stdin);
    //freopen(".OUT", "w", stdout);
    cin >> n >> q;
    memset(sign, 1, sizeof sign);
    DisjointSet Dsu(n);
    for (int i = 1; i <= q; i++) {
        char type; int u, v; cin >> type >> u >> v;
        if (type == 'Q') {
            if (Dsu.find(u) != Dsu.find(v)) cout << '?';
            else cout << (sign[u] == sign[v] ? 'R' : 'A');
            cout << '\n';
        }
        else Dsu.join(u, v, (type == 'R' ? 0 : 1));
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3412 KB Output is correct
2 Correct 2 ms 3380 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3392 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 6836 KB Output is correct
2 Correct 28 ms 6720 KB Output is correct
3 Correct 32 ms 6748 KB Output is correct
4 Correct 32 ms 6804 KB Output is correct
5 Correct 29 ms 6784 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 6992 KB Output is correct
2 Correct 37 ms 6872 KB Output is correct
3 Correct 40 ms 6872 KB Output is correct
4 Correct 49 ms 7084 KB Output is correct
5 Correct 42 ms 7128 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 6768 KB Output is correct
2 Correct 34 ms 8188 KB Output is correct
3 Correct 44 ms 8004 KB Output is correct
4 Correct 46 ms 8436 KB Output is correct
5 Correct 44 ms 8380 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3412 KB Output is correct
2 Correct 2 ms 3380 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3392 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 3 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 3 ms 3456 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3412 KB Output is correct
2 Correct 2 ms 3380 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3392 KB Output is correct
6 Correct 34 ms 6836 KB Output is correct
7 Correct 28 ms 6720 KB Output is correct
8 Correct 32 ms 6748 KB Output is correct
9 Correct 32 ms 6804 KB Output is correct
10 Correct 29 ms 6784 KB Output is correct
11 Correct 28 ms 6992 KB Output is correct
12 Correct 37 ms 6872 KB Output is correct
13 Correct 40 ms 6872 KB Output is correct
14 Correct 49 ms 7084 KB Output is correct
15 Correct 42 ms 7128 KB Output is correct
16 Correct 24 ms 6768 KB Output is correct
17 Correct 34 ms 8188 KB Output is correct
18 Correct 44 ms 8004 KB Output is correct
19 Correct 46 ms 8436 KB Output is correct
20 Correct 44 ms 8380 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct
22 Correct 3 ms 3412 KB Output is correct
23 Correct 2 ms 3412 KB Output is correct
24 Correct 2 ms 3412 KB Output is correct
25 Correct 3 ms 3456 KB Output is correct
26 Correct 27 ms 8180 KB Output is correct
27 Correct 45 ms 8080 KB Output is correct
28 Correct 47 ms 8136 KB Output is correct
29 Correct 46 ms 8180 KB Output is correct
30 Correct 47 ms 8184 KB Output is correct