oj.uz

Submission #95394

# Submission time Handle Problem Language Result Execution time Memory
95394 2019-01-31T11:28:57 Z pranjalssh Circle selection (APIO18_circle_selection) C++11
87 / 100
 3000 ms 48836 KB 
/*
	Simulate process by checking all circles in square of width 4*r. Use a kd-tree for this.
*/
#pragma GCC optimize("Ofast")
#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;
	int aid;
	node(): l(0), r(0), sum(0), aid(0) {}
};
vector<node> T;
vector<vector<int>> A;
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);
		A.emplace_back(ids);
		T[no].aid = sz(A)-1;
		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: A[T[no].aid]) if (intersect(it, bc)) {
			par[it] = bc;
			rem.emplace_back(it);
			T[no].sum--;
		}

		reverse(all(rem));
		vi& a = A[T[no].aid];
		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(2e7);

	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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 1 ms 380 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 0 ms 376 KB Output is correct
14 Correct 2 ms 296 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 512 KB Output is correct
18 Correct 3 ms 508 KB Output is correct
19 Correct 8 ms 1272 KB Output is correct
20 Correct 8 ms 1272 KB Output is correct
21 Correct 8 ms 1272 KB Output is correct
22 Correct 11 ms 1272 KB Output is correct
23 Correct 11 ms 1272 KB Output is correct
24 Correct 11 ms 1272 KB Output is correct
25 Correct 11 ms 1272 KB Output is correct
26 Correct 11 ms 1272 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 47440 KB Output is correct
2 Correct 482 ms 47444 KB Output is correct
3 Correct 537 ms 47448 KB Output is correct
4 Correct 486 ms 47684 KB Output is correct
5 Correct 481 ms 36940 KB Output is correct
6 Correct 697 ms 47440 KB Output is correct
7 Correct 603 ms 47836 KB Output is correct
8 Correct 518 ms 47956 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 288 ms 15336 KB Output is correct
3 Correct 1047 ms 44076 KB Output is correct
4 Correct 980 ms 43608 KB Output is correct
5 Correct 991 ms 47984 KB Output is correct
6 Correct 424 ms 29188 KB Output is correct
7 Correct 218 ms 17060 KB Output is correct
8 Correct 41 ms 4416 KB Output is correct
9 Correct 1129 ms 45604 KB Output is correct
10 Correct 931 ms 48836 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 836 ms 44032 KB Output is correct
2 Correct 959 ms 43724 KB Output is correct
3 Correct 507 ms 43892 KB Output is correct
4 Correct 863 ms 43480 KB Output is correct
5 Correct 894 ms 43724 KB Output is correct
6 Correct 513 ms 43680 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 1 ms 380 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 0 ms 376 KB Output is correct
14 Correct 2 ms 296 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 512 KB Output is correct
18 Correct 3 ms 508 KB Output is correct
19 Correct 8 ms 1272 KB Output is correct
20 Correct 8 ms 1272 KB Output is correct
21 Correct 8 ms 1272 KB Output is correct
22 Correct 11 ms 1272 KB Output is correct
23 Correct 11 ms 1272 KB Output is correct
24 Correct 11 ms 1272 KB Output is correct
25 Correct 11 ms 1272 KB Output is correct
26 Correct 11 ms 1272 KB Output is correct
27 Correct 14 ms 1972 KB Output is correct
28 Correct 15 ms 2036 KB Output is correct
29 Correct 16 ms 2084 KB Output is correct
30 Correct 22 ms 1972 KB Output is correct
31 Correct 22 ms 1972 KB Output is correct
32 Correct 22 ms 1944 KB Output is correct
33 Correct 153 ms 15372 KB Output is correct
34 Correct 142 ms 15308 KB Output is correct
35 Correct 144 ms 15340 KB Output is correct
36 Correct 283 ms 15404 KB Output is correct
37 Correct 309 ms 15328 KB Output is correct
38 Correct 303 ms 15392 KB Output is correct
39 Correct 877 ms 13376 KB Output is correct
40 Correct 761 ms 13380 KB Output is correct
41 Correct 633 ms 13536 KB Output is correct
42 Correct 146 ms 15068 KB Output is correct
43 Correct 270 ms 15972 KB Output is correct
44 Correct 270 ms 16488 KB Output is correct
45 Correct 251 ms 15964 KB Output is correct
46 Correct 301 ms 16608 KB Output is correct
47 Correct 290 ms 16312 KB Output is correct
48 Correct 307 ms 16652 KB Output is correct
49 Correct 303 ms 16644 KB Output is correct
50 Correct 311 ms 16736 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 1 ms 380 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 0 ms 376 KB Output is correct
14 Correct 2 ms 296 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 512 KB Output is correct
18 Correct 3 ms 508 KB Output is correct
19 Correct 8 ms 1272 KB Output is correct
20 Correct 8 ms 1272 KB Output is correct
21 Correct 8 ms 1272 KB Output is correct
22 Correct 11 ms 1272 KB Output is correct
23 Correct 11 ms 1272 KB Output is correct
24 Correct 11 ms 1272 KB Output is correct
25 Correct 11 ms 1272 KB Output is correct
26 Correct 11 ms 1272 KB Output is correct
27 Correct 477 ms 47440 KB Output is correct
28 Correct 482 ms 47444 KB Output is correct
29 Correct 537 ms 47448 KB Output is correct
30 Correct 486 ms 47684 KB Output is correct
31 Correct 481 ms 36940 KB Output is correct
32 Correct 697 ms 47440 KB Output is correct
33 Correct 603 ms 47836 KB Output is correct
34 Correct 518 ms 47956 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 288 ms 15336 KB Output is correct
37 Correct 1047 ms 44076 KB Output is correct
38 Correct 980 ms 43608 KB Output is correct
39 Correct 991 ms 47984 KB Output is correct
40 Correct 424 ms 29188 KB Output is correct
41 Correct 218 ms 17060 KB Output is correct
42 Correct 41 ms 4416 KB Output is correct
43 Correct 1129 ms 45604 KB Output is correct
44 Correct 931 ms 48836 KB Output is correct
45 Correct 836 ms 44032 KB Output is correct
46 Correct 959 ms 43724 KB Output is correct
47 Correct 507 ms 43892 KB Output is correct
48 Correct 863 ms 43480 KB Output is correct
49 Correct 894 ms 43724 KB Output is correct
50 Correct 513 ms 43680 KB Output is correct
51 Correct 14 ms 1972 KB Output is correct
52 Correct 15 ms 2036 KB Output is correct
53 Correct 16 ms 2084 KB Output is correct
54 Correct 22 ms 1972 KB Output is correct
55 Correct 22 ms 1972 KB Output is correct
56 Correct 22 ms 1944 KB Output is correct
57 Correct 153 ms 15372 KB Output is correct
58 Correct 142 ms 15308 KB Output is correct
59 Correct 144 ms 15340 KB Output is correct
60 Correct 283 ms 15404 KB Output is correct
61 Correct 309 ms 15328 KB Output is correct
62 Correct 303 ms 15392 KB Output is correct
63 Correct 877 ms 13376 KB Output is correct
64 Correct 761 ms 13380 KB Output is correct
65 Correct 633 ms 13536 KB Output is correct
66 Correct 146 ms 15068 KB Output is correct
67 Correct 270 ms 15972 KB Output is correct
68 Correct 270 ms 16488 KB Output is correct
69 Correct 251 ms 15964 KB Output is correct
70 Correct 301 ms 16608 KB Output is correct
71 Correct 290 ms 16312 KB Output is correct
72 Correct 307 ms 16652 KB Output is correct
73 Correct 303 ms 16644 KB Output is correct
74 Correct 311 ms 16736 KB Output is correct
75 Correct 598 ms 43964 KB Output is correct
76 Correct 525 ms 44512 KB Output is correct
77 Correct 488 ms 43896 KB Output is correct
78 Correct 502 ms 43628 KB Output is correct
79 Correct 645 ms 44004 KB Output is correct
80 Correct 493 ms 44040 KB Output is correct
81 Correct 1236 ms 44400 KB Output is correct
82 Correct 1048 ms 43960 KB Output is correct
83 Correct 1085 ms 43800 KB Output is correct
84 Correct 1131 ms 43984 KB Output is correct
85 Correct 1225 ms 44236 KB Output is correct
86 Correct 1197 ms 44132 KB Output is correct
87 Correct 1202 ms 43888 KB Output is correct
88 Execution timed out 3077 ms 37768 KB Time limit exceeded
89 Halted 0 ms 0 KB -