제출 #580595

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
580595		vovamr	원 고르기 (APIO18_circle_selection)	C++17	87 / 100	3064 ms	88084 KiB

circle_selection

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

#define int long long
#define sqr(x) ((x)*1ll*(x))
struct cir { int x, y, r, id; };
inline int ds(const cir &a, const cir &b) { return sqr(a.x-b.x)+sqr(a.y-b.y); }
inline bool isec(const cir &a, const cir &b) { return ds(a, b) <= sqr(a.r + b.r); }
inline bool operator < (const cir &a, const cir &b) {
	if (a.r != b.r) return a.r > b.r;
	else if (a.id != b.id) return a.id < b.id;
	else if (a.x != b.x) return a.x < b.x;
	else return a.y < b.y;
}

inline void solve() {
	int n;
	cin >> n;

	set<cir> st;
	for (int i = 0; i < n; ++i) {
		int x, y, r;
		cin >> x >> y >> r;
		st.insert(cir{x, y, r, i});
	}

	ve<int> ans(n);

	int R = 2e9;

	map<pii,set<cir>> mp;
	auto ins = [&mp,&R](const cir &a) { mp[mpp(a.x / R, a.y / R)].insert(a); };
	auto ers = [&mp,&R](const cir &a) { mp[mpp(a.x / R, a.y / R)].erase(a); };

	while (sz(st)) {

		auto x = *st.begin();
		st.erase(st.begin());
		ers(x);

		ans[x.id] = x.id;

		if (x.r <= R / 2) { R = x.r; mp.clear(); for (auto &f : st) ins(f); }

		int a = x.x / R, b = x.y / R;

		ve<cir> bad;
		for (int i = -2; i <= 2; ++i) {
			for (int j = -2; j <= 2; ++j) {
				if (!mp.count(mpp(a + i, b + j))) continue;

				for (auto &cr : mp[mpp(a + i, b + j)]) {
					if (isec(x, cr)) {
						ans[cr.id] = x.id;
						bad.pb(cr);
					}
				}
			}
		}

		for (auto &f : bad) {
			st.erase(f);
			ers(f);
		}
	}

	for (auto i : ans) cout << i + 1 << " ";
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

• Subtask 1: 7 / 7
• Subtask 2: 12 / 12
• Subtask 3: 15 / 15
• Subtask 4: 23 / 23
• Subtask 5: 30 / 30
• Subtask 6: 0 / 13