Submission #653967

#	Time	Username	Problem	Language	Result	Execution time	Memory
653967		true22	Experimental Charges (NOI19_charges)	C++14	32 / 100	27 ms	2860 KiB

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){
    return (a == link[a] ? a : link[a] = find(link[a]));
}

bool unite(ll a, ll b){ // returns the rep of the bigger set

    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 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
            a = find(a);
            b = find(b);
            if (a == b) continue;
            
            if (eof[a] != -1)
                unite(eof[a], b);
            else
                eof[a] = b;

            if (eof[b] != -1)
                unite(eof[b], a);
            else
                eof[b] = a;
        }
        else if (t == 'R'){
            // set friends
            a = find(a);
            b = find(b);
            if (eof[a] == b) 
                continue;
            if (siz[a] < siz[b]) swap(a, b);
            unite(a, b);
            // unite the friends

            // unite the enemies
            if (eof[a] != -1 && eof[b] != -1)
                unite(eof[a], eof[b]);

            if (eof[a] == -1)
                eof[a] = eof[b];
        }
        else{
            // query
            a = find(a);
            b = find(b);
            if (a == b)
                cout << 'R' << nl;
            else if (eof[a] == b || eof[b] == a)
                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 / 7
• Subtask 2: 11 / 11
• Subtask 3: 14 / 14
• Subtask 4: 0 / 12
• Subtask 5: 0 / 25
• Subtask 6: 0 / 31