oj.uz

Submission #533459

# Submission time Handle Problem Language Result Execution time Memory
533459 2022-03-06T05:23:17 Z jjang36524 Circle selection (APIO18_circle_selection) C++14
72 / 100
 3000 ms 251620 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O0")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pi;
#define MAX 301010
#define MAXS 20
#define INF 1000000010
#define bb ' '
#define ln '\n'
#define Ln '\n'
pair<pi, pi> in[MAX];
int X[MAX];
int Y[MAX];
int R[MAX];
int ind[MAX];
int ri[MAX];
int ans[MAX];
inline ll sq(ll x) {
	return x * x;
}
inline bool chk(int i, int j) {
	return sq(X[i] - X[j]) + sq(Y[i] - Y[j]) <= sq(R[i] + R[j]);
}
bool isrange(int x, int y) {
	if (x < 0 || y < 0) return false;
	return true;
}
inline ll trans(int x, int y) {
	return ((ll)x * (ll)INF) + y;
}
bool cmp(pair<pi, pi>& p1, pair<pi, pi>& p2) {
	if (p1.first.first == p2.first.first) return p1.first.second < p2.first.second;
	else return p1.first.first > p2.first.first;
}
unordered_map<ll, vector<int>> mp;
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N;
	cin >> N;
	int i;
	for (i = 1; i <= N; i++) cin >> in[i].second.first >> in[i].second.second >> in[i].first.first, in[i].first.second = i;
	sort(in + 1, in + N + 1, cmp);
	for (i = 1; i <= N; i++) tie(X[i], Y[i], R[i], ind[i]) = make_tuple(in[i].second.first + INF, in[i].second.second + INF, in[i].first.first, in[i].first.second);
	int k;
	int s, e;
	e = 0;
	for (k = 30; k >= 0; k--) {
		int r = 1 << k;
		s = e + 1;
		if (R[s] < r / 2) continue;
		mp.clear();
		e = 0;
		for (i = s; i <= N; i++) {
			if (ans[i]) continue;
			int x, y;
			x = X[i] >> k;
			y = Y[i] >> k;
			if (R[i] < r / 2 && !e) e = i - 1;
            int xx, yy;
			for (xx = x - 1; xx <= x + 1; xx++) for (yy = y - 1; yy <= y + 1; yy++) {
				mp[((ll)xx << 31LL) + yy].push_back(i);
			}
			
		}
		if (e == 0) e = N;
		for (i = s; i <= e; i++) {
			if (ans[i]) continue;
			ans[i] = i;
			int x, y;
			x = X[i] >>k;
			y = Y[i] >>k;
			int xx, yy;
			for (xx = x - 1; xx <= x + 1; xx++) for (yy = y - 1; yy <= y + 1; yy++) {
				ll t = ((ll)xx << 31LL) + yy;
				for (auto c : mp[t]) if (!ans[c] && chk(c, i)) ans[c] = i;
			}
		}
	}
	for (i = 1; i <= N; i++) ri[ind[i]] = i;
	for (i = 1; i <= N; i++) cout << ind[ans[ri[i]]] << bb;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 4 ms 716 KB Output is correct
20 Correct 4 ms 716 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 19 ms 4776 KB Output is correct
23 Correct 22 ms 4808 KB Output is correct
24 Correct 21 ms 4776 KB Output is correct
25 Correct 18 ms 4776 KB Output is correct
26 Correct 20 ms 4720 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 22056 KB Output is correct
2 Correct 227 ms 22176 KB Output is correct
3 Correct 205 ms 22228 KB Output is correct
4 Correct 238 ms 21752 KB Output is correct
5 Correct 307 ms 33716 KB Output is correct
6 Correct 1622 ms 65120 KB Output is correct
7 Correct 373 ms 32216 KB Output is correct
8 Correct 671 ms 40076 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1000 ms 84432 KB Output is correct
3 Correct 2967 ms 247080 KB Output is correct
4 Correct 2847 ms 247184 KB Output is correct
5 Execution timed out 3062 ms 162932 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1484 ms 248280 KB Output is correct
2 Correct 1483 ms 248360 KB Output is correct
3 Correct 489 ms 40056 KB Output is correct
4 Correct 1441 ms 251356 KB Output is correct
5 Correct 1504 ms 251620 KB Output is correct
6 Correct 305 ms 35012 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 4 ms 716 KB Output is correct
20 Correct 4 ms 716 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 19 ms 4776 KB Output is correct
23 Correct 22 ms 4808 KB Output is correct
24 Correct 21 ms 4776 KB Output is correct
25 Correct 18 ms 4776 KB Output is correct
26 Correct 20 ms 4720 KB Output is correct
27 Correct 7 ms 1228 KB Output is correct
28 Correct 8 ms 1228 KB Output is correct
29 Correct 7 ms 1100 KB Output is correct
30 Correct 53 ms 9256 KB Output is correct
31 Correct 85 ms 9300 KB Output is correct
32 Correct 43 ms 9308 KB Output is correct
33 Correct 68 ms 7440 KB Output is correct
34 Correct 70 ms 7444 KB Output is correct
35 Correct 72 ms 7904 KB Output is correct
36 Correct 994 ms 86472 KB Output is correct
37 Correct 942 ms 86488 KB Output is correct
38 Correct 1060 ms 86352 KB Output is correct
39 Correct 734 ms 17748 KB Output is correct
40 Correct 675 ms 17660 KB Output is correct
41 Correct 662 ms 17644 KB Output is correct
42 Correct 167 ms 15144 KB Output is correct
43 Correct 433 ms 81812 KB Output is correct
44 Correct 669 ms 81720 KB Output is correct
45 Correct 455 ms 81692 KB Output is correct
46 Correct 461 ms 81724 KB Output is correct
47 Correct 493 ms 81844 KB Output is correct
48 Correct 453 ms 81824 KB Output is correct
49 Correct 459 ms 81796 KB Output is correct
50 Correct 480 ms 81740 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 4 ms 716 KB Output is correct
20 Correct 4 ms 716 KB Output is correct
21 Correct 4 ms 844 KB Output is correct
22 Correct 19 ms 4776 KB Output is correct
23 Correct 22 ms 4808 KB Output is correct
24 Correct 21 ms 4776 KB Output is correct
25 Correct 18 ms 4776 KB Output is correct
26 Correct 20 ms 4720 KB Output is correct
27 Correct 209 ms 22056 KB Output is correct
28 Correct 227 ms 22176 KB Output is correct
29 Correct 205 ms 22228 KB Output is correct
30 Correct 238 ms 21752 KB Output is correct
31 Correct 307 ms 33716 KB Output is correct
32 Correct 1622 ms 65120 KB Output is correct
33 Correct 373 ms 32216 KB Output is correct
34 Correct 671 ms 40076 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1000 ms 84432 KB Output is correct
37 Correct 2967 ms 247080 KB Output is correct
38 Correct 2847 ms 247184 KB Output is correct
39 Execution timed out 3062 ms 162932 KB Time limit exceeded
40 Halted 0 ms 0 KB -