oj.uz

Submission #330176

# Submission time Handle Problem Language Result Execution time Memory
330176 2020-11-24T05:55:18 Z wind_reaper Experimental Charges (NOI19_charges) C++17
100 / 100
 29 ms 2688 KB 
// #define _GLIBCXX_DEBUG
// #pragma GCC optimize "trapv"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>

// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using namespace std;
using namespace __gnu_pbds;
using namespace chrono;

#define pb push_back 
#define f first
#define s second
#define min3(a, b, c) min(min(a, b), c)
#define max3(a, b, c) max(max(a, b), c)
#define all(v) v.begin(), v.end()

typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int INF = 1e9;
// const ll INF = 1e18;
const ll mod = 1000000007;
// const ll mod = 998244353;
struct dsu{
	vi e;

	void init(int n){
		e = vi(2*n, -1); 
	}

	int get(int x){
		return (e[x] < 0 ? x : e[x] = get(e[x])); 
	}

	int sz(int x){
		return -e[get(x)]; 
	}
	bool same(int x, int y){
		return get(x) == get(y); 
	}
	bool unite(int x, int y){
		x = get(x), y = get(y); 
		if(x == y) return 0; 
		if(e[x] > e[y])
			swap(x, y); 

		e[x] += e[y]; e[y] = x;
		return 1; 
	}
};	
void solve(int tc){
	int n, q;
	cin >> n >> q; 

	dsu s;
	s.init(n); 

	for(int i = 0; i < q; i++){
		char a; 
		int u, v; 
		cin >> a >> u >> v;
		if(a == 'A'){
			s.unite(u-1, v-1+n); 
			s.unite(u-1+n, v-1); 
		}
		if(a == 'R'){
			s.unite(u-1, v-1); 
			s.unite(u-1+n, v-1+n); 
		}
		if(a == 'Q'){
			if(s.same(u-1, v-1) || s.same(u-1+n, v-1+n))
				cout << 'R' << '\n';
			else if(s.same(u-1+n, v-1) || s.same(u-1, v-1+n))
				cout << 'A' << '\n';
			else cout << '?' << '\n';

 		}
	}
}

int main(){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);
	#ifdef LOCAL
		auto begin = high_resolution_clock::now();
	#endif

    int tc = 1;
    // cin >> tc; 
    for (int t = 0; t < tc; t++) solve(t);
    
    #ifdef LOCAL 
    	auto end = high_resolution_clock::now();
    	cout << fixed << setprecision(4) << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
    #endif
	return 0;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2068 KB Output is correct
2 Correct 22 ms 2028 KB Output is correct
3 Correct 25 ms 2176 KB Output is correct
4 Correct 25 ms 2156 KB Output is correct
5 Correct 22 ms 2044 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 2540 KB Output is correct
2 Correct 25 ms 2540 KB Output is correct
3 Correct 27 ms 2540 KB Output is correct
4 Correct 28 ms 2540 KB Output is correct
5 Correct 29 ms 2688 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2412 KB Output is correct
2 Correct 26 ms 2412 KB Output is correct
3 Correct 25 ms 2412 KB Output is correct
4 Correct 28 ms 2540 KB Output is correct
5 Correct 27 ms 2412 KB Output is correct

Subtask #5
25.0 / 25.0

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

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 22 ms 2068 KB Output is correct
7 Correct 22 ms 2028 KB Output is correct
8 Correct 25 ms 2176 KB Output is correct
9 Correct 25 ms 2156 KB Output is correct
10 Correct 22 ms 2044 KB Output is correct
11 Correct 26 ms 2540 KB Output is correct
12 Correct 25 ms 2540 KB Output is correct
13 Correct 27 ms 2540 KB Output is correct
14 Correct 28 ms 2540 KB Output is correct
15 Correct 29 ms 2688 KB Output is correct
16 Correct 27 ms 2412 KB Output is correct
17 Correct 26 ms 2412 KB Output is correct
18 Correct 25 ms 2412 KB Output is correct
19 Correct 28 ms 2540 KB Output is correct
20 Correct 27 ms 2412 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 26 ms 2540 KB Output is correct
27 Correct 28 ms 2480 KB Output is correct
28 Correct 29 ms 2548 KB Output is correct
29 Correct 25 ms 2412 KB Output is correct
30 Correct 26 ms 2412 KB Output is correct