oj.uz

답안 #579081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579081 2022-06-18T11:15:56 Z noedit 원 고르기 (APIO18_circle_selection) C++17
72 / 100
 3000 ms 248700 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O0")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 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 332 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 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 332 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 5 ms 904 KB Output is correct
20 Correct 4 ms 852 KB Output is correct
21 Correct 5 ms 956 KB Output is correct
22 Correct 48 ms 4876 KB Output is correct
23 Correct 28 ms 4884 KB Output is correct
24 Correct 24 ms 4912 KB Output is correct
25 Correct 23 ms 4920 KB Output is correct
26 Correct 31 ms 4888 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 22320 KB Output is correct
2 Correct 223 ms 22396 KB Output is correct
3 Correct 206 ms 22540 KB Output is correct
4 Correct 202 ms 22056 KB Output is correct
5 Correct 346 ms 34004 KB Output is correct
6 Correct 1636 ms 65320 KB Output is correct
7 Correct 406 ms 32464 KB Output is correct
8 Correct 551 ms 40176 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 996 ms 84708 KB Output is correct
3 Correct 2906 ms 247388 KB Output is correct
4 Correct 2967 ms 247344 KB Output is correct
5 Execution timed out 3102 ms 163124 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1372 ms 248540 KB Output is correct
2 Correct 1373 ms 248660 KB Output is correct
3 Correct 508 ms 37640 KB Output is correct
4 Correct 1369 ms 248700 KB Output is correct
5 Correct 1422 ms 248540 KB Output is correct
6 Correct 294 ms 32000 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 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 332 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 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 332 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 5 ms 904 KB Output is correct
20 Correct 4 ms 852 KB Output is correct
21 Correct 5 ms 956 KB Output is correct
22 Correct 48 ms 4876 KB Output is correct
23 Correct 28 ms 4884 KB Output is correct
24 Correct 24 ms 4912 KB Output is correct
25 Correct 23 ms 4920 KB Output is correct
26 Correct 31 ms 4888 KB Output is correct
27 Correct 7 ms 1260 KB Output is correct
28 Correct 7 ms 1264 KB Output is correct
29 Correct 7 ms 1108 KB Output is correct
30 Correct 44 ms 9344 KB Output is correct
31 Correct 66 ms 9376 KB Output is correct
32 Correct 48 ms 9316 KB Output is correct
33 Correct 69 ms 7504 KB Output is correct
34 Correct 74 ms 7504 KB Output is correct
35 Correct 68 ms 7832 KB Output is correct
36 Correct 1010 ms 86556 KB Output is correct
37 Correct 921 ms 86476 KB Output is correct
38 Correct 1027 ms 86380 KB Output is correct
39 Correct 657 ms 17688 KB Output is correct
40 Correct 653 ms 17656 KB Output is correct
41 Correct 675 ms 17712 KB Output is correct
42 Correct 173 ms 15240 KB Output is correct
43 Correct 456 ms 81728 KB Output is correct
44 Correct 646 ms 81784 KB Output is correct
45 Correct 475 ms 81688 KB Output is correct
46 Correct 461 ms 81724 KB Output is correct
47 Correct 448 ms 81932 KB Output is correct
48 Correct 442 ms 81916 KB Output is correct
49 Correct 453 ms 81900 KB Output is correct
50 Correct 444 ms 81748 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 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 332 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 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 332 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 5 ms 904 KB Output is correct
20 Correct 4 ms 852 KB Output is correct
21 Correct 5 ms 956 KB Output is correct
22 Correct 48 ms 4876 KB Output is correct
23 Correct 28 ms 4884 KB Output is correct
24 Correct 24 ms 4912 KB Output is correct
25 Correct 23 ms 4920 KB Output is correct
26 Correct 31 ms 4888 KB Output is correct
27 Correct 214 ms 22320 KB Output is correct
28 Correct 223 ms 22396 KB Output is correct
29 Correct 206 ms 22540 KB Output is correct
30 Correct 202 ms 22056 KB Output is correct
31 Correct 346 ms 34004 KB Output is correct
32 Correct 1636 ms 65320 KB Output is correct
33 Correct 406 ms 32464 KB Output is correct
34 Correct 551 ms 40176 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 996 ms 84708 KB Output is correct
37 Correct 2906 ms 247388 KB Output is correct
38 Correct 2967 ms 247344 KB Output is correct
39 Execution timed out 3102 ms 163124 KB Time limit exceeded
40 Halted 0 ms 0 KB -