Submission #653878

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
653878	2022-10-28T17:23:58 Z	true22	Experimental Charges (NOI19_charges)	C++14	14 / 100	27 ms	2900 KB

charges

#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){
    ll st = a;
    while(a != link[a]) a = link[a];
    //path compression
    while(st != link[st]){
        ll tmp = link[st];
        link[st] = a;
        st = tmp;
    }
    return a;
}

bool unite(ll a, ll b){
    a = find(a);
    b = find(b);
    if (a == b) return 0;
    // union by size
    if (siz[a] < siz[b]) swap(a, b);
    siz[a] += siz[b];
    link[b] = a;
    return 1;
}

void set_same(ll a, ll b){ 
    /*
        1) unite the friends
        2) unite the enemies of the friends
        3) copy the link
    */
    a = find(a);
    b = find(b);
    if (siz[a] < siz[b]) swap(a, b);
    unite(a, b);
    if (eof[a] != -1 && eof[b] != -1)
        unite(eof[a], eof[b]);
    if (eof[a] == -1)
        eof[a] = eof[b];
}

void set_op(ll a, ll b){
    /*
        this is symmetric
        the enemy of c1 is united with rep of c1 and vice versa
    */
    a = find(a);
    b = find(b);
    if (eof[a] == -1)
        eof[a] = b;
    else
        unite(eof[a], b);
    if (eof[b] == -1)
        eof[b] = eof[a];
    else
        unite(eof[b], a);
}

bool same(ll a, ll b){
    return (find(a) == find(b));
}

bool attract(ll a, ll b){
    if (eof[a] == -1)
        return 0;
    return same(eof[a], b);
}


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_op(a, b);
        }
        else if (t == 'R'){
            set_same(a, b);
        }
        else{
            if (same(a, b)){
                cout << "R" << nl;
                continue;
            }
            a = find(a);
            b = find(b);
            if (eof[a] == -1 || eof[b] == -1){
                cout << "?" << nl;
            }else{
                if (same(eof[a], b)){
                    cout << "A" << nl;
                }
            }

        }
    }
}

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

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

Subtask #1
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2644 KB	Output is correct
2	Incorrect	2 ms	2644 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	21 ms	2860 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	2888 KB	Output is correct
2	Correct	22 ms	2840 KB	Output is correct
3	Correct	23 ms	2900 KB	Output is correct
4	Correct	27 ms	2840 KB	Output is correct
5	Correct	24 ms	2864 KB	Output is correct