oj.uz

Submission #767265

# Submission time Handle Problem Language Result Execution time Memory
767265 2023-06-26T14:51:19 Z rainboy Divide and conquer (IZhO14_divide) C
100 / 100
 33 ms 5824 KB 
#include <stdio.h>

#define N	100000

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

int main() {
	static int xx[N], ii[N];
	static long long yy[N], zz[N], uu[N];
	int n, cnt, i, j;
	long long v, ans;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d%lld%lld", &xx[i], &yy[i], &zz[i]);
	for (i = 1; i < n; i++)
		yy[i] += yy[i - 1], zz[i] += zz[i - 1];
	cnt = 0;
	for (i = 0; i < n; i++) {
		uu[i] = (long long) xx[i] - (i == 0 ? 0 : zz[i - 1]);
		if (cnt == 0 || uu[ii[cnt - 1]] < uu[i])
			ii[cnt++] = i;
	}
	ans = 0;
	for (j = n - 1; j >= 0; j--) {
		v = xx[j] - zz[j];
		while (cnt && uu[i = ii[cnt - 1]] >= v) {
			ans = max(ans, yy[j] - (i == 0 ? 0 : yy[i - 1]));
			cnt--;
		}
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

divide.c: In function 'main':
divide.c:13:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
divide.c:15:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |   scanf("%d%lld%lld", &xx[i], &yy[i], &zz[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 232 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 0 ms 212 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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 232 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 0 ms 212 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 1 ms 296 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 2 ms 544 KB Output is correct
24 Correct 2 ms 564 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 232 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 0 ms 212 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 1 ms 296 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 2 ms 544 KB Output is correct
24 Correct 2 ms 564 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 11 ms 2580 KB Output is correct
29 Correct 13 ms 2960 KB Output is correct
30 Correct 33 ms 5824 KB Output is correct
31 Correct 25 ms 4664 KB Output is correct
32 Correct 26 ms 4880 KB Output is correct
33 Correct 20 ms 4556 KB Output is correct
34 Correct 20 ms 4804 KB Output is correct
35 Correct 23 ms 5460 KB Output is correct
36 Correct 22 ms 5568 KB Output is correct