oj.uz

답안 #381752

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
381752 2021-03-25T20:23:12 Z rainboy 원 고르기 (APIO18_circle_selection) C
49 / 100
 3000 ms 161096 KB 
#include <stdio.h>
#include <string.h>

#define N	300000
#define X	1000000000
#define C	25

unsigned int Z = 12345;

int rand_() {
	return (Z *= 3) >> 1;
}

int xx[N], yy[N], rr[N];

#define intersect(i, j) ((long long) (xx[i] - xx[j]) * (xx[i] - xx[j]) + (long long) (yy[i] - yy[j]) * (yy[i] - yy[j]) <= (long long) (rr[i] + rr[j]) * (rr[i] + rr[j]))

void sort(int *ii, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;

		while (j < k) {
			int c = rr[ii[j]] != rr[i_] ? rr[i_] - rr[ii[j]] : ii[j] - i_;

			if (c == 0)
				j++;
			else if (c < 0) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		}
		sort(ii, l, i);
		l = k;
	}
}

#define compare(x1, y1, x2, y2) (x1 != x2 ? (x1 < x2 ? -1 : 1) : (y1 == y2 ? 0 : (y1 < y2 ? -1 : 1)))

int main() {
	static char type[N];
	static int xx_[N], yy_[N], ii[N], ii_[N], tmp[N], ggg[N][C], gg[C], iii[N][C * 4], kk[N], pp[N];
	int n, g, h, h_, i, j, k, c, lg, cnt;

	scanf("%d", &n);
	for (i = 0; i < n; i++) {
		scanf("%d%d%d", &xx[i], &yy[i], &rr[i]);
		xx[i] += X, yy[i] += X;
		ii[i] = ii_[i] = i;
	}
	sort(ii, 0, n);
	for (lg = 30, h = 0; lg >= 0; lg--) {
		int x, y;

		for (i = 0; i < n; i++)
			xx_[i] = xx[i] >> lg + 1, yy_[i] = yy[i] >> lg + 1;
		memset(gg, 0, C * sizeof *gg);
		for (h_ = 0; h_ < n; h_++) {
			i = ii_[h_], x = xx_[i], y = yy_[i];
			for (c = 0; c < C; c++) {
				int dx = c / 5 - 2, dy = c % 5 - 2;

				while (gg[c] < n && compare(xx_[ii_[gg[c]]], yy_[ii_[gg[c]]], x + dx, y + dy) < 0)
					gg[c]++;
				ggg[i][c] = gg[c] < n && compare(xx_[ii_[gg[c]]], yy_[ii_[gg[c]]], x + dx, y + dy) == 0 ? gg[c] : -1;
			}
		}
		memset(kk, 0, n * sizeof *kk);
		for (h_ = h; h_ < n; h_++) {
			int p;

			i = ii[h_], x = xx_[i], y = yy_[i], p = -1;
			if (type[i] == -1)
				continue;
			g = ggg[i][(0 + 2) * 5 + (0 + 2)];
			if (g != -1)
				for (k = 0; k < kk[g]; k++) {
					j = iii[g][k];
					if (intersect(i, j)) {
						if (p == -1 || rr[p] < rr[j] || rr[p] == rr[j] && p > j)
							p = j;
						break;
					}
				}
			if (p != -1)
				pp[i] = p, type[i] = -1;
			else {
				pp[i] = i, type[i] = 1;
				if (rr[i] >= 1 << lg)
					for (c = 0; c < C; c++) {
						g = ggg[i][c];
						if (g != -1)
							iii[g][kk[g]++] = i;
					}
			}
		}
		while (h < n && rr[ii[h]] >= 1 << lg)
			h++;
		for (i = 0; i < n; i = j) {
			x = xx_[ii_[i]];
			j = i + 1;
			while (j < n && xx_[ii_[j]] == x)
				j++;
			cnt = 0;
			for (h_ = i; h_ < j; h_++)
				if ((xx[ii_[h_]] >> lg & 1) == 0)
					ii_[i++] = ii_[h_];
				else
					tmp[cnt++] = ii_[h_];
			memcpy(ii_ + i, tmp, cnt * sizeof *tmp);
		}
		for (i = 0; i < n; i = j) {
			x = xx[ii_[i]] >> lg, y = yy_[ii_[i]];
			j = i + 1;
			while (j < n && (xx[ii_[j]] >> lg) == x && yy_[ii_[j]] == y)
				j++;
			cnt = 0;
			for (h_ = i; h_ < j; h_++)
				if ((yy[ii_[h_]] >> lg & 1) == 0)
					ii_[i++] = ii_[h_];
				else
					tmp[cnt++] = ii_[h_];
			memcpy(ii_ + i, tmp, cnt * sizeof *tmp);
		}
	}
	for (i = 0; i < n; i++)
		printf("%d ", pp[i] + 1);
	printf("\n");
	return 0;
}

Compilation message

circle_selection.c: In function 'main':
circle_selection.c:58:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   58 |    xx_[i] = xx[i] >> lg + 1, yy_[i] = yy[i] >> lg + 1;
      |                      ~~~^~~
circle_selection.c:58:51: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   58 |    xx_[i] = xx[i] >> lg + 1, yy_[i] = yy[i] >> lg + 1;
      |                                                ~~~^~~
circle_selection.c:82:54: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   82 |       if (p == -1 || rr[p] < rr[j] || rr[p] == rr[j] && p > j)
      |                                       ~~~~~~~~~~~~~~~^~~~~~~~
circle_selection.c:47:2: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   47 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
circle_selection.c:49:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   49 |   scanf("%d%d%d", &xx[i], &yy[i], &rr[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 7 ms 620 KB Output is correct
17 Correct 7 ms 492 KB Output is correct
18 Correct 7 ms 492 KB Output is correct
19 Correct 34 ms 1132 KB Output is correct
20 Correct 33 ms 1152 KB Output is correct
21 Correct 38 ms 1260 KB Output is correct
22 Correct 36 ms 3052 KB Output is correct
23 Correct 35 ms 3052 KB Output is correct
24 Correct 36 ms 3052 KB Output is correct
25 Correct 36 ms 3052 KB Output is correct
26 Correct 37 ms 3052 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2508 ms 43564 KB Output is correct
2 Correct 2497 ms 43372 KB Output is correct
3 Correct 2487 ms 43540 KB Output is correct
4 Correct 2559 ms 43628 KB Output is correct
5 Correct 2117 ms 83348 KB Output is correct
6 Correct 2539 ms 161096 KB Output is correct
7 Correct 2325 ms 118124 KB Output is correct
8 Correct 2426 ms 155824 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1000 ms 53740 KB Output is correct
3 Execution timed out 3095 ms 158572 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3078 ms 160600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 7 ms 620 KB Output is correct
17 Correct 7 ms 492 KB Output is correct
18 Correct 7 ms 492 KB Output is correct
19 Correct 34 ms 1132 KB Output is correct
20 Correct 33 ms 1152 KB Output is correct
21 Correct 38 ms 1260 KB Output is correct
22 Correct 36 ms 3052 KB Output is correct
23 Correct 35 ms 3052 KB Output is correct
24 Correct 36 ms 3052 KB Output is correct
25 Correct 36 ms 3052 KB Output is correct
26 Correct 37 ms 3052 KB Output is correct
27 Correct 68 ms 2156 KB Output is correct
28 Correct 69 ms 1900 KB Output is correct
29 Correct 68 ms 1900 KB Output is correct
30 Correct 71 ms 5724 KB Output is correct
31 Correct 71 ms 5740 KB Output is correct
32 Correct 73 ms 5868 KB Output is correct
33 Correct 856 ms 14732 KB Output is correct
34 Correct 857 ms 14828 KB Output is correct
35 Correct 861 ms 18796 KB Output is correct
36 Correct 947 ms 53868 KB Output is correct
37 Correct 951 ms 53868 KB Output is correct
38 Correct 941 ms 53996 KB Output is correct
39 Correct 632 ms 53868 KB Output is correct
40 Correct 634 ms 53996 KB Output is correct
41 Correct 627 ms 53868 KB Output is correct
42 Correct 633 ms 53860 KB Output is correct
43 Correct 811 ms 53740 KB Output is correct
44 Correct 817 ms 53680 KB Output is correct
45 Correct 857 ms 53656 KB Output is correct
46 Correct 811 ms 53740 KB Output is correct
47 Correct 826 ms 53740 KB Output is correct
48 Correct 838 ms 53684 KB Output is correct
49 Correct 817 ms 53740 KB Output is correct
50 Correct 814 ms 53684 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 7 ms 620 KB Output is correct
17 Correct 7 ms 492 KB Output is correct
18 Correct 7 ms 492 KB Output is correct
19 Correct 34 ms 1132 KB Output is correct
20 Correct 33 ms 1152 KB Output is correct
21 Correct 38 ms 1260 KB Output is correct
22 Correct 36 ms 3052 KB Output is correct
23 Correct 35 ms 3052 KB Output is correct
24 Correct 36 ms 3052 KB Output is correct
25 Correct 36 ms 3052 KB Output is correct
26 Correct 37 ms 3052 KB Output is correct
27 Correct 2508 ms 43564 KB Output is correct
28 Correct 2497 ms 43372 KB Output is correct
29 Correct 2487 ms 43540 KB Output is correct
30 Correct 2559 ms 43628 KB Output is correct
31 Correct 2117 ms 83348 KB Output is correct
32 Correct 2539 ms 161096 KB Output is correct
33 Correct 2325 ms 118124 KB Output is correct
34 Correct 2426 ms 155824 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1000 ms 53740 KB Output is correct
37 Execution timed out 3095 ms 158572 KB Time limit exceeded
38 Halted 0 ms 0 KB -