oj.uz

Submission #373938

# Submission time Handle Problem Language Result Execution time Memory
373938 2021-03-06T08:07:57 Z soroush Park (BOI16_park) C++17
100 / 100
 381 ms 51396 KB 
/*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")
*/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int , int> pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 1e5 + 100;
const ll mod = 1e9+7;
const ld PI = acos((ld)-1);

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n , m , w[2];
int pos[maxn][2] , r[maxn] , par[maxn]  , ans[maxn][5];
vector < pair < int , pii > > vec;

int getpar(int v){
	return((par[v] == -1) ? v : par[v] = getpar(par[v]));
}

int32_t main(){
	migmig;
	ms(par, -1);
	cin >> n >> m >> w[0] >> w[1];
	for(int i = 0 ; i < n ; i ++){
		cin >> pos[i][0] >> pos[i][1] >> r[i];
		for(int j = 0 ; j < i ; j ++){
			ll d = 0;
			for(int k = 0 ; k < 2 ; k ++) d += ((ll)pos[i][k] - pos[j][k])*((ll)pos[i][k] - pos[j][k]);
			vec.pb({(int)sqrt(d) - r[i] - r[j] , {j , i}});
		}
		for(int j = 0 ; j < 2 ; j ++) for(int k = 0 ; k < 2 ; k ++)
				vec.pb({abs(k * w[j] - pos[i][j]) - r[i] , {i , n + j + 2*k}});
	}
	for(int i = 0 ; i < m ; i ++){
		int q , x;
		cin >> q >> x;
		vec.pb({2*q , {-x, i}});
	}
	sort(vec.begin() , vec.end());
/*
 ⠄⣾⣿⠿⠿⠶⠿⢿⣿⣿⣿⣿⣦⣤⣄⢀⡅⢠⣾⣛⡉⠄⠄⠄⠸⢀⣿⠄
⢀⡋⣡⣴⣶⣶⡀⠄⠄⠙⢿⣿⣿⣿⣿⣿⣴⣿⣿⣿⢃⣤⣄⣀⣥⣿⣿⠄
⢸⣇⠻⣿⣿⣿⣧⣀⢀⣠⡌⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠿⣿⣿⣿⠄
⢸⣿⣷⣤⣤⣤⣬⣙⣛⢿⣿⣿⣿⣿⣿⣿⡿⣿⣿⡍⠄⠄⢀⣤⣄⠉⠋⣰
⣖⣿⣿⣿⣿⣿⣿⣿⣿⣿⢿⣿⣿⣿⣿⣿⢇⣿⣿⡷⠶⠶⢿⣿⣿⠇⢀⣤
⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣽⣿⣿⣿⡇⣿⣿⣿⣿⣿⣿⣷⣶⣥⣴⣿⡗
⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡟⠄
⣦⣌⣛⣻⣿⣿⣧⠙⠛⠛⡭⠅⠒⠦⠭⣭⡻⣿⣿⣿⣿⣿⣿⣿⣿⡿⠃⠄
⣿⣿⣿⣿⣿⣿⣿⡆⠄⠄⠄⠄⠄⠄⠄⠄⠹⠈⢋⣽⣿⣿⣿⣿⣵⣾⠃⠄
⣿⣿⣿⣿⣿⣿⣿⣿⠄⣴⣿⣶⣄⠄⣴⣶⠄⢀⣾⣿⣿⣿⣿⣿⣿⠃⠄⠄
⠈⠻⣿⣿⣿⣿⣿⣿⡄⢻⣿⣿⣿⠄⣿⣿⡀⣾⣿⣿⣿⣿⣛⠛⠁⠄⠄⠄
⠄⠄⠈⠛⢿⣿⣿⣿⠁⠞⢿⣿⣿⡄⢿⣿⡇⣸⣿⣿⠿⠛⠁⠄⠄⠄⠄⠄
⠄⠄⠄⠄⠄⠉⠻⣿⣿⣾⣦⡙⠻⣷⣾⣿⠃⠿⠋⠁⠄⠄⠄⠄⠄⢀⣠⣴
⣿⣶⣶⣮⣥⣒⠲⢮⣝⡿⣿⣿⡆⣿⡿⠃⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⣠
*/
	for(auto [f , s] : vec){
		if(s.first < 0){
			for(int i = 0 , j = -s.first-1 ; i < 4 ; i ++){
				ans[s.second][i] = 1;
				if(i == j)continue;
				ans[s.second][i] &= (getpar(n + j) != getpar(n + (j + 1)%4));
				ans[s.second][i] &= (getpar(n + i) != getpar(n + (i + 1)%4));
				ans[s.second][i] &= ((i - j + 4)%4 == 1) or (getpar(n + j) != getpar(n + (j + 2)%4));
				ans[s.second][i] &= ((i - j + 4)%4 == 3) or (getpar(n + (j + 1)%4) != getpar(n + (j + 3)%4));
			}
		}
		else{
			int a = getpar(s.first) , b = getpar(s.second);
			if(a ^ b)par[a] = b;
		}
	}
	for(int i = 0 ; i < m ; i ++){
		string res = "";
		for(int j = 0 ; j < 4 ; j ++)if(ans[i][j])res += char('1' + j);
		cout << res << endl;
	}
	return(0);
}

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 25548 KB Output is correct
2 Correct 306 ms 25548 KB Output is correct
3 Correct 295 ms 25548 KB Output is correct
4 Correct 296 ms 25556 KB Output is correct
5 Correct 295 ms 25556 KB Output is correct
6 Correct 296 ms 25548 KB Output is correct
7 Correct 266 ms 25548 KB Output is correct
8 Correct 274 ms 25548 KB Output is correct
9 Correct 1 ms 748 KB Output is correct
10 Correct 1 ms 768 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 4704 KB Output is correct
2 Correct 52 ms 5728 KB Output is correct
3 Correct 50 ms 5600 KB Output is correct
4 Correct 52 ms 5728 KB Output is correct
5 Correct 54 ms 5856 KB Output is correct
6 Correct 53 ms 5728 KB Output is correct
7 Correct 52 ms 5472 KB Output is correct
8 Correct 48 ms 5472 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 25548 KB Output is correct
2 Correct 306 ms 25548 KB Output is correct
3 Correct 295 ms 25548 KB Output is correct
4 Correct 296 ms 25556 KB Output is correct
5 Correct 295 ms 25556 KB Output is correct
6 Correct 296 ms 25548 KB Output is correct
7 Correct 266 ms 25548 KB Output is correct
8 Correct 274 ms 25548 KB Output is correct
9 Correct 1 ms 748 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 55 ms 4704 KB Output is correct
12 Correct 52 ms 5728 KB Output is correct
13 Correct 50 ms 5600 KB Output is correct
14 Correct 52 ms 5728 KB Output is correct
15 Correct 54 ms 5856 KB Output is correct
16 Correct 53 ms 5728 KB Output is correct
17 Correct 52 ms 5472 KB Output is correct
18 Correct 48 ms 5472 KB Output is correct
19 Correct 362 ms 51236 KB Output is correct
20 Correct 360 ms 51236 KB Output is correct
21 Correct 381 ms 51160 KB Output is correct
22 Correct 358 ms 51396 KB Output is correct
23 Correct 357 ms 51236 KB Output is correct
24 Correct 337 ms 51236 KB Output is correct