oj.uz

Submission #533448

# Submission time Handle Problem Language Result Execution time Memory
533448 2022-03-06T05:08:04 Z jjang36524 Circle selection (APIO18_circle_selection) C++14
64 / 100
 3000 ms 470128 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;
			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 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 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 0 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 460 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Correct 5 ms 540 KB Output is correct
22 Correct 21 ms 3928 KB Output is correct
23 Correct 21 ms 4148 KB Output is correct
24 Correct 19 ms 3624 KB Output is correct
25 Correct 18 ms 3844 KB Output is correct
26 Correct 19 ms 3972 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 15024 KB Output is correct
2 Correct 157 ms 14764 KB Output is correct
3 Correct 163 ms 14576 KB Output is correct
4 Correct 141 ms 14392 KB Output is correct
5 Correct 230 ms 17236 KB Output is correct
6 Correct 982 ms 52140 KB Output is correct
7 Correct 233 ms 18972 KB Output is correct
8 Correct 286 ms 25940 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 917 ms 67740 KB Output is correct
3 Correct 2837 ms 177896 KB Output is correct
4 Correct 2816 ms 171172 KB Output is correct
5 Correct 2329 ms 143776 KB Output is correct
6 Correct 785 ms 67044 KB Output is correct
7 Correct 399 ms 55592 KB Output is correct
8 Correct 44 ms 9016 KB Output is correct
9 Correct 2822 ms 163532 KB Output is correct
10 Correct 1700 ms 135928 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 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 0 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 460 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Correct 5 ms 540 KB Output is correct
22 Correct 21 ms 3928 KB Output is correct
23 Correct 21 ms 4148 KB Output is correct
24 Correct 19 ms 3624 KB Output is correct
25 Correct 18 ms 3844 KB Output is correct
26 Correct 19 ms 3972 KB Output is correct
27 Correct 5 ms 844 KB Output is correct
28 Correct 5 ms 844 KB Output is correct
29 Correct 6 ms 820 KB Output is correct
30 Correct 42 ms 8328 KB Output is correct
31 Correct 45 ms 8176 KB Output is correct
32 Correct 40 ms 6920 KB Output is correct
33 Correct 50 ms 4928 KB Output is correct
34 Correct 51 ms 4996 KB Output is correct
35 Correct 52 ms 5076 KB Output is correct
36 Correct 821 ms 72960 KB Output is correct
37 Correct 888 ms 66144 KB Output is correct
38 Correct 831 ms 73528 KB Output is correct
39 Correct 232 ms 10976 KB Output is correct
40 Correct 227 ms 10996 KB Output is correct
41 Correct 230 ms 11036 KB Output is correct
42 Correct 103 ms 10244 KB Output is correct
43 Correct 802 ms 132840 KB Output is correct
44 Correct 954 ms 133028 KB Output is correct
45 Correct 764 ms 132840 KB Output is correct
46 Correct 903 ms 133064 KB Output is correct
47 Correct 777 ms 133140 KB Output is correct
48 Correct 784 ms 133136 KB Output is correct
49 Correct 780 ms 133160 KB Output is correct
50 Correct 783 ms 133076 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 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 0 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 460 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Correct 5 ms 540 KB Output is correct
22 Correct 21 ms 3928 KB Output is correct
23 Correct 21 ms 4148 KB Output is correct
24 Correct 19 ms 3624 KB Output is correct
25 Correct 18 ms 3844 KB Output is correct
26 Correct 19 ms 3972 KB Output is correct
27 Correct 153 ms 15024 KB Output is correct
28 Correct 157 ms 14764 KB Output is correct
29 Correct 163 ms 14576 KB Output is correct
30 Correct 141 ms 14392 KB Output is correct
31 Correct 230 ms 17236 KB Output is correct
32 Correct 982 ms 52140 KB Output is correct
33 Correct 233 ms 18972 KB Output is correct
34 Correct 286 ms 25940 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 917 ms 67740 KB Output is correct
37 Correct 2837 ms 177896 KB Output is correct
38 Correct 2816 ms 171172 KB Output is correct
39 Correct 2329 ms 143776 KB Output is correct
40 Correct 785 ms 67044 KB Output is correct
41 Correct 399 ms 55592 KB Output is correct
42 Correct 44 ms 9016 KB Output is correct
43 Correct 2822 ms 163532 KB Output is correct
44 Correct 1700 ms 135928 KB Output is correct
45 Execution timed out 3019 ms 470128 KB Time limit exceeded
46 Halted 0 ms 0 KB -