답안 #95388 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
95388	2019-01-31T08:32:00 Z	pranjalssh	원 고르기 (APIO18_circle_selection)	C++11	87 / 100	3000 ms	65572 KB

circle_selection

/*
	Simulate process by checking all circles in square of width 4*r. Use a kd-tree for this.
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;

#define cerr cout
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
typedef long long ll; typedef pair <int, int> ii; typedef vector <int> vi; const int inf = 1e9 + 7;
string to_string(string s) { return '"' + s + '"';}
string to_string(char s) { return string(1, s);}
string to_string(const char* s) { return to_string((string) s);}
string to_string(bool b) { return (b ? "true" : "false");}
template <typename A> string to_string(A);
template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}
template <typename A> string to_string(A v) {bool f = 1; string r = "{"; for (const auto &x : v) {if (!f)r += ", "; f = 0; r += to_string(x);} return r + "}";}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {cerr << " " << to_string(H); debug_out(T...);}
#define pr(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)


const int N = 3e5 + 10;
vi x, y, r;
struct node {
	int l, r, sum;
	vector<int> a;
	node(): l(0), r(0), sum(0) {}
};
vector<node> T;
vi xc, yc;
vi par;
inline bool intersect(int i, int j) {
	return (x[i] - x[j]) * 1LL * (x[i] - x[j]) + (y[i] - y[j]) * 1LL * (y[i] - y[j]) <= (r[i] + r[j]) * 1LL * (r[i] + r[j]);
}

inline int make_node() {
	T.emplace_back();
	return sz(T) - 1;
}

int build(int no, bool dim, int xl, int xr, int yl, int yr, const vi& ids) {
	if (ids.empty()) return no;
	if (no == 0) no = make_node();
	bool g = 1;
	FOR (i, 1, sz(ids) - 1) if (x[ids[i]] != x[ids[0]] or y[ids[i]] != y[ids[0]]) {g = 0; break;}
	if (g) {
		T[no].sum = sz(ids);
		T[no].a = ids;
		return no;
	}
	if (dim) {
		int mid = (yl + yr) >> 1;
		vi lids, rids;
		for (int it : ids) {
			if (y[it] <= yc[mid]) lids.emplace_back(it);
			else rids.emplace_back(it);
		}
		int L = build(0, 0, xl, xr, yl, mid, lids);
		int R = build(0, 0, xl, xr, mid + 1, yr, rids);
		T[no].l = L, T[no].r = R;
		T[no].sum = T[T[no].l].sum + T[T[no].r].sum;
	} else {
		int mid = (xl + xr) >> 1;
		vi lids, rids;
		for (int it : ids) {
			if (x[it] <= xc[mid]) lids.emplace_back(it);
			else rids.emplace_back(it);
		}
		int L = build(0, 1, xl, mid, yl, yr, lids);
		int R = build(0, 1, mid + 1, xr, yl, yr, rids);
		T[no].l = L, T[no].r = R;
		T[no].sum = T[T[no].l].sum + T[T[no].r].sum;
	}
	return no;
}

int xu, xv, yu, yv, bc;
vi rem;

void get(int no, bool dim, int xl, int xr, int yl, int yr) {
	if (T[no].sum == 0) return;

	if (xr < xu or xl > xv) return;
	if (yr < yu or yl > yv) return;

	if (T[no].l == 0 and T[no].r == 0) {
		for (int it: T[no].a) if (intersect(it, bc)) {
			par[it] = bc;
			rem.emplace_back(it);
			T[no].sum--;
		}

		reverse(all(rem));
		vi& a = T[no].a;
		int j = 0;
		FOR (i, 0, sz(a) - 1) {
			if (rem.empty() or a[i] != rem.back()) {
				a[j] = a[i];
				++j;
			} else {
				rem.pop_back();
			}
		}
		a.resize(j);
		rem.clear();
		return;
	}

	if (dim) {
		int mid = (yl+yr)>>1;
		get(T[no].l, 0, xl,xr,yl, mid);
		get(T[no].r, 0, xl, xr, mid+1, yr);
		T[no].sum = T[T[no].l].sum + T[T[no].r].sum;
	} else {
		int mid = (xl+xr)>>1;
		get(T[no].l, 1, xl, mid, yl, yr);
		get(T[no].r, 1, mid+1, xr, yl, yr);
		T[no].sum = T[T[no].l].sum + T[T[no].r].sum;
	}

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

	int n; cin >> n;
	x.resize(n), y.resize(n), r.resize(n);
	par = vi(n, -1);

	FOR (i, 0, n - 1) {
		cin >> x[i] >> y[i] >> r[i];
		xc.emplace_back(x[i]);
		yc.emplace_back(y[i]);
	}
	xc.emplace_back(-inf), xc.emplace_back(inf);
	yc.emplace_back(-inf), yc.emplace_back(inf);
	sort(all(xc)); xc.erase(unique(all(xc)), xc.end());
	sort(all(yc)); yc.erase(unique(all(yc)), yc.end());

	vi id(n); iota(all(id), 0);
	sort(all(id), [&](int x, int y) {
		if (r[x] == r[y]) return x < y;
		return r[x] > r[y];
	});

	T.reserve(1e7);

	T.emplace_back();
	int root = build(0, 0, 0, sz(xc)-1, 0, sz(yc)-1, id);

	for (int i : id) if (par[i] == -1) {
			bc = i;
			xu = max(x[i] - 2LL * r[i], (ll) - inf);
			xu = lower_bound(all(xc), xu) - xc.begin();
			xv = min(x[i] + 2LL * r[i], (ll)inf);
			xv = upper_bound(all(xc), xv) - xc.begin()-1;

			yu = max(y[i] - 2LL * r[i], (ll) - 1e9);
			yu = lower_bound(all(yc), yu) - yc.begin();
			yv = min(y[i] + 2LL * r[i], (ll)1e9);
			yv = upper_bound(all(yc), yv) - yc.begin()-1;

			get(root, 0, 0, sz(xc)-1, 0, sz(yc)-1);
		}

	FOR (i, 0, n - 1) cout << par[i] + 1 << " ";



	return 0;
}

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	380 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	3 ms	504 KB	Output is correct
17	Correct	3 ms	504 KB	Output is correct
18	Correct	3 ms	504 KB	Output is correct
19	Correct	9 ms	1400 KB	Output is correct
20	Correct	8 ms	1400 KB	Output is correct
21	Correct	8 ms	1404 KB	Output is correct
22	Correct	12 ms	1400 KB	Output is correct
23	Correct	12 ms	1400 KB	Output is correct
24	Correct	22 ms	1400 KB	Output is correct
25	Correct	11 ms	1400 KB	Output is correct
26	Correct	11 ms	1428 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	560 ms	60636 KB	Output is correct
2	Correct	503 ms	60376 KB	Output is correct
3	Correct	501 ms	59868 KB	Output is correct
4	Correct	583 ms	60508 KB	Output is correct
5	Correct	530 ms	45412 KB	Output is correct
6	Correct	765 ms	59760 KB	Output is correct
7	Correct	654 ms	57820 KB	Output is correct
8	Correct	638 ms	59228 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	348 ms	17664 KB	Output is correct
3	Correct	1199 ms	52876 KB	Output is correct
4	Correct	1069 ms	52192 KB	Output is correct
5	Correct	1052 ms	63324 KB	Output is correct
6	Correct	469 ms	41316 KB	Output is correct
7	Correct	329 ms	24308 KB	Output is correct
8	Correct	44 ms	6136 KB	Output is correct
9	Correct	1080 ms	56664 KB	Output is correct
10	Correct	937 ms	65572 KB	Output is correct

Subtask #4
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	968 ms	52692 KB	Output is correct
2	Correct	910 ms	52444 KB	Output is correct
3	Correct	545 ms	51800 KB	Output is correct
4	Correct	900 ms	51932 KB	Output is correct
5	Correct	960 ms	52188 KB	Output is correct
6	Correct	507 ms	51548 KB	Output is correct

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	380 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	3 ms	504 KB	Output is correct
17	Correct	3 ms	504 KB	Output is correct
18	Correct	3 ms	504 KB	Output is correct
19	Correct	9 ms	1400 KB	Output is correct
20	Correct	8 ms	1400 KB	Output is correct
21	Correct	8 ms	1404 KB	Output is correct
22	Correct	12 ms	1400 KB	Output is correct
23	Correct	12 ms	1400 KB	Output is correct
24	Correct	22 ms	1400 KB	Output is correct
25	Correct	11 ms	1400 KB	Output is correct
26	Correct	11 ms	1428 KB	Output is correct
27	Correct	32 ms	2296 KB	Output is correct
28	Correct	14 ms	2296 KB	Output is correct
29	Correct	15 ms	2296 KB	Output is correct
30	Correct	21 ms	2296 KB	Output is correct
31	Correct	23 ms	2248 KB	Output is correct
32	Correct	22 ms	2296 KB	Output is correct
33	Correct	150 ms	17900 KB	Output is correct
34	Correct	165 ms	17888 KB	Output is correct
35	Correct	152 ms	17644 KB	Output is correct
36	Correct	296 ms	17772 KB	Output is correct
37	Correct	299 ms	17772 KB	Output is correct
38	Correct	316 ms	17772 KB	Output is correct
39	Correct	731 ms	15212 KB	Output is correct
40	Correct	1006 ms	15432 KB	Output is correct
41	Correct	973 ms	15340 KB	Output is correct
42	Correct	161 ms	16852 KB	Output is correct
43	Correct	325 ms	18156 KB	Output is correct
44	Correct	316 ms	19452 KB	Output is correct
45	Correct	269 ms	18284 KB	Output is correct
46	Correct	277 ms	19692 KB	Output is correct
47	Correct	293 ms	18984 KB	Output is correct
48	Correct	331 ms	20076 KB	Output is correct
49	Correct	310 ms	19748 KB	Output is correct
50	Correct	308 ms	20076 KB	Output is correct

Subtask #6
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	380 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	3 ms	504 KB	Output is correct
17	Correct	3 ms	504 KB	Output is correct
18	Correct	3 ms	504 KB	Output is correct
19	Correct	9 ms	1400 KB	Output is correct
20	Correct	8 ms	1400 KB	Output is correct
21	Correct	8 ms	1404 KB	Output is correct
22	Correct	12 ms	1400 KB	Output is correct
23	Correct	12 ms	1400 KB	Output is correct
24	Correct	22 ms	1400 KB	Output is correct
25	Correct	11 ms	1400 KB	Output is correct
26	Correct	11 ms	1428 KB	Output is correct
27	Correct	560 ms	60636 KB	Output is correct
28	Correct	503 ms	60376 KB	Output is correct
29	Correct	501 ms	59868 KB	Output is correct
30	Correct	583 ms	60508 KB	Output is correct
31	Correct	530 ms	45412 KB	Output is correct
32	Correct	765 ms	59760 KB	Output is correct
33	Correct	654 ms	57820 KB	Output is correct
34	Correct	638 ms	59228 KB	Output is correct
35	Correct	2 ms	376 KB	Output is correct
36	Correct	348 ms	17664 KB	Output is correct
37	Correct	1199 ms	52876 KB	Output is correct
38	Correct	1069 ms	52192 KB	Output is correct
39	Correct	1052 ms	63324 KB	Output is correct
40	Correct	469 ms	41316 KB	Output is correct
41	Correct	329 ms	24308 KB	Output is correct
42	Correct	44 ms	6136 KB	Output is correct
43	Correct	1080 ms	56664 KB	Output is correct
44	Correct	937 ms	65572 KB	Output is correct
45	Correct	968 ms	52692 KB	Output is correct
46	Correct	910 ms	52444 KB	Output is correct
47	Correct	545 ms	51800 KB	Output is correct
48	Correct	900 ms	51932 KB	Output is correct
49	Correct	960 ms	52188 KB	Output is correct
50	Correct	507 ms	51548 KB	Output is correct
51	Correct	32 ms	2296 KB	Output is correct
52	Correct	14 ms	2296 KB	Output is correct
53	Correct	15 ms	2296 KB	Output is correct
54	Correct	21 ms	2296 KB	Output is correct
55	Correct	23 ms	2248 KB	Output is correct
56	Correct	22 ms	2296 KB	Output is correct
57	Correct	150 ms	17900 KB	Output is correct
58	Correct	165 ms	17888 KB	Output is correct
59	Correct	152 ms	17644 KB	Output is correct
60	Correct	296 ms	17772 KB	Output is correct
61	Correct	299 ms	17772 KB	Output is correct
62	Correct	316 ms	17772 KB	Output is correct
63	Correct	731 ms	15212 KB	Output is correct
64	Correct	1006 ms	15432 KB	Output is correct
65	Correct	973 ms	15340 KB	Output is correct
66	Correct	161 ms	16852 KB	Output is correct
67	Correct	325 ms	18156 KB	Output is correct
68	Correct	316 ms	19452 KB	Output is correct
69	Correct	269 ms	18284 KB	Output is correct
70	Correct	277 ms	19692 KB	Output is correct
71	Correct	293 ms	18984 KB	Output is correct
72	Correct	331 ms	20076 KB	Output is correct
73	Correct	310 ms	19748 KB	Output is correct
74	Correct	308 ms	20076 KB	Output is correct
75	Correct	483 ms	51784 KB	Output is correct
76	Correct	481 ms	52444 KB	Output is correct
77	Correct	511 ms	52592 KB	Output is correct
78	Correct	517 ms	51800 KB	Output is correct
79	Correct	594 ms	52444 KB	Output is correct
80	Correct	531 ms	51760 KB	Output is correct
81	Correct	1189 ms	52716 KB	Output is correct
82	Correct	1219 ms	52444 KB	Output is correct
83	Correct	1212 ms	52160 KB	Output is correct
84	Correct	1306 ms	52236 KB	Output is correct
85	Correct	1125 ms	52832 KB	Output is correct
86	Correct	1048 ms	52356 KB	Output is correct
87	Correct	1345 ms	52192 KB	Output is correct
88	Execution timed out	3055 ms	42336 KB	Time limit exceeded
89	Halted	0 ms	0 KB	-

답안 #95388

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 12.0 / 12.0

Subtask #3 15.0 / 15.0

Subtask #4 23.0 / 23.0

Subtask #5 30.0 / 30.0

Subtask #6 0 / 13.0

Subtask #1
7.0 / 7.0

Subtask #2
12.0 / 12.0

Subtask #3
15.0 / 15.0

Subtask #4
23.0 / 23.0

Subtask #5
30.0 / 30.0

Subtask #6
0 / 13.0