oj.uz

답안 #653962

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
653962 2022-10-29T05:05:57 Z true22 Experimental Charges (NOI19_charges) C++14
32 / 100
 24 ms 2780 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){
    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;
}

ll unite(ll a, ll b){ // returns the rep of the bigger set
    if (a == -1)
        return b;
    else if (b == -1)
        return a;
    a = find(a);
    b = find(b);
    if (a == b) return a;
    // union by size
    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
            a = find(a);
            b = find(b);
            if (a == b) continue;
            eof[a] = b;
            eof[b] = a;
            if (eof[a] != -1)
                unite(eof[a], b);
            if (eof[b] != -1)
                unite(eof[b], a);

        }
        else if (t == 'R'){
            a = find(a);
            b = find(b);
            if (eof[a] == b) continue;

            ll ae, be;
            ae = eof[a];
            be = eof[b];

            ae = unite(ae, be);
            a = unite(a, b);
            eof[a] = ae;
            if (ae != -1)
                eof[ae] = a;
            
        }
        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.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 2680 KB Output is correct
2 Correct 20 ms 2772 KB Output is correct
3 Correct 19 ms 2780 KB Output is correct
4 Correct 21 ms 2728 KB Output is correct
5 Correct 23 ms 2720 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 2772 KB Output is correct
2 Correct 22 ms 2716 KB Output is correct
3 Correct 24 ms 2772 KB Output is correct
4 Correct 23 ms 2680 KB Output is correct
5 Correct 24 ms 2748 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 2772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Incorrect 2 ms 2644 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 20 ms 2680 KB Output is correct
7 Correct 20 ms 2772 KB Output is correct
8 Correct 19 ms 2780 KB Output is correct
9 Correct 21 ms 2728 KB Output is correct
10 Correct 23 ms 2720 KB Output is correct
11 Correct 22 ms 2772 KB Output is correct
12 Correct 22 ms 2716 KB Output is correct
13 Correct 24 ms 2772 KB Output is correct
14 Correct 23 ms 2680 KB Output is correct
15 Correct 24 ms 2748 KB Output is correct
16 Incorrect 21 ms 2772 KB Output isn't correct
17 Halted 0 ms 0 KB -