oj.uz

Submission #817149

# Submission time Handle Problem Language Result Execution time Memory
817149 2023-08-09T09:50:45 Z rainboy Cell Automaton (JOI23_cell) C
32 / 100
 434 ms 127436 KB 
#include <stdio.h>

#define N	100000
#define X	2000
#define T	1000

int min(int a, int b) { return a < b ? a : b; }

unsigned int Z = 12345;

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

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

int compare_x(int i, int j) { return xx[i] - xx[j]; }
int compare_t(int i, int j) { return tt[i] - tt[j]; }

int (*compare)(int, int);

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 = compare(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 main() {
	static int ii[N], dd[X * 2 + 1][X * 2 + 1], nn[T + 1];
	int n, q, i, i_, x, y, t, subtask;
	long long a, b;

	scanf("%d%d", &n, &q);
	for (i = 0; i < n; i++)
		scanf("%d%d", &xx[i], &yy[i]);
	subtask = 3;
	for (i = 0; i < n; i++)
		if (xx[i] != yy[i]) {
			subtask = 2;
			break;
		}
	if (subtask == 2) {
		for (x = 0; x <= X * 2; x++)
			for (y = 0; y <= X * 2; y++)
				dd[x][y] = T + 1;
		for (i = 0; i < n; i++)
			dd[X + xx[i]][X + yy[i]] = 0;
		for (x = 0; x <= X * 2; x++) {
			for (y = 1; y <= X * 2; y++)
				dd[x][y] = min(dd[x][y], dd[x][y - 1] + 1);
			for (y = X * 2 - 1; y >= 0; y--)
				dd[x][y] = min(dd[x][y], dd[x][y + 1] + 1);
		}
		for (y = 0; y <= X * 2; y++) {
			for (x = 1; x <= X * 2; x++)
				dd[x][y] = min(dd[x][y], dd[x - 1][y] + 1);
			for (x = X * 2 - 1; x >= 0; x--)
				dd[x][y] = min(dd[x][y], dd[x + 1][y] + 1);
		}
		for (x = 0; x <= X * 2; x++)
			for (y = 0; y <= X * 2; y++)
				if (dd[x][y] <= T)
					nn[dd[x][y]]++;
		while (q--) {
			scanf("%d", &t);
			printf("%d\n", nn[t]);
		}
	} else {
		for (i = 0; i < n; i++)
			ii[i] = i;
		compare = compare_x, sort(ii, 0, n);
		for (i = 0; i + 1 < n; i++) {
			tt[i] = xx[ii[i + 1]] - xx[ii[i]];
			ii[i] = i;
		}
		compare = compare_t, sort(ii, 0, n - 1);
		i = 0, a = n * 4, b = 0;
		while (q--) {
			long long ans;

			scanf("%d", &t);
			if (t == 0)
				printf("%d\n", n);
			else {
				while (i < n - 1 && tt[i_ = ii[i]] < t) {
					a -= 4, b += (long long) tt[i_] * 2;
					i++;
				}
				ans = 0;
				while (i < n - 1 && tt[i_ = ii[i]] == t) {
					ans += t - 1;
					a -= 4, b += (long long) tt[i_] * 2;
					i++;
				}
				ans += a * t + b;
				printf("%lld\n", ans);
			}
		}
	}
	return 0;
}

Compilation message

cell.c: In function 'main':
cell.c:49:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |  scanf("%d%d", &n, &q);
      |  ^~~~~~~~~~~~~~~~~~~~~
cell.c:51:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |   scanf("%d%d", &xx[i], &yy[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cell.c:81:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |    scanf("%d", &t);
      |    ^~~~~~~~~~~~~~~
cell.c:97:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |    scanf("%d", &t);
      |    ^~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 62932 KB Output is correct
2 Correct 394 ms 62928 KB Output is correct
3 Correct 404 ms 62928 KB Output is correct
4 Correct 430 ms 62932 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 399 ms 63008 KB Output is correct
9 Correct 402 ms 62924 KB Output is correct
10 Correct 386 ms 62932 KB Output is correct
11 Correct 404 ms 62932 KB Output is correct
12 Correct 422 ms 62936 KB Output is correct
13 Correct 390 ms 62940 KB Output is correct
14 Correct 379 ms 62936 KB Output is correct
15 Correct 378 ms 62936 KB Output is correct
16 Correct 397 ms 62928 KB Output is correct
17 Correct 417 ms 62924 KB Output is correct
18 Correct 390 ms 62932 KB Output is correct
19 Correct 388 ms 62928 KB Output is correct
20 Correct 382 ms 62928 KB Output is correct
21 Correct 356 ms 62932 KB Output is correct
22 Correct 378 ms 62924 KB Output is correct
23 Correct 367 ms 62924 KB Output is correct
24 Correct 370 ms 62928 KB Output is correct
25 Correct 377 ms 62944 KB Output is correct
26 Correct 398 ms 62932 KB Output is correct
27 Correct 392 ms 62924 KB Output is correct
28 Correct 389 ms 62932 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 62932 KB Output is correct
2 Correct 394 ms 62928 KB Output is correct
3 Correct 404 ms 62928 KB Output is correct
4 Correct 430 ms 62932 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 399 ms 63008 KB Output is correct
9 Correct 402 ms 62924 KB Output is correct
10 Correct 386 ms 62932 KB Output is correct
11 Correct 404 ms 62932 KB Output is correct
12 Correct 422 ms 62936 KB Output is correct
13 Correct 390 ms 62940 KB Output is correct
14 Correct 379 ms 62936 KB Output is correct
15 Correct 378 ms 62936 KB Output is correct
16 Correct 397 ms 62928 KB Output is correct
17 Correct 417 ms 62924 KB Output is correct
18 Correct 390 ms 62932 KB Output is correct
19 Correct 388 ms 62928 KB Output is correct
20 Correct 382 ms 62928 KB Output is correct
21 Correct 356 ms 62932 KB Output is correct
22 Correct 378 ms 62924 KB Output is correct
23 Correct 367 ms 62924 KB Output is correct
24 Correct 370 ms 62928 KB Output is correct
25 Correct 377 ms 62944 KB Output is correct
26 Correct 398 ms 62932 KB Output is correct
27 Correct 392 ms 62924 KB Output is correct
28 Correct 389 ms 62932 KB Output is correct
29 Correct 393 ms 62932 KB Output is correct
30 Correct 401 ms 62924 KB Output is correct
31 Correct 398 ms 62932 KB Output is correct
32 Correct 434 ms 63708 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 397 ms 62940 KB Output is correct
37 Correct 392 ms 62924 KB Output is correct
38 Correct 395 ms 62936 KB Output is correct
39 Correct 418 ms 62932 KB Output is correct
40 Correct 420 ms 63708 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 1748 KB Output is correct
2 Correct 45 ms 1836 KB Output is correct
3 Correct 46 ms 1832 KB Output is correct
4 Correct 46 ms 1836 KB Output is correct
5 Correct 45 ms 1744 KB Output is correct
6 Correct 45 ms 1740 KB Output is correct
7 Correct 51 ms 1864 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 45 ms 1780 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 1748 KB Output is correct
2 Correct 45 ms 1836 KB Output is correct
3 Correct 46 ms 1832 KB Output is correct
4 Correct 46 ms 1836 KB Output is correct
5 Correct 45 ms 1744 KB Output is correct
6 Correct 45 ms 1740 KB Output is correct
7 Correct 51 ms 1864 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 45 ms 1780 KB Output is correct
12 Correct 148 ms 7316 KB Output is correct
13 Correct 158 ms 7340 KB Output is correct
14 Correct 146 ms 7244 KB Output is correct
15 Correct 150 ms 7348 KB Output is correct
16 Correct 97 ms 4092 KB Output is correct
17 Correct 92 ms 3952 KB Output is correct
18 Correct 104 ms 5728 KB Output is correct
19 Correct 153 ms 7336 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 94 ms 127436 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 94 ms 127436 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 62932 KB Output is correct
2 Correct 394 ms 62928 KB Output is correct
3 Correct 404 ms 62928 KB Output is correct
4 Correct 430 ms 62932 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 399 ms 63008 KB Output is correct
9 Correct 402 ms 62924 KB Output is correct
10 Correct 386 ms 62932 KB Output is correct
11 Correct 404 ms 62932 KB Output is correct
12 Correct 422 ms 62936 KB Output is correct
13 Correct 390 ms 62940 KB Output is correct
14 Correct 379 ms 62936 KB Output is correct
15 Correct 378 ms 62936 KB Output is correct
16 Correct 397 ms 62928 KB Output is correct
17 Correct 417 ms 62924 KB Output is correct
18 Correct 390 ms 62932 KB Output is correct
19 Correct 388 ms 62928 KB Output is correct
20 Correct 382 ms 62928 KB Output is correct
21 Correct 356 ms 62932 KB Output is correct
22 Correct 378 ms 62924 KB Output is correct
23 Correct 367 ms 62924 KB Output is correct
24 Correct 370 ms 62928 KB Output is correct
25 Correct 377 ms 62944 KB Output is correct
26 Correct 398 ms 62932 KB Output is correct
27 Correct 392 ms 62924 KB Output is correct
28 Correct 389 ms 62932 KB Output is correct
29 Correct 393 ms 62932 KB Output is correct
30 Correct 401 ms 62924 KB Output is correct
31 Correct 398 ms 62932 KB Output is correct
32 Correct 434 ms 63708 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 397 ms 62940 KB Output is correct
37 Correct 392 ms 62924 KB Output is correct
38 Correct 395 ms 62936 KB Output is correct
39 Correct 418 ms 62932 KB Output is correct
40 Correct 420 ms 63708 KB Output is correct
41 Correct 45 ms 1748 KB Output is correct
42 Correct 45 ms 1836 KB Output is correct
43 Correct 46 ms 1832 KB Output is correct
44 Correct 46 ms 1836 KB Output is correct
45 Correct 45 ms 1744 KB Output is correct
46 Correct 45 ms 1740 KB Output is correct
47 Correct 51 ms 1864 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 45 ms 1780 KB Output is correct
52 Correct 148 ms 7316 KB Output is correct
53 Correct 158 ms 7340 KB Output is correct
54 Correct 146 ms 7244 KB Output is correct
55 Correct 150 ms 7348 KB Output is correct
56 Correct 97 ms 4092 KB Output is correct
57 Correct 92 ms 3952 KB Output is correct
58 Correct 104 ms 5728 KB Output is correct
59 Correct 153 ms 7336 KB Output is correct
60 Runtime error 94 ms 127436 KB Execution killed with signal 11
61 Halted 0 ms 0 KB -