oj.uz

Submission #706748

# Submission time Handle Problem Language Result Execution time Memory
706748 2023-03-07T16:14:57 Z rainboy Measures (CEOI22_measures) C
100 / 100
 157 ms 21840 KB 
#include <stdio.h>

#define N	200000
#define M	200000
#define N_	(1 << 19)	/* N_ = pow2(ceil(log2(N + M))) */
#define INF	0x3f3f3f3f3f3f3f3fLL

long long max(long long a, long long b) { return a > b ? a : b; }

unsigned int X = 12345;

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

int xx[N + M], idx[N + M], n, m, d;

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)
			if (xx[ii[j]] == xx[i_])
				j++;
			else if (xx[ii[j]] < xx[i_]) {
				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;
	}
}

long long st[N_ * 2], pp[N_ * 2], qq[N_ * 2]; int sz[N_ * 2], n_;

void build() {
	int i;

	n_ = 1;
	while (n_ < n + m)
		n_ <<= 1;
	for (i = 0; i < n_ * 2; i++)
		st[i] = -INF, pp[i] = -INF, qq[i] = -INF;
}

void pul(int i) {
	int l = i << 1, r = l | 1;

	sz[i] = sz[l] + sz[r];
	pp[i] = max(pp[l], pp[r] + (long long) sz[l] * d);
	qq[i] = max(qq[l] + (long long) sz[r] * d, qq[r]);
	st[i] = max(max(st[l], st[r]), qq[l] + pp[r] + d);
}

void update(int i, int x) {
	i += n_;
	sz[i]++, pp[i] = -x, qq[i] = x, st[i] = 0;
	while (i > 1)
		pul(i >>= 1);
}

int main() {
	static int ii[N + M];
	int i;

	scanf("%d%d%d", &n, &m, &d);
	for (i = 0; i < n + m; i++)
		scanf("%d", &xx[i]);
	for (i = 0; i < n + m; i++)
		ii[i] = i;
	sort(ii, 0, n + m);
	for (i = 0; i < n + m; i++)
		idx[ii[i]] = i;
	build();
	for (i = 0; i < n; i++)
		update(idx[i], xx[i]);
	for (i = n; i < n + m; i++) {
		update(idx[i], xx[i]);
		printf("%lld%s ", st[1] / 2, st[1] % 2 == 0 ? "" : ".5");
	}
	printf("\n");
	return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 456 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 1 ms 468 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 456 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 124 ms 18496 KB Output is correct
10 Correct 117 ms 18412 KB Output is correct
11 Correct 61 ms 18472 KB Output is correct
12 Correct 81 ms 18396 KB Output is correct
13 Correct 71 ms 17984 KB Output is correct
14 Correct 78 ms 18360 KB Output is correct
15 Correct 125 ms 17708 KB Output is correct
16 Correct 82 ms 18396 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 19620 KB Output is correct
2 Correct 109 ms 21444 KB Output is correct
3 Correct 98 ms 21376 KB Output is correct
4 Correct 105 ms 19404 KB Output is correct
5 Correct 102 ms 20468 KB Output is correct
6 Correct 96 ms 19524 KB Output is correct
7 Correct 99 ms 20500 KB Output is correct
8 Correct 99 ms 19328 KB Output is correct
9 Correct 96 ms 19164 KB Output is correct
10 Correct 102 ms 21808 KB Output is correct
11 Correct 99 ms 20044 KB Output is correct
12 Correct 99 ms 20940 KB Output is correct
13 Correct 99 ms 19276 KB Output is correct
14 Correct 106 ms 21196 KB Output is correct
15 Correct 100 ms 21004 KB Output is correct
16 Correct 92 ms 18764 KB Output is correct
17 Correct 99 ms 20452 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 19620 KB Output is correct
2 Correct 109 ms 21444 KB Output is correct
3 Correct 98 ms 21376 KB Output is correct
4 Correct 105 ms 19404 KB Output is correct
5 Correct 102 ms 20468 KB Output is correct
6 Correct 96 ms 19524 KB Output is correct
7 Correct 99 ms 20500 KB Output is correct
8 Correct 99 ms 19328 KB Output is correct
9 Correct 96 ms 19164 KB Output is correct
10 Correct 102 ms 21808 KB Output is correct
11 Correct 99 ms 20044 KB Output is correct
12 Correct 99 ms 20940 KB Output is correct
13 Correct 99 ms 19276 KB Output is correct
14 Correct 106 ms 21196 KB Output is correct
15 Correct 100 ms 21004 KB Output is correct
16 Correct 92 ms 18764 KB Output is correct
17 Correct 99 ms 20452 KB Output is correct
18 Correct 149 ms 19672 KB Output is correct
19 Correct 150 ms 21240 KB Output is correct
20 Correct 91 ms 21336 KB Output is correct
21 Correct 106 ms 19376 KB Output is correct
22 Correct 145 ms 19720 KB Output is correct
23 Correct 102 ms 19512 KB Output is correct
24 Correct 157 ms 20172 KB Output is correct
25 Correct 95 ms 19180 KB Output is correct
26 Correct 142 ms 19168 KB Output is correct
27 Correct 149 ms 21840 KB Output is correct
28 Correct 122 ms 19776 KB Output is correct
29 Correct 135 ms 20936 KB Output is correct
30 Correct 105 ms 19232 KB Output is correct
31 Correct 112 ms 21300 KB Output is correct
32 Correct 107 ms 21052 KB Output is correct
33 Correct 146 ms 18812 KB Output is correct
34 Correct 113 ms 20472 KB Output is correct