oj.uz

Submission #497773

# Submission time Handle Problem Language Result Execution time Memory
497773 2021-12-23T19:05:53 Z avaneeshk098 Experimental Charges (NOI19_charges) C++17
100 / 100
 37 ms 4960 KB 
#include <bits/stdc++.h>
#pragma GCC optimize "trapv"

#define ff              first
#define int 			long long int
#define ss              second
#define pb              push_back
#define mp              make_pair
#define mt              make_tuple
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define max_size        100000000
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define mod             (int)1e9+7
#define w(t)			int t; cin >> t; while(t--)
#define inf             1e18
//#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define range(a,b)      substr(a,b-a+1)
#define mina(a,b,c)		min(a, min(b, c))
#define maxa(a,b,c)		max(a, max(b, c))
#define sz(a)			(int)a.size()	
#define endl 			'\n'
#define trace(x)        cerr<<#x<<": "<<x<<" "<<endl;
#define FIO             ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define FOR(x,y)		for(int i = x; i < y; i++)
#define rrep(a,b,x,y)	for(int x = 0; x < a; x++) for(int y = 0; y < b; y++)
#define rrep1(a,b,x,y)	for(int x = 1; x <= a; x++) for(int y = 0; y <= b; y++)
#define rrepo(a,b,x,y)	for(int x = 0; x < a; x++){ for(int y = 0; y < b; y++)
#define rrepo1(a,b,x,y)	for(int x = 1; x <= a; x++){ for(int y = 0; y <= b; y++)

	
using namespace std;

bool sortbysecond(const pair<int,int> &a, const pair<int,int> &b){ return (a.second < b.second); } 

int64_t ceil_div(int64_t a, int64_t b) {if(a%b != 0){ return ((a/b)+1);} else{ return (a/b);}}

double max(double a, double b){ if(a >= b){ return a; } else{ return b; } }

double min(double a, double b){if(a <= b){return a;} else{return b;	}}

bool modd(double a, double b){if(floor(a/b) == ceil(a/b)){return true;} return false;}

bool stringsort(const string &a, const string &b){return a.length() > b.length();}

bool specsort(const pair<long double,int> &a, const pair<long double,int> &b){ 
	return a.first - a.second > b.first - b.second;  
}

struct ufds{
	vi link, siz;
	int cmp;
	ufds(int n) : link(n), siz(n,1) { iota(link.begin(), link.end(), 0); cmp = n;}
	int find(int x){
		if(x == link[x]) return x;
		return link[x] = find(link[x]);
	}
	
	bool same(int x, int y){
		return find(x) == find(y);
	}
	
	bool unite(int x, int y){
		x = find(x);
		y = find(y);
		if(x == y) return false;
		if(x < y) swap(x,y);
		siz[x] += siz[y];
		link[y] = x;
		cmp--;
		return true;
	}
	
	int components(){
		return cmp;
	}
	
	bool size(int x){ 
		return siz[link[x]];
	}
};

struct segtree{
	vi a;
	vector<pii> seg;
	int siz;
	segtree(int n, vi &b) : seg(4*n) { a = b; }
	
	pii combine(pii c, pii b){
		if(c.first < b.first) return c;
		else if(c.first > b.first) return b;
		return {c.first, c.second + b.second};
	}
	
	void build(int l, int r, int pos){
		if(l == r){ // if l == r it means it is a laef node so only 1 minimum
			seg[pos].first = a[l];
			seg[pos].second = 1;
			return;
		}
		int mid = (l+r)/2;
		build(l,mid, pos*2); // filling left tree for minimum
		build(mid+1, r, pos*2+1); // filling right tree for minimum
		seg[pos] = combine(seg[pos*2], seg[pos*2+1]);
	}
	
	pii query(int l, int r, int ql, int qr, int pos){
		if(l > qr || r < ql) return {inf, inf};
		if(l >= ql && r <= qr) return seg[pos];
		int mid = (l+r)/2;
		pii q1 = query(l, mid, ql, qr, pos*2);
		pii q2 = query(mid+1, r, ql, qr, pos*2 + 1);
		int val = min(q1.first, q2.first);
		if(q1.first == q2.first){
			return {val, q1.second + q2.second};
		}
		else if(val == q1.first){
			return {val, q1.second};
		}
		else if(val == q2.first){
			return {val, q2.second};
		}
	}
	
	void update(int l, int r, int p, int x, int pos){
		if(l == r){
			seg[pos].first = x;
			seg[pos].second = 1;
			return;
		}
		int mid = (l+r)/2;
		if(p <= mid){
			update(l, mid, p, x, pos*2);
		}
		else{
			update(mid+1, r, p , x, pos*2 + 1);
		}
		seg[pos] = combine(seg[pos*2], seg[pos*2+1]);
	}
};

void dfs(int s, vi &visited, vector<vi> &adj){
	if(visited[s]) return;
	visited[s] = 1; 
	for(auto i : adj[s]){
		if(!visited[i]) dfs(i, visited, adj);
	}
}

void solve(){
	int n,q;
	cin >> n >> q;
	ufds ds(2*n);
	while(q--){
		int x,y;
		char c;
		cin >> c;
		cin >> x >> y;
		x--;
		y--;
		if(c == 'A'){
			ds.unite(x, y+n);
			ds.unite(x+n, y);
		}
		else if(c == 'R'){
			ds.unite(x,y);
			ds.unite(x+n, y+n);
		}
		else if(c == 'Q'){
			if(ds.same(x, y)){
				cout << "R" << endl;
			}
			else if(ds.same(x, y+n)){
				cout << "A" << endl;
			}
			else cout << "?" << endl;
		}
	}
}

int32_t main(){
	FIO;
	//w(t){solve();}
	solve();
    return 0; 
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 4180 KB Output is correct
2 Correct 29 ms 4156 KB Output is correct
3 Correct 24 ms 4192 KB Output is correct
4 Correct 26 ms 4208 KB Output is correct
5 Correct 26 ms 4204 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 4944 KB Output is correct
2 Correct 32 ms 4664 KB Output is correct
3 Correct 27 ms 4696 KB Output is correct
4 Correct 30 ms 4716 KB Output is correct
5 Correct 28 ms 4836 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 4960 KB Output is correct
2 Correct 27 ms 4472 KB Output is correct
3 Correct 27 ms 4436 KB Output is correct
4 Correct 29 ms 4764 KB Output is correct
5 Correct 26 ms 4592 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 276 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 29 ms 4180 KB Output is correct
7 Correct 29 ms 4156 KB Output is correct
8 Correct 24 ms 4192 KB Output is correct
9 Correct 26 ms 4208 KB Output is correct
10 Correct 26 ms 4204 KB Output is correct
11 Correct 37 ms 4944 KB Output is correct
12 Correct 32 ms 4664 KB Output is correct
13 Correct 27 ms 4696 KB Output is correct
14 Correct 30 ms 4716 KB Output is correct
15 Correct 28 ms 4836 KB Output is correct
16 Correct 28 ms 4960 KB Output is correct
17 Correct 27 ms 4472 KB Output is correct
18 Correct 27 ms 4436 KB Output is correct
19 Correct 29 ms 4764 KB Output is correct
20 Correct 26 ms 4592 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 276 KB Output is correct
26 Correct 28 ms 4668 KB Output is correct
27 Correct 27 ms 4700 KB Output is correct
28 Correct 33 ms 4484 KB Output is correct
29 Correct 26 ms 4552 KB Output is correct
30 Correct 30 ms 4572 KB Output is correct