oj.uz

Submission #533453

# Submission time Handle Problem Language Result Execution time Memory
533453 2022-03-06T05:17:43 Z jjang36524 Circle selection (APIO18_circle_selection) C++14
64 / 100
 3000 ms 479568 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<pll, pll> in[MAX];
ll X[MAX];
ll Y[MAX];
ll R[MAX];
ll 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<pll, pll>& p1, pair<pll, pll>& 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;
			mp[((ll)x << 31LL) + y].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] / r;
			y = Y[i] / r;
			int xx, yy;
			for (xx = x - 2; xx <= x + 2; xx++) for (yy = y - 2; yy <= y + 2; yy++) {
				ll t = ((ll)xx << 31LL) + yy;
				vector<int> v;
									for (auto c : mp[t]) {
						if (chk(c, i)) ans[c] = i;
						else v.push_back(c);
					}
					mp[t] = v;
			}
		}
	}
	for (i = 1; i <= N; i++) ri[ind[i]] = i;
	for (i = 1; i <= N; i++) cout << ind[ans[ri[i]]] << bb;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:64:8: warning: unused variable 'xx' [-Wunused-variable]
   64 |    int xx, yy;
      |        ^~
circle_selection.cpp:64:12: warning: unused variable 'yy' [-Wunused-variable]
   64 |    int xx, yy;
      |            ^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 320 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 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 1 ms 456 KB Output is correct
17 Correct 1 ms 372 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 844 KB Output is correct
20 Correct 3 ms 824 KB Output is correct
21 Correct 4 ms 848 KB Output is correct
22 Correct 22 ms 4152 KB Output is correct
23 Correct 23 ms 4348 KB Output is correct
24 Correct 23 ms 3888 KB Output is correct
25 Correct 24 ms 4060 KB Output is correct
26 Correct 21 ms 4280 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 24396 KB Output is correct
2 Correct 196 ms 24252 KB Output is correct
3 Correct 174 ms 23916 KB Output is correct
4 Correct 188 ms 23868 KB Output is correct
5 Correct 197 ms 26780 KB Output is correct
6 Correct 1093 ms 61504 KB Output is correct
7 Correct 247 ms 28664 KB Output is correct
8 Correct 350 ms 35488 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 923 ms 70908 KB Output is correct
3 Correct 2910 ms 187352 KB Output is correct
4 Correct 2833 ms 180748 KB Output is correct
5 Correct 2312 ms 152884 KB Output is correct
6 Correct 805 ms 71956 KB Output is correct
7 Correct 418 ms 58288 KB Output is correct
8 Correct 50 ms 9812 KB Output is correct
9 Correct 2836 ms 172912 KB Output is correct
10 Correct 1694 ms 145476 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3061 ms 479568 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 320 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 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 1 ms 456 KB Output is correct
17 Correct 1 ms 372 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 844 KB Output is correct
20 Correct 3 ms 824 KB Output is correct
21 Correct 4 ms 848 KB Output is correct
22 Correct 22 ms 4152 KB Output is correct
23 Correct 23 ms 4348 KB Output is correct
24 Correct 23 ms 3888 KB Output is correct
25 Correct 24 ms 4060 KB Output is correct
26 Correct 21 ms 4280 KB Output is correct
27 Correct 6 ms 1356 KB Output is correct
28 Correct 6 ms 1356 KB Output is correct
29 Correct 6 ms 1368 KB Output is correct
30 Correct 42 ms 8688 KB Output is correct
31 Correct 42 ms 8680 KB Output is correct
32 Correct 40 ms 7420 KB Output is correct
33 Correct 57 ms 8648 KB Output is correct
34 Correct 55 ms 8652 KB Output is correct
35 Correct 54 ms 8748 KB Output is correct
36 Correct 862 ms 76340 KB Output is correct
37 Correct 892 ms 69376 KB Output is correct
38 Correct 840 ms 77228 KB Output is correct
39 Correct 247 ms 14444 KB Output is correct
40 Correct 246 ms 14676 KB Output is correct
41 Correct 248 ms 14496 KB Output is correct
42 Correct 120 ms 13972 KB Output is correct
43 Correct 790 ms 136496 KB Output is correct
44 Correct 965 ms 136600 KB Output is correct
45 Correct 784 ms 136532 KB Output is correct
46 Correct 883 ms 136668 KB Output is correct
47 Correct 789 ms 136804 KB Output is correct
48 Correct 791 ms 136736 KB Output is correct
49 Correct 787 ms 136772 KB Output is correct
50 Correct 792 ms 136556 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 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 320 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 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 1 ms 456 KB Output is correct
17 Correct 1 ms 372 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 844 KB Output is correct
20 Correct 3 ms 824 KB Output is correct
21 Correct 4 ms 848 KB Output is correct
22 Correct 22 ms 4152 KB Output is correct
23 Correct 23 ms 4348 KB Output is correct
24 Correct 23 ms 3888 KB Output is correct
25 Correct 24 ms 4060 KB Output is correct
26 Correct 21 ms 4280 KB Output is correct
27 Correct 162 ms 24396 KB Output is correct
28 Correct 196 ms 24252 KB Output is correct
29 Correct 174 ms 23916 KB Output is correct
30 Correct 188 ms 23868 KB Output is correct
31 Correct 197 ms 26780 KB Output is correct
32 Correct 1093 ms 61504 KB Output is correct
33 Correct 247 ms 28664 KB Output is correct
34 Correct 350 ms 35488 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 923 ms 70908 KB Output is correct
37 Correct 2910 ms 187352 KB Output is correct
38 Correct 2833 ms 180748 KB Output is correct
39 Correct 2312 ms 152884 KB Output is correct
40 Correct 805 ms 71956 KB Output is correct
41 Correct 418 ms 58288 KB Output is correct
42 Correct 50 ms 9812 KB Output is correct
43 Correct 2836 ms 172912 KB Output is correct
44 Correct 1694 ms 145476 KB Output is correct
45 Execution timed out 3061 ms 479568 KB Time limit exceeded
46 Halted 0 ms 0 KB -