Submission #97295

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
97295	2019-02-15T00:06:44 Z	qkxwsm	Park (BOI16_park)	C++14	100 / 100	1091 ms	1944 KB

park

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N, Q;
ll W, H;
pair<pll, ll> circ[MAXN];
int dsu[MAXN];
ll ans[4][4];

ll dist(pll a, pll b)
{
	return (b.fi - a.fi) * (b.fi - a.fi) + (b.se - a.se) * (b.se - a.se);
}
int get(int x)
{
	return (x == dsu[x] ? x : dsu[x] = get(dsu[x]));
}
void merge(int a, int b)
{
	a = get(a);
	b = get(b);
	if (a == b) return;
	dsu[a] = b;
	return;
}
bool go(ll r, int x, int y)
{
	FOR(i, 0, N + 4)
	{
		dsu[i] = i;
	}
	// pll center;
	// if (x == 0) center = {r, r};
	// if (x == 1) center = {W - r, r};
	// if (x == 2) center = {W - r, H - r};
	// if (x == 3) center = {r, H - r};
	// FOR(i, 0, N)
	// {
	// 	if (dist(center, circ[i].fi) <= r + circ[i].se) return true;
	// }
	// if (y == 0) center = {r, r};
	// if (y == 1) center = {W - r, r};
	// if (y == 2) center = {W - r, H - r};
	// if (y == 3) center = {r, H - r};
	// FOR(i, 0, N)
	// {
	// 	if (dist(center, circ[i].fi) <= r + circ[i].se) return true;
	// }
	FOR(i, 0, N)
	{
		FOR(j, i + 1, N)
		{
			if (dist(circ[i].fi, circ[j].fi) < (2 * r + circ[i].se + circ[j].se) * (2 * r + circ[i].se + circ[j].se))
			{
				merge(i, j);
			}
		}
		if (circ[i].fi.se < 2 * r + circ[i].se)
		{
			merge(i, N);
		}
		if (circ[i].fi.fi > W - 2 * r - circ[i].se)
		{
			merge(i, N + 1);
		}
		if (circ[i].fi.se > H - 2 * r - circ[i].se)
		{
			merge(i, N + 2);
		}
		if (circ[i].fi.fi < 2 * r + circ[i].se)
		{
			merge(i, N + 3);
		}
	}
	if (x == 0 && y == 1)
	{
		if (get(N) == get(N + 3) || get(N) == get(N + 2) || get(N) == get(N + 1)) return true;
	}
	if (x == 0 && y == 2)
	{
		if (get(N) == get(N + 2) || get(N + 1) == get(N + 3) || get(N) == get(N + 3) || get(N + 1) == get(N + 2)) return true;
	}
	if (x == 0 && y == 3)
	{
		if (get(N + 3) == get(N + 2) || get(N + 3) == get(N + 1) || get(N + 3) == get(N)) return true;
	}
	if (x == 1 && y == 2)
	{
		if (get(N + 1) == get(N) || get(N + 1) == get(N + 2) || get(N + 1) == get(N + 3)) return true;
	}
	if (x == 1 && y == 3)
	{
		if (get(N) == get(N + 2) || get(N + 1) == get(N + 3) || get(N + 2) == get(N + 3) || get(N + 1) == get(N)) return true;
	}
	if (x == 2 && y == 3)
	{
		if (get(N + 2) == get(N) || get(N + 2) == get(N + 1) || get(N + 2) == get(N + 3)) return true;
	}
	return false;
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N >> Q >> W >> H;
	FOR(i, 0, N)
	{
		cin >> circ[i].fi.fi >> circ[i].fi.se >> circ[i].se;
	}
	FOR(i, 0, 4)
	{
		FOR(j, i + 1, 4)
		{
			ll lo = 0, hi = INF;
			while(hi > lo)
			{
				ll mid = (hi + lo) >> 1;
				if (go(mid, i, j)) hi = mid;
				else lo = mid + 1;
			}
			// cerr << "res " << i << ' ' << j << ' ' << lo << endl;
			ans[i][j] = lo;
			ans[j][i] = lo;
		}
		ans[i][i] = LLINF;
	}
	FOR(i, 0, Q)
	{
		ll r; int loc;
		cin >> r >> loc; loc--;
		FOR(j, 0, 4)
		{
			if (r < ans[loc][j])
			{
				cout << j + 1;
			}
		}
		cout << '\n';
		//basically the radii of all the circles increase by r, and you want to see where you can go
	}
	//an event is: circle merges with base, circle merges with circle, answer a query
	//radius, event type, two ID's
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Subtask #1

27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	896 ms	760 KB	Output is correct
2	Correct	944 ms	632 KB	Output is correct
3	Correct	863 ms	632 KB	Output is correct
4	Correct	916 ms	632 KB	Output is correct
5	Correct	917 ms	632 KB	Output is correct
6	Correct	827 ms	632 KB	Output is correct
7	Correct	1046 ms	540 KB	Output is correct
8	Correct	1091 ms	604 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct

Subtask #2

31.0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	65 ms	1916 KB	Output is correct
2	Correct	53 ms	1796 KB	Output is correct
3	Correct	47 ms	1652 KB	Output is correct
4	Correct	53 ms	1788 KB	Output is correct
5	Correct	71 ms	1912 KB	Output is correct
6	Correct	59 ms	1944 KB	Output is correct
7	Correct	37 ms	1784 KB	Output is correct
8	Correct	57 ms	1916 KB	Output is correct

Subtask #3

42.0 / 42.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	896 ms	760 KB	Output is correct
2	Correct	944 ms	632 KB	Output is correct
3	Correct	863 ms	632 KB	Output is correct
4	Correct	916 ms	632 KB	Output is correct
5	Correct	917 ms	632 KB	Output is correct
6	Correct	827 ms	632 KB	Output is correct
7	Correct	1046 ms	540 KB	Output is correct
8	Correct	1091 ms	604 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	65 ms	1916 KB	Output is correct
12	Correct	53 ms	1796 KB	Output is correct
13	Correct	47 ms	1652 KB	Output is correct
14	Correct	53 ms	1788 KB	Output is correct
15	Correct	71 ms	1912 KB	Output is correct
16	Correct	59 ms	1944 KB	Output is correct
17	Correct	37 ms	1784 KB	Output is correct
18	Correct	57 ms	1916 KB	Output is correct
19	Correct	914 ms	1888 KB	Output is correct
20	Correct	884 ms	1784 KB	Output is correct
21	Correct	925 ms	1876 KB	Output is correct
22	Correct	963 ms	1756 KB	Output is correct
23	Correct	867 ms	1912 KB	Output is correct
24	Correct	1068 ms	1880 KB	Output is correct