oj.uz

Submission #653972

# Submission time Handle Problem Language Result Execution time Memory
653972 2022-10-29T05:54:53 Z true22 Experimental Charges (NOI19_charges) C++14
100 / 100
 30 ms 2772 KB 
#include <bits/stdc++.h>
using namespace std;

// short forms // 
#define nl "\n"
#define pb push_back
#define f first
#define s second
#define ll long long int
#define ld long double
#define mp make_pair

#define all(x) x.begin(), x.end()

// debug // 
#define pv(x) for(auto k : x){cout << k << " ";} cout << nl;
#define pp(x) cout << x.f << " " << x.s << nl;
#define bv(x) if (x) cout << "true"; else cout << "false";
#define gp(x, y) x << " " << y 

// loop //
#define FOR(i, a, b) for(ll i = a; i <=b; i++)

// pair // 
typedef pair<ll, ll> pl;

// vector // 
typedef vector<ll> vl;
typedef vector<vl> vvl;    
typedef vector<pl> vp;

// constants // 
const ll INF = 1e17; 
const ll mod = 1e9 + 7;
const ll S = 1e5 + 5;

ll n, siz[S], link[S], eof[S];

ll find(ll a){
    while(a != link[a]) a= link[a];
    return a;
}

ll unite(ll a, ll b){ // returns the rep of the bigger set
    a = find(a);
    b = find(b);
    if (a == b) return a;
    if (siz[a] < siz[b]) swap(a, b);
    siz[a] += siz[b];
    link[b] = a;
    return a;
}

void solve(){

    FOR(i, 0, S-1){
        link[i] = i;
        siz[i] = 1;
        eof[i] = -1;
    }    
    
    ll q;
    cin >> n >> q;
    while(q--){
        char t;
        ll a, b;
        cin >> t;
        cin >> a >> b;
        if (t == 'A'){
            // set enemies
            ll set1, set2;
            set1 = find(a);
            set2 = find(b);
            if (eof[set1] == -1)
                eof[set1] = b;
            else
                unite(eof[set1], b);

            if (eof[set2] == -1)
                eof[set2] = a;
            else
                unite(eof[set2], a);
        }
        else if (t == 'R'){
            // set friends
            a = find(a);
            b = find(b);
            ll biggerset = unite(a, b);
            if (eof[a] != -1 && eof[b] != -1)
                unite(eof[a], eof[b]);
            ll otherset;
            if (biggerset == a)
                otherset = b;
            else
                otherset = a;
            if (eof[biggerset] == -1)
                eof[biggerset] = eof[otherset];
        }
        else{
            // query
            a = find(a);
            b = find(b);
            if (a == b)
                cout << 'R' << nl;
            else if (eof[a] != -1 && (find(eof[a]) == find(b)))
                cout << 'A' << nl;
            else
                cout << '?' << nl;
        }
    }
}

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

    ll t = 1;
    //cin >> t;
    while(t--){
        
        solve();
    }
    
    return 0;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2676 KB Output is correct
2 Correct 19 ms 2764 KB Output is correct
3 Correct 20 ms 2772 KB Output is correct
4 Correct 24 ms 2720 KB Output is correct
5 Correct 30 ms 2736 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 2684 KB Output is correct
2 Correct 23 ms 2732 KB Output is correct
3 Correct 23 ms 2772 KB Output is correct
4 Correct 27 ms 2644 KB Output is correct
5 Correct 30 ms 2740 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2752 KB Output is correct
2 Correct 29 ms 2712 KB Output is correct
3 Correct 23 ms 2644 KB Output is correct
4 Correct 28 ms 2644 KB Output is correct
5 Correct 23 ms 2692 KB Output is correct

Subtask #5
25.0 / 25.0

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

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 18 ms 2676 KB Output is correct
7 Correct 19 ms 2764 KB Output is correct
8 Correct 20 ms 2772 KB Output is correct
9 Correct 24 ms 2720 KB Output is correct
10 Correct 30 ms 2736 KB Output is correct
11 Correct 25 ms 2684 KB Output is correct
12 Correct 23 ms 2732 KB Output is correct
13 Correct 23 ms 2772 KB Output is correct
14 Correct 27 ms 2644 KB Output is correct
15 Correct 30 ms 2740 KB Output is correct
16 Correct 22 ms 2752 KB Output is correct
17 Correct 29 ms 2712 KB Output is correct
18 Correct 23 ms 2644 KB Output is correct
19 Correct 28 ms 2644 KB Output is correct
20 Correct 23 ms 2692 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 22 ms 2748 KB Output is correct
27 Correct 30 ms 2680 KB Output is correct
28 Correct 24 ms 2692 KB Output is correct
29 Correct 21 ms 2644 KB Output is correct
30 Correct 26 ms 2772 KB Output is correct