oj.uz

Submission #487550

# Submission time Handle Problem Language Result Execution time Memory
487550 2021-11-16T06:21:13 Z sudheerays123 Experimental Charges (NOI19_charges) C++
32 / 100
 46 ms 11140 KB 
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
#define tc ll test;cin >> test;while(test--)
#define vi vector<ll>
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define INF 1e18
#define MOD 1000000007
#define ff first
#define ss second
#define in >>
#define out <<
#define space << " " <<
#define spacef << " "
#define fo(i,a,b) for(ll i = a; i <= b; i++)
#define nextline out "\n"
#define print(x) for(auto i : x ) cout out i spacef
#define mmax(x,i) x = max(x,i)
#define mmin(x,i) x = min(x,i)
#define N 100005

vi parent(N);

void make_set(ll n){
    fo(i,1,n) parent[i] = i;
}

ll find(ll x){
    if(x == parent[x]) return x;
    return parent[x] = find(parent[x]); 
}

void add_edge(ll a , ll b){
    
    a = find(a);
    b = find(b);

    if(a != b) parent[b] = a;
}

vector<bool> visited(N,false);
vi color(N,-1);
vector<pll> adj[N];

void dfs(ll s , ll c){

    if(visited[s]) return;
    
    visited[s] = true;
    color[s] = c;

    for(auto u : adj[s]){
        if(!visited[u.first]){

            if(u.second == 0) dfs(u.first,c);
            else{
                if(c == 1) dfs(u.first,0);
                else dfs(u.first,1);
            }
        }
    }
}

int main() {
    
    fast;

    ll n,m;
    cin in n in m;

    make_set(n);

    vi ans;
    vector<pll> q;
 
    fo(i,1,m){
        char x;
        ll a,b;
        
        cin in x in a in b;

        if(x == 'Q'){
            if(find(a) != find(b)) ans.pb(0);
            else{
                ans.pb(1);
                q.pb(mp(a,b));
            }
        }
        else if(x == 'R'){
            add_edge(a,b);
            adj[a].pb(mp(b,0));
            adj[b].pb(mp(a,0));
        }
        else{
            add_edge(a,b);
            adj[a].pb(mp(b,1));
            adj[b].pb(mp(a,1));
        }
    }

    fo(i,1,n) if(!visited[i]) dfs(1,0);

    ll ind = 0;
    vector<char> answer;

    for(auto u : ans){
        if(u == 0) answer.pb('?');
        if(u == 1){
            ll a = q[ind].first , b = q[ind].second;

            if(find(a) != find(b)) answer.pb('?');
            else if(color[a] == color[b]) answer.pb('R');
            else answer.pb('A');

            ind++;
        }
    }

    for(auto u : answer) cout out u nextline;

    return 0;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 8984 KB Output is correct
2 Correct 28 ms 9204 KB Output is correct
3 Correct 27 ms 8120 KB Output is correct
4 Correct 28 ms 8764 KB Output is correct
5 Correct 36 ms 8884 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 11112 KB Output is correct
2 Correct 31 ms 9008 KB Output is correct
3 Correct 30 ms 8352 KB Output is correct
4 Correct 46 ms 9528 KB Output is correct
5 Correct 35 ms 9100 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 11140 KB Output is correct
2 Correct 33 ms 10548 KB Output is correct
3 Correct 42 ms 9476 KB Output is correct
4 Incorrect 42 ms 9936 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4308 KB Output is correct
2 Correct 2 ms 4176 KB Output is correct
3 Correct 2 ms 4176 KB Output is correct
4 Correct 2 ms 4176 KB Output is correct
5 Correct 2 ms 4176 KB Output is correct
6 Correct 2 ms 4304 KB Output is correct
7 Incorrect 2 ms 4304 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4308 KB Output is correct
2 Correct 2 ms 4176 KB Output is correct
3 Correct 2 ms 4176 KB Output is correct
4 Correct 2 ms 4176 KB Output is correct
5 Correct 2 ms 4176 KB Output is correct
6 Correct 27 ms 8984 KB Output is correct
7 Correct 28 ms 9204 KB Output is correct
8 Correct 27 ms 8120 KB Output is correct
9 Correct 28 ms 8764 KB Output is correct
10 Correct 36 ms 8884 KB Output is correct
11 Correct 31 ms 11112 KB Output is correct
12 Correct 31 ms 9008 KB Output is correct
13 Correct 30 ms 8352 KB Output is correct
14 Correct 46 ms 9528 KB Output is correct
15 Correct 35 ms 9100 KB Output is correct
16 Correct 28 ms 11140 KB Output is correct
17 Correct 33 ms 10548 KB Output is correct
18 Correct 42 ms 9476 KB Output is correct
19 Incorrect 42 ms 9936 KB Output isn't correct
20 Halted 0 ms 0 KB -