oj.uz

Submission #242035

# Submission time Handle Problem Language Result Execution time Memory
242035 2020-06-26T15:48:10 Z AmineWeslati Experimental Charges (NOI19_charges) C++14
100 / 100
 73 ms 9848 KB 
//Never stop trying
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0}; //right left down up

const int MX=1e5+10;
int N,Q;

vi adj[MX];
int t[MX];
vi p(MX),szz(MX),rnk(MX);
unordered_set<int> vis;

void dfs(int u){
   vis.insert(u);
   t[u]=1-t[u];
   for(auto x: adj[u]) if(vis.count(x)==0) dfs(x);
}

int findSet(int u){
   if(p[u]==u) return u;
   return p[u]=findSet(p[u]);
}

void unionSet(int u, int v){
   int a=findSet(u),b=findSet(v);
   if(a==b) return;
   if(rnk[b]>rnk[a]) swap(a,b);
   p[b]=a;
   if(rnk[a]==rnk[b]) rnk[a]++;
   szz[a]+=szz[b];
}

int32_t main(){
   boost;
   cin>>N>>Q;

   for(int i=0; i<N; i++){
      t[i]=-1;
      p[i]=i; szz[i]=1; rnk[i]=0;
   }

   while(Q--){
      char c; int i, j; cin>>c>>i>>j; i--;j--;
      if(c=='Q'){
         if(findSet(i)!=findSet(j)) cout <<'?' << endl;
         else if(t[i]==t[j]) cout <<'R' << endl;
         else cout << 'A' << endl;
      }
      else{
         if(t[i]==-1 && t[j]==-1){
            if(c=='A'){
               t[j]=1; t[i]=0;
            }
            else t[i]=t[j]=1;
         }
         else if(t[i]==-1){
            if(c=='A')t[i]=1-t[j];
            else t[i]=t[j];
         }
         else if(t[j]==-1){
            if(c=='A')t[j]=1-t[i];
            else t[j]=t[i];
         }
         else if(findSet(i)!=findSet(j) && ((c=='A' && t[i]==t[j])||(c=='R' && t[i]!=t[j]))){
            vis.clear();
            if(szz[findSet(i)]>szz[findSet(j)])
               dfs(j);
            else dfs(i);
         }
         if(findSet(i)!=findSet(j)) {adj[i].pb(j); adj[j].pb(i);}
         unionSet(i,j);
      }
   }

   return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 7920 KB Output is correct
2 Correct 42 ms 9072 KB Output is correct
3 Correct 37 ms 8308 KB Output is correct
4 Correct 48 ms 8968 KB Output is correct
5 Correct 43 ms 9072 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 7416 KB Output is correct
2 Correct 47 ms 8696 KB Output is correct
3 Correct 52 ms 8952 KB Output is correct
4 Correct 64 ms 9848 KB Output is correct
5 Correct 61 ms 9464 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 7416 KB Output is correct
2 Correct 45 ms 8696 KB Output is correct
3 Correct 63 ms 9464 KB Output is correct
4 Correct 73 ms 9720 KB Output is correct
5 Correct 72 ms 9720 KB Output is correct

Subtask #5
25.0 / 25.0

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

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 40 ms 7920 KB Output is correct
7 Correct 42 ms 9072 KB Output is correct
8 Correct 37 ms 8308 KB Output is correct
9 Correct 48 ms 8968 KB Output is correct
10 Correct 43 ms 9072 KB Output is correct
11 Correct 40 ms 7416 KB Output is correct
12 Correct 47 ms 8696 KB Output is correct
13 Correct 52 ms 8952 KB Output is correct
14 Correct 64 ms 9848 KB Output is correct
15 Correct 61 ms 9464 KB Output is correct
16 Correct 40 ms 7416 KB Output is correct
17 Correct 45 ms 8696 KB Output is correct
18 Correct 63 ms 9464 KB Output is correct
19 Correct 73 ms 9720 KB Output is correct
20 Correct 72 ms 9720 KB Output is correct
21 Correct 7 ms 5120 KB Output is correct
22 Correct 8 ms 5120 KB Output is correct
23 Correct 8 ms 5120 KB Output is correct
24 Correct 8 ms 5248 KB Output is correct
25 Correct 8 ms 5248 KB Output is correct
26 Correct 41 ms 8696 KB Output is correct
27 Correct 45 ms 8696 KB Output is correct
28 Correct 70 ms 9592 KB Output is correct
29 Correct 64 ms 9464 KB Output is correct
30 Correct 65 ms 9592 KB Output is correct