oj.uz

Submission #381765

# Submission time Handle Problem Language Result Execution time Memory
381765 2021-03-25T21:02:06 Z rainboy Circle selection (APIO18_circle_selection) C
37 / 100
 3000 ms 47212 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;
	}
}
 
int lt(int x1, int y1, int x2, int y2) {
	return x1 < x2 || x1 == x2 && y1 < y2;
}
 
int main() {
	static char type[N];
	static int xx_[N], yy_[N], ii[N], ii_[N], ii1[N], tmp[N], ggg[N][C], gg[C], iii[N * 4], kk[N], pp[N];
	int n, n1, 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);
		n1 = 0;
		for (h_ = 0; h_ < n; h_++) {
			i = ii_[h_];
			if (type[i] != -1 && rr[i] >= 1 << lg)
				ii1[n1++] = i;
		}
		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] < n1 && lt(xx_[ii1[gg[c]]], yy_[ii1[gg[c]]], x + dx, y + dy))
					gg[c]++;
				ggg[i][c] = gg[c] < n1 && !lt(x + dx, y + dy, xx_[ii1[gg[c]]], yy_[ii1[gg[c]]]) ? gg[c] : -1;
			}
		}
		memset(kk, 0, n1 * 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;
			for (c = 0; c < C; c++) {
				g = ggg[i][c];
				if (g == -1)
					continue;
				for (k = 0; k < kk[g]; k++) {
					j = iii[g << 2 | 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) {
					g = ggg[i][(0 + 2) * 5 + (0 + 2)];
					iii[g << 2 | 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 'lt':
circle_selection.c:41:29: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   41 |  return x1 < x2 || x1 == x2 && y1 < y2;
      |                    ~~~~~~~~~^~~~~~~~~~
circle_selection.c: In function 'main':
circle_selection.c:60:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   60 |    xx_[i] = xx[i] >> lg + 1, yy_[i] = yy[i] >> lg + 1;
      |                      ~~~^~~
circle_selection.c:60:51: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   60 |    xx_[i] = xx[i] >> lg + 1, yy_[i] = yy[i] >> lg + 1;
      |                                                ~~~^~~
circle_selection.c:92:54: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   92 |       if (p == -1 || rr[p] < rr[j] || rr[p] == rr[j] && p > j)
      |                                       ~~~~~~~~~~~~~~~^~~~~~~~
circle_selection.c:49:2: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   49 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
circle_selection.c:51:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   51 |   scanf("%d%d%d", &xx[i], &yy[i], &rr[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 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 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 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 512 KB Output is correct
12 Correct 2 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 6 ms 492 KB Output is correct
17 Correct 6 ms 492 KB Output is correct
18 Correct 6 ms 492 KB Output is correct
19 Correct 26 ms 1124 KB Output is correct
20 Correct 26 ms 1132 KB Output is correct
21 Correct 27 ms 1132 KB Output is correct
22 Correct 38 ms 1260 KB Output is correct
23 Correct 40 ms 1260 KB Output is correct
24 Correct 37 ms 1132 KB Output is correct
25 Correct 37 ms 1152 KB Output is correct
26 Correct 41 ms 1260 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2302 ms 43300 KB Output is correct
2 Correct 2307 ms 43308 KB Output is correct
3 Correct 2265 ms 43116 KB Output is correct
4 Correct 2199 ms 43096 KB Output is correct
5 Execution timed out 3071 ms 43420 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1080 ms 16620 KB Output is correct
3 Execution timed out 3073 ms 47212 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3037 ms 47084 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 364 KB Output is correct
2 Correct 2 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 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 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 512 KB Output is correct
12 Correct 2 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 6 ms 492 KB Output is correct
17 Correct 6 ms 492 KB Output is correct
18 Correct 6 ms 492 KB Output is correct
19 Correct 26 ms 1124 KB Output is correct
20 Correct 26 ms 1132 KB Output is correct
21 Correct 27 ms 1132 KB Output is correct
22 Correct 38 ms 1260 KB Output is correct
23 Correct 40 ms 1260 KB Output is correct
24 Correct 37 ms 1132 KB Output is correct
25 Correct 37 ms 1152 KB Output is correct
26 Correct 41 ms 1260 KB Output is correct
27 Correct 56 ms 1860 KB Output is correct
28 Correct 57 ms 1772 KB Output is correct
29 Correct 53 ms 1772 KB Output is correct
30 Correct 81 ms 2048 KB Output is correct
31 Correct 76 ms 2028 KB Output is correct
32 Correct 76 ms 2028 KB Output is correct
33 Correct 671 ms 14444 KB Output is correct
34 Correct 659 ms 14828 KB Output is correct
35 Correct 710 ms 14700 KB Output is correct
36 Correct 1083 ms 16876 KB Output is correct
37 Correct 1112 ms 16876 KB Output is correct
38 Correct 1111 ms 16876 KB Output is correct
39 Correct 800 ms 16748 KB Output is correct
40 Correct 800 ms 16748 KB Output is correct
41 Correct 801 ms 16748 KB Output is correct
42 Correct 754 ms 16620 KB Output is correct
43 Correct 876 ms 16552 KB Output is correct
44 Correct 874 ms 16620 KB Output is correct
45 Correct 864 ms 16620 KB Output is correct
46 Correct 872 ms 16492 KB Output is correct
47 Correct 886 ms 16620 KB Output is correct
48 Correct 885 ms 16616 KB Output is correct
49 Correct 931 ms 16492 KB Output is correct
50 Correct 943 ms 16480 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 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 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 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 512 KB Output is correct
12 Correct 2 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 6 ms 492 KB Output is correct
17 Correct 6 ms 492 KB Output is correct
18 Correct 6 ms 492 KB Output is correct
19 Correct 26 ms 1124 KB Output is correct
20 Correct 26 ms 1132 KB Output is correct
21 Correct 27 ms 1132 KB Output is correct
22 Correct 38 ms 1260 KB Output is correct
23 Correct 40 ms 1260 KB Output is correct
24 Correct 37 ms 1132 KB Output is correct
25 Correct 37 ms 1152 KB Output is correct
26 Correct 41 ms 1260 KB Output is correct
27 Correct 2302 ms 43300 KB Output is correct
28 Correct 2307 ms 43308 KB Output is correct
29 Correct 2265 ms 43116 KB Output is correct
30 Correct 2199 ms 43096 KB Output is correct
31 Execution timed out 3071 ms 43420 KB Time limit exceeded
32 Halted 0 ms 0 KB -