Submission #319226

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
319226	2020-11-04T14:20:48 Z	dolphingarlic	Money (IZhO17_money)	C++14	100 / 100	251 ms	15000 KB

money

#include <bits/stdc++.h>
using namespace std;

int n, a[1000005], bit[1000005];

void update(int pos) { for (; pos < 1000005; pos += (pos & (-pos))) bit[pos]++; }

int query(int a) {
	int ans = 0;
	for (; a; a -= (a & (-a))) ans += bit[a];
	return ans;
}

int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; i++) scanf("%d", a + i);
	int ans = 0;
	update(a[0]);
	for (int i = 0; i < n;) {
		int j = i++;
		ans++;
		while (i < n && query(a[i] - 1) <= query(a[j]) && a[i] >= a[i - 1]) i++;
		for (int k = j; k < i; k++) update(a[k]);
	}
	printf("%d", ans);
	return 0;
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
money.cpp:16:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |  for (int i = 0; i < n; i++) scanf("%d", a + i);
      |                              ~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	640 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	640 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	492 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	620 KB	Output is correct
26	Correct	1 ms	620 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	640 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	492 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	620 KB	Output is correct
26	Correct	1 ms	620 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	492 KB	Output is correct
33	Correct	1 ms	492 KB	Output is correct
34	Correct	1 ms	492 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	2 ms	1644 KB	Output is correct
38	Correct	2 ms	1772 KB	Output is correct

Subtask #4
55.0 / 55.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	640 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	492 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	620 KB	Output is correct
26	Correct	1 ms	620 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	492 KB	Output is correct
33	Correct	1 ms	492 KB	Output is correct
34	Correct	1 ms	492 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	2 ms	1644 KB	Output is correct
38	Correct	2 ms	1772 KB	Output is correct
39	Correct	88 ms	3428 KB	Output is correct
40	Correct	144 ms	5988 KB	Output is correct
41	Correct	76 ms	3044 KB	Output is correct
42	Correct	68 ms	3192 KB	Output is correct
43	Correct	49 ms	2660 KB	Output is correct
44	Correct	193 ms	6756 KB	Output is correct
45	Correct	184 ms	6664 KB	Output is correct
46	Correct	185 ms	6628 KB	Output is correct
47	Correct	206 ms	6628 KB	Output is correct
48	Correct	175 ms	6628 KB	Output is correct
49	Correct	200 ms	10532 KB	Output is correct
50	Correct	197 ms	9444 KB	Output is correct
51	Correct	200 ms	9444 KB	Output is correct
52	Correct	196 ms	9444 KB	Output is correct
53	Correct	199 ms	9444 KB	Output is correct
54	Correct	200 ms	9316 KB	Output is correct
55	Correct	209 ms	9348 KB	Output is correct
56	Correct	251 ms	14820 KB	Output is correct
57	Correct	221 ms	14820 KB	Output is correct
58	Correct	224 ms	14820 KB	Output is correct
59	Correct	214 ms	14928 KB	Output is correct
60	Correct	235 ms	15000 KB	Output is correct
61	Correct	250 ms	14868 KB	Output is correct
62	Correct	216 ms	14820 KB	Output is correct

Submission #319226

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 20.0 / 20.0

Subtask #4 55.0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
20.0 / 20.0

Subtask #4
55.0 / 55.0