Submission #372804

#	Time	Username	Problem	Language	Result	Execution time	Memory
372804		Return_0	Park (BOI16_park)	C++17	100 / 100	396 ms	55024 KiB

park

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

#define sqr(x) ((x) * (x))

cl N = 2e3 + 7, M = 1e5 + 7;

ll x [N], y [N], r [N], par [N], n, q, w, h, lst;
vector <pair <double, pll>> vec, qu;
bool ans [M][5];

inline double dist (cl &v, cl &u) { return sqrt(sqr(abs(x[v] - x[u])) + sqr(abs(y[v] - y[u]))) - r[v] - r[u]; }

ll root (cl &v) {
	if (par[v] == v) return v;
	return par[v] = root(par[v]);
}

inline void unite (cl &v, cl &u) { par[root(u)] = root(v); }

#define ch12 (root(2001) != root(2002) && root(2001) != root(2003) && root(2001) != root(2004))
#define ch13 (root(2001) != root(2004) && root(2001) != root(2003) && root(2002) != root(2004) && root(2002) != root(2003))
#define ch14 (root(2004) != root(2001) && root(2004) != root(2002) && root(2004) != root(2003))
#define ch23 (root(2002) != root(2001) && root(2002) != root(2003) && root(2002) != root(2004))
#define ch24 (root(2001) != root(2002) && root(2001) != root(2003) && root(2002) != root(2004) && root(2003) != root(2004))
#define ch34 (root(2003) != root(2001) && root(2003) != root(2002) && root(2003) != root(2004))

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	iota(par, par + N, 0);

	cin>> n >> q >> w >> h;
	for (ll i = 1; i <= n; i++) {
		cin>> x[i] >> y[i] >> r[i];
		for (ll j = 1; j < i; j++) vec.push_back({dist(i, j), {i, j}});
		vec.push_back({y[i] - r[i], {2001, i}});
		vec.push_back({w - x[i] - r[i], {2002, i}});
		vec.push_back({h - y[i] - r[i], {2003, i}});
		vec.push_back({x[i] - r[i], {2004, i}});
	}

	for (ll i = 0, R, in; i < q; i++) {
		cin>> R >> in;
		qu.push_back({R + R, {in, i}});
	}

	sort(All(vec)); sort(All(qu));
	
	for (auto &t : qu) {
		for (;lst < SZ(vec) && vec[lst].fr < t.fr; lst++) unite(vec[lst].sc.fr, vec[lst].sc.sc);
		auto [pos, id] = t.sc;
		ans[id][pos] = 1;
		if (pos == 1) {
			if (ch12) ans[id][2] = 1;
			if (ch13) ans[id][3] = 1;
			if (ch14) ans[id][4] = 1;
		} else if (pos == 2) {
			if (ch12) ans[id][1] = 1;
			if (ch23) ans[id][3] = 1;
			if (ch24) ans[id][4] = 1;
		} else if (pos == 3) {
			if (ch13) ans[id][1] = 1;
			if (ch23) ans[id][2] = 1;
			if (ch34) ans[id][4] = 1;
		} else {
			if (ch14) ans[id][1] = 1;
			if (ch24) ans[id][2] = 1;
			if (ch34) ans[id][3] = 1;
		}
	}

	for (ll i = 0; i < q; i++) {
		if (ans[i][1]) cout<< 1;
		if (ans[i][2]) cout<< 2;
		if (ans[i][3]) cout<< 3;
		if (ans[i][4]) cout<< 4;
		cout<< '\n';
	}

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
5 3
16 11
11 8 1
6 10 1
7 3 2
10 4 1
15 5 1
1 1
2 2
2 1

*/

• Subtask 1: 27 / 27
• Subtask 2: 31 / 31
• Subtask 3: 42 / 42