oj.uz

Submission #731641

# Submission time Handle Problem Language Result Execution time Memory
731641 2023-04-27T17:29:32 Z rainboy Swimming competition (LMIO18_plaukimo_varzybos) C
100 / 100
 453 ms 11980 KB 
#include <stdio.h>

#define N	1000000
#define INF	0x3f3f3f3f

unsigned int X = 12345;

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

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

		while (j < k)
			if (xx[j] == x)
				j++;
			else if (xx[j] < x) {
				tmp = xx[i], xx[i] = xx[j], xx[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = xx[j], xx[j] = xx[k], xx[k] = tmp;
			}
		sort(xx, l, i);
		l = k;
	}
}

int solve(int *xx, int n, int a, int b, int d) {
	static char dp[N + 1];
	int i, i_, j;

	dp[0] = 1;
	for (i = 0, i_ = -1, j = 1; j <= n; j++) {
		if (j >= a && dp[j - a])
			i_ = j - a;
		while (i < n && (j - i > b || xx[j - 1] - xx[i] > d))
			i++;
		dp[j] = i_ >= i;
	}
	return dp[n];
}

int main() {
	static int xx[N];
	int n, a, b, i, lower, upper, d;

	scanf("%d%d%d", &n, &a, &b);
	for (i = 0; i < n; i++)
		scanf("%d", &xx[i]);
	sort(xx, 0, n);
	lower = -1, upper = INF;
	while (upper - lower > 1) {
		d = (lower + upper) / 2;
		if (solve(xx, n, a, b, d))
			upper = d;
		else
			lower = d;
	}
	printf("%d\n", upper);
	return 0;
}

Compilation message

plaukimo_varzybos.c: In function 'main':
plaukimo_varzybos.c:50:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |  scanf("%d%d%d", &n, &a, &b);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~
plaukimo_varzybos.c:52:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |   scanf("%d", &xx[i]);
      |   ^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 18 ms 1360 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 291 ms 11820 KB Output is correct
5 Correct 307 ms 11852 KB Output is correct
6 Correct 39 ms 1340 KB Output is correct
7 Correct 282 ms 10632 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 292 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 296 KB Output is correct
13 Correct 0 ms 212 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 18 ms 1360 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 291 ms 11820 KB Output is correct
5 Correct 307 ms 11852 KB Output is correct
6 Correct 39 ms 1340 KB Output is correct
7 Correct 282 ms 10632 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 292 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 9 ms 564 KB Output is correct
22 Correct 9 ms 684 KB Output is correct
23 Correct 15 ms 764 KB Output is correct
24 Correct 27 ms 1208 KB Output is correct
25 Correct 112 ms 5692 KB Output is correct
26 Correct 266 ms 9548 KB Output is correct
27 Correct 34 ms 1200 KB Output is correct
28 Correct 15 ms 852 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 375 ms 11808 KB Output is correct
31 Correct 412 ms 11980 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 18 ms 1360 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 291 ms 11820 KB Output is correct
5 Correct 307 ms 11852 KB Output is correct
6 Correct 39 ms 1340 KB Output is correct
7 Correct 282 ms 10632 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 292 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 9 ms 564 KB Output is correct
12 Correct 9 ms 684 KB Output is correct
13 Correct 15 ms 764 KB Output is correct
14 Correct 27 ms 1208 KB Output is correct
15 Correct 112 ms 5692 KB Output is correct
16 Correct 266 ms 9548 KB Output is correct
17 Correct 34 ms 1200 KB Output is correct
18 Correct 15 ms 852 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 375 ms 11808 KB Output is correct
21 Correct 412 ms 11980 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 296 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 11 ms 724 KB Output is correct
33 Correct 159 ms 6256 KB Output is correct
34 Correct 150 ms 5996 KB Output is correct
35 Correct 453 ms 11892 KB Output is correct
36 Correct 430 ms 11880 KB Output is correct
37 Correct 412 ms 11820 KB Output is correct
38 Correct 175 ms 7272 KB Output is correct