답안 #768170

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
768170	2023-06-27T16:07:06 Z	rainboy	Money (IZhO17_money)	C	45 / 100	1500 ms	30340 KB

money

#include <stdio.h>

#define N	1000000

unsigned int Z = 12345;

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

int zz[N + 1], ll[N + 1], rr[N + 1], aa[N + 1], kk[N + 1], u_, l_, r_;

int node(int a, int k) {
	static int _ = 1;

	zz[_] = rand_();
	aa[_] = a, kk[_] = k;
	return _++;
}

void split(int u, int a) {
	if (u == 0) {
		u_ = l_ = r_ = 0;
		return;
	}
	if (aa[u] < a) {
		split(rr[u], a);
		rr[u] = l_, l_ = u;
	} else if (aa[u] > a) {
		split(ll[u], a);
		ll[u] = r_, r_ = u;
	} else {
		u_ = u, l_ = ll[u], r_ = rr[u];
		ll[u] = rr[u] = 0;
	}
}

int merge(int u, int v) {
	if (u == 0)
		return v;
	if (v == 0)
		return u;
	if (zz[u] < zz[v]) {
		rr[u] = merge(rr[u], v);
		return u;
	} else {
		ll[v] = merge(u, ll[v]);
		return v;
	}
}

void tr_update(int a, int k) {
	split(u_, a);
	if (u_ == 0)
		u_ = node(a, k);
	else if ((kk[u_] += k) == 0)
		u_ = 0;
	u_ = merge(merge(l_, u_), r_);
}

int tr_floor(int a) {
	int u = u_, a_ = -1;

	while (u)
		if (aa[u] <= a)
			a_ = aa[u], u = rr[u];
		else
			u = ll[u];
	return a_;
}

int main() {
	static int aa[N];
	int n, i, j, k, a;

	scanf("%d", &n);
	for (i = 0; i < n; i++) {
		scanf("%d", &aa[i]);
		tr_update(aa[i], 1);
	}
	k = 0;
	for (j = n - 1; j >= 0; j = i) {
		i = j - 1;
		while (i >= 0 && aa[i] == aa[j])
			i--;
		tr_update(aa[j], -(j - i));
		a = aa[j] - 1;
		while (i >= 0 && aa[i] == tr_floor(a))
			tr_update(aa[i], -1), a = aa[i], i--;
		k++;
	}
	printf("%d\n", k);
	return 0;
}

Compilation message

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

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	292 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 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	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	292 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	292 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	292 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 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	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	292 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	292 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	288 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	292 KB	Output is correct
20	Correct	1 ms	292 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	292 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 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	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	292 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	292 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	288 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	292 KB	Output is correct
20	Correct	1 ms	292 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	292 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 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	0 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	212 KB	Output is correct

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	292 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 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	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	292 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	292 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	288 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	292 KB	Output is correct
20	Correct	1 ms	292 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	292 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 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	0 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	212 KB	Output is correct
39	Correct	60 ms	5376 KB	Output is correct
40	Correct	120 ms	8636 KB	Output is correct
41	Correct	51 ms	4392 KB	Output is correct
42	Correct	59 ms	3940 KB	Output is correct
43	Correct	39 ms	2892 KB	Output is correct
44	Correct	145 ms	11052 KB	Output is correct
45	Correct	141 ms	10828 KB	Output is correct
46	Correct	143 ms	11004 KB	Output is correct
47	Correct	108 ms	11008 KB	Output is correct
48	Correct	124 ms	10956 KB	Output is correct
49	Correct	864 ms	18704 KB	Output is correct
50	Correct	851 ms	18692 KB	Output is correct
51	Correct	897 ms	18636 KB	Output is correct
52	Correct	832 ms	18636 KB	Output is correct
53	Correct	831 ms	18712 KB	Output is correct
54	Correct	844 ms	18480 KB	Output is correct
55	Execution timed out	1584 ms	30340 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-

답안 #768170

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 55.0