oj.uz

Submission #716350

# Submission time Handle Problem Language Result Execution time Memory
716350 2023-03-29T18:04:26 Z rainboy Financial Report (JOI21_financial) C
100 / 100
 159 ms 13260 KB 
#include <stdio.h>
#include <string.h>

#define N	300000
#define N_	(1 << 19)	/* N_ = pow2(ceil(log2(N))) */

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

unsigned int X = 12345;

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

int aa[N];

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 = aa[ii[j]] != aa[i_] ? aa[ii[j]] - aa[i_] : i_ - ii[j];

			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 st[N_ * 2], n_;

void update(int i, int x) {
	for (i += n_; i > 0; i >>= 1)
		st[i] = max(st[i], x);
}

int query(int l, int r) {
	int x = -1;

	for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1) {
		if ((l & 1) == 1)
			x = max(x, st[l++]);
		if ((r & 1) == 0)
			x = max(x, st[r--]);
	}
	return x;
}

int main() {
	static int ii[N], prev[N], next[N], ll[N];
	int n, d, h, i, p, q;

	scanf("%d%d", &n, &d);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]);
	for (i = 0; i < n; i++)
		ii[i] = i;
	sort(ii, 0, n);
	n_ = 1;
	while (n_ < n)
		n_ <<= 1;
	memset(st, -1, n_ * 2 * sizeof *st);
	for (i = 0; i < n; i++)
		prev[i] = i - 1, next[i] = i + 1;
	for (h = n - 1; h >= 0; h--) {
		i = ii[h], p = prev[i], q = next[i];
		ll[i] = query(0, i - 1) + 1;
		if (p != -1)
			next[p] = q;
		if (q != n)
			prev[q] = p;
		if (q - p - 1 >= d)
			update(q - 1, q - 1);
	}
	memset(st, 0, n_ * 2 * sizeof *st);
	for (h = 0; h < n; h++) {
		i = ii[h];
		update(i, query(ll[i], i) + 1);
	}
	printf("%d\n", query(0, n - 1));
	return 0;
}

Compilation message

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

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
13 Correct 0 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 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
13 Correct 0 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 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 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 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 296 KB Output is correct
39 Correct 1 ms 292 KB Output is correct
40 Correct 1 ms 212 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
13 Correct 0 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 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 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 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 296 KB Output is correct
39 Correct 1 ms 292 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 3 ms 564 KB Output is correct
43 Correct 3 ms 564 KB Output is correct
44 Correct 4 ms 468 KB Output is correct
45 Correct 3 ms 556 KB Output is correct
46 Correct 3 ms 492 KB Output is correct
47 Correct 3 ms 468 KB Output is correct
48 Correct 3 ms 556 KB Output is correct
49 Correct 3 ms 556 KB Output is correct
50 Correct 5 ms 560 KB Output is correct
51 Correct 3 ms 560 KB Output is correct
52 Correct 3 ms 468 KB Output is correct
53 Correct 3 ms 560 KB Output is correct
54 Correct 3 ms 468 KB Output is correct
55 Correct 3 ms 468 KB Output is correct
56 Correct 3 ms 468 KB Output is correct
57 Correct 4 ms 468 KB Output is correct
58 Correct 3 ms 468 KB Output is correct
59 Correct 3 ms 468 KB Output is correct
60 Correct 3 ms 468 KB Output is correct
61 Correct 3 ms 468 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 10176 KB Output is correct
2 Correct 112 ms 10192 KB Output is correct
3 Correct 142 ms 10180 KB Output is correct
4 Correct 143 ms 13056 KB Output is correct
5 Correct 130 ms 13260 KB Output is correct
6 Correct 139 ms 13084 KB Output is correct
7 Correct 113 ms 13084 KB Output is correct
8 Correct 93 ms 13096 KB Output is correct
9 Correct 110 ms 13104 KB Output is correct
10 Correct 97 ms 13112 KB Output is correct
11 Correct 125 ms 13136 KB Output is correct
12 Correct 127 ms 13064 KB Output is correct
13 Correct 135 ms 13260 KB Output is correct
14 Correct 135 ms 13140 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 10220 KB Output is correct
2 Correct 144 ms 10308 KB Output is correct
3 Correct 159 ms 10312 KB Output is correct
4 Correct 151 ms 10180 KB Output is correct
5 Correct 149 ms 10232 KB Output is correct
6 Correct 149 ms 10180 KB Output is correct
7 Correct 99 ms 10232 KB Output is correct
8 Correct 102 ms 10140 KB Output is correct
9 Correct 107 ms 10108 KB Output is correct
10 Correct 129 ms 10236 KB Output is correct
11 Correct 139 ms 10120 KB Output is correct
12 Correct 133 ms 10228 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
13 Correct 0 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 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 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 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 296 KB Output is correct
39 Correct 1 ms 292 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 3 ms 564 KB Output is correct
43 Correct 3 ms 564 KB Output is correct
44 Correct 4 ms 468 KB Output is correct
45 Correct 3 ms 556 KB Output is correct
46 Correct 3 ms 492 KB Output is correct
47 Correct 3 ms 468 KB Output is correct
48 Correct 3 ms 556 KB Output is correct
49 Correct 3 ms 556 KB Output is correct
50 Correct 5 ms 560 KB Output is correct
51 Correct 3 ms 560 KB Output is correct
52 Correct 3 ms 468 KB Output is correct
53 Correct 3 ms 560 KB Output is correct
54 Correct 3 ms 468 KB Output is correct
55 Correct 3 ms 468 KB Output is correct
56 Correct 3 ms 468 KB Output is correct
57 Correct 4 ms 468 KB Output is correct
58 Correct 3 ms 468 KB Output is correct
59 Correct 3 ms 468 KB Output is correct
60 Correct 3 ms 468 KB Output is correct
61 Correct 3 ms 468 KB Output is correct
62 Correct 93 ms 10176 KB Output is correct
63 Correct 112 ms 10192 KB Output is correct
64 Correct 142 ms 10180 KB Output is correct
65 Correct 143 ms 13056 KB Output is correct
66 Correct 130 ms 13260 KB Output is correct
67 Correct 139 ms 13084 KB Output is correct
68 Correct 113 ms 13084 KB Output is correct
69 Correct 93 ms 13096 KB Output is correct
70 Correct 110 ms 13104 KB Output is correct
71 Correct 97 ms 13112 KB Output is correct
72 Correct 125 ms 13136 KB Output is correct
73 Correct 127 ms 13064 KB Output is correct
74 Correct 135 ms 13260 KB Output is correct
75 Correct 135 ms 13140 KB Output is correct
76 Correct 110 ms 10220 KB Output is correct
77 Correct 144 ms 10308 KB Output is correct
78 Correct 159 ms 10312 KB Output is correct
79 Correct 151 ms 10180 KB Output is correct
80 Correct 149 ms 10232 KB Output is correct
81 Correct 149 ms 10180 KB Output is correct
82 Correct 99 ms 10232 KB Output is correct
83 Correct 102 ms 10140 KB Output is correct
84 Correct 107 ms 10108 KB Output is correct
85 Correct 129 ms 10236 KB Output is correct
86 Correct 139 ms 10120 KB Output is correct
87 Correct 133 ms 10228 KB Output is correct
88 Correct 151 ms 13132 KB Output is correct
89 Correct 150 ms 13136 KB Output is correct
90 Correct 153 ms 13132 KB Output is correct
91 Correct 155 ms 13132 KB Output is correct
92 Correct 134 ms 13112 KB Output is correct
93 Correct 149 ms 13060 KB Output is correct
94 Correct 152 ms 13080 KB Output is correct
95 Correct 144 ms 13024 KB Output is correct
96 Correct 148 ms 13080 KB Output is correct
97 Correct 156 ms 13140 KB Output is correct
98 Correct 156 ms 13136 KB Output is correct
99 Correct 152 ms 13036 KB Output is correct
100 Correct 153 ms 13060 KB Output is correct
101 Correct 110 ms 13136 KB Output is correct
102 Correct 110 ms 13132 KB Output is correct
103 Correct 119 ms 13044 KB Output is correct
104 Correct 131 ms 13076 KB Output is correct
105 Correct 138 ms 13104 KB Output is correct
106 Correct 129 ms 13064 KB Output is correct
107 Correct 143 ms 13092 KB Output is correct
108 Correct 152 ms 13220 KB Output is correct
109 Correct 131 ms 13084 KB Output is correct
110 Correct 146 ms 13064 KB Output is correct
111 Correct 149 ms 13132 KB Output is correct
112 Correct 125 ms 13092 KB Output is correct
113 Correct 146 ms 13136 KB Output is correct
114 Correct 148 ms 13108 KB Output is correct
115 Correct 107 ms 13136 KB Output is correct
116 Correct 106 ms 13104 KB Output is correct
117 Correct 110 ms 13044 KB Output is correct
118 Correct 120 ms 13204 KB Output is correct
119 Correct 143 ms 13168 KB Output is correct
120 Correct 135 ms 13132 KB Output is correct