답안 #335524

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
335524	2020-12-13T01:21:26 Z	luciocf	Money (IZhO17_money)	C++14	100 / 100	381 ms	15084 KB

money

#include <bits/stdc++.h>
 
using namespace std;
 
const int maxn = 1e6+10;
 
int a[maxn];

struct FenwickTree
{
	int bit[maxn];

	void upd(int x, int v)
	{
		for (; x < maxn; x += (x&-x))
			bit[x] += v;
	}

	int soma(int x)
	{
		int ans = 0;
		for (; x > 0; x -= (x&-x))
			ans += bit[x];
		return ans;
	}

	int get(int s)
	{
		int pos = 0, soma = 0;

		for (int i = 20; i >= 0; i--)
			if (pos+(1<<i) < maxn && soma + bit[pos+(1<<i)] < s)
				pos += (1<<i), soma += bit[pos];

		return pos+1;
	}
} BIT;

int main(void)
{
	int n;
	scanf("%d", &n);
  
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &a[i]);

		BIT.upd(a[i], 1);
	}
 
	int ans = 0;
 
	for (int r = n; r >= 1; r--)
	{
		++ans;
 
		int l = r;
 		BIT.upd(a[l], -1);

		while (l > 1 && a[l-1] == a[l])
		{
			l--;
			BIT.upd(a[l], -1);
		}
 
		while (l > 1)
		{
			if (a[l] == a[r] && a[l-1] != BIT.get(BIT.soma(a[l]-1))) break;
			if (a[l] != a[r] && a[l-1] != BIT.get(BIT.soma(a[l]))) break;

			--l;
			BIT.upd(a[l], -1);
		}
 
		r = l;
	}
 
	printf("%d\n", ans);
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:42:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
money.cpp:46:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   46 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	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	364 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

#	결과	실행 시간	메모리	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	364 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	384 KB	Output is correct
25	Correct	1 ms	492 KB	Output is correct
26	Correct	1 ms	620 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	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	364 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	384 KB	Output is correct
25	Correct	1 ms	492 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	1 ms	1772 KB	Output is correct

Subtask #4
55.0 / 55.0

#	결과	실행 시간	메모리	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	364 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	384 KB	Output is correct
25	Correct	1 ms	492 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	1 ms	1772 KB	Output is correct
39	Correct	134 ms	2284 KB	Output is correct
40	Correct	227 ms	3564 KB	Output is correct
41	Correct	107 ms	1900 KB	Output is correct
42	Correct	106 ms	1900 KB	Output is correct
43	Correct	74 ms	1644 KB	Output is correct
44	Correct	284 ms	4480 KB	Output is correct
45	Correct	278 ms	4460 KB	Output is correct
46	Correct	287 ms	4460 KB	Output is correct
47	Correct	255 ms	4332 KB	Output is correct
48	Correct	267 ms	4588 KB	Output is correct
49	Correct	327 ms	8300 KB	Output is correct
50	Correct	329 ms	8244 KB	Output is correct
51	Correct	330 ms	8172 KB	Output is correct
52	Correct	322 ms	8300 KB	Output is correct
53	Correct	307 ms	8172 KB	Output is correct
54	Correct	313 ms	8300 KB	Output is correct
55	Correct	371 ms	8172 KB	Output is correct
56	Correct	352 ms	14956 KB	Output is correct
57	Correct	381 ms	14828 KB	Output is correct
58	Correct	357 ms	14956 KB	Output is correct
59	Correct	376 ms	15084 KB	Output is correct
60	Correct	354 ms	14956 KB	Output is correct
61	Correct	377 ms	14956 KB	Output is correct
62	Correct	349 ms	14956 KB	Output is correct

답안 #335524

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