oj.uz

Submission #579082

# Submission time Handle Problem Language Result Execution time Memory
579082 2022-06-18T11:16:41 Z noedit Circle selection (APIO18_circle_selection) C++17
72 / 100
 3000 ms 248588 KB 
#include <bits/stdc++.h>
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 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 480 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 22 ms 4784 KB Output is correct
23 Correct 20 ms 4816 KB Output is correct
24 Correct 19 ms 4740 KB Output is correct
25 Correct 20 ms 4784 KB Output is correct
26 Correct 29 ms 4748 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 22076 KB Output is correct
2 Correct 203 ms 22196 KB Output is correct
3 Correct 200 ms 22340 KB Output is correct
4 Correct 198 ms 21788 KB Output is correct
5 Correct 309 ms 33656 KB Output is correct
6 Correct 1539 ms 65028 KB Output is correct
7 Correct 369 ms 32276 KB Output is correct
8 Correct 638 ms 40032 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 964 ms 84496 KB Output is correct
3 Correct 2707 ms 247220 KB Output is correct
4 Correct 2807 ms 247196 KB Output is correct
5 Execution timed out 3058 ms 162952 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1353 ms 248588 KB Output is correct
2 Correct 1369 ms 248340 KB Output is correct
3 Correct 513 ms 37364 KB Output is correct
4 Correct 1348 ms 248452 KB Output is correct
5 Correct 1340 ms 248464 KB Output is correct
6 Correct 294 ms 31948 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 480 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 22 ms 4784 KB Output is correct
23 Correct 20 ms 4816 KB Output is correct
24 Correct 19 ms 4740 KB Output is correct
25 Correct 20 ms 4784 KB Output is correct
26 Correct 29 ms 4748 KB Output is correct
27 Correct 7 ms 1236 KB Output is correct
28 Correct 7 ms 1236 KB Output is correct
29 Correct 8 ms 1108 KB Output is correct
30 Correct 41 ms 9312 KB Output is correct
31 Correct 60 ms 9268 KB Output is correct
32 Correct 64 ms 9356 KB Output is correct
33 Correct 69 ms 7504 KB Output is correct
34 Correct 67 ms 7532 KB Output is correct
35 Correct 70 ms 7820 KB Output is correct
36 Correct 980 ms 86484 KB Output is correct
37 Correct 945 ms 86668 KB Output is correct
38 Correct 1030 ms 86352 KB Output is correct
39 Correct 716 ms 17716 KB Output is correct
40 Correct 685 ms 17720 KB Output is correct
41 Correct 671 ms 17768 KB Output is correct
42 Correct 174 ms 15136 KB Output is correct
43 Correct 451 ms 81808 KB Output is correct
44 Correct 648 ms 81736 KB Output is correct
45 Correct 457 ms 81660 KB Output is correct
46 Correct 459 ms 81772 KB Output is correct
47 Correct 445 ms 81796 KB Output is correct
48 Correct 445 ms 81732 KB Output is correct
49 Correct 462 ms 81816 KB Output is correct
50 Correct 438 ms 81708 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 480 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 22 ms 4784 KB Output is correct
23 Correct 20 ms 4816 KB Output is correct
24 Correct 19 ms 4740 KB Output is correct
25 Correct 20 ms 4784 KB Output is correct
26 Correct 29 ms 4748 KB Output is correct
27 Correct 217 ms 22076 KB Output is correct
28 Correct 203 ms 22196 KB Output is correct
29 Correct 200 ms 22340 KB Output is correct
30 Correct 198 ms 21788 KB Output is correct
31 Correct 309 ms 33656 KB Output is correct
32 Correct 1539 ms 65028 KB Output is correct
33 Correct 369 ms 32276 KB Output is correct
34 Correct 638 ms 40032 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 964 ms 84496 KB Output is correct
37 Correct 2707 ms 247220 KB Output is correct
38 Correct 2807 ms 247196 KB Output is correct
39 Execution timed out 3058 ms 162952 KB Time limit exceeded
40 Halted 0 ms 0 KB -