Submission #377229

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
377229	2021-03-13T13:45:18 Z	CaroLinda	Money (IZhO17_money)	C++14	100 / 100	270 ms	15132 KB

money

#include <bits/stdc++.h>
 
#define ll long long
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x.size() )
#define lp(i,a,b) for(int i = a;  i< b ; i++ )
#define pii pair<int,int> 

const int MAXN = 1e6+10 ;

using namespace std ;

int N ;
int arr[MAXN] ;
int bit[MAXN] ;

void upd(int pos, int x ) { for(; pos < MAXN ; pos += pos & -pos ) bit[pos] += x ; }
int qry(int pos)
{
	int tot = 0 ;
	for(; pos > 0 ; pos -= pos & -pos ) tot += bit[pos] ;
	return tot ;
}

int main()
{
	scanf("%d", &N ) ;
	for(int i= 1 ; i <= N ; i++ ) 
	{
		scanf("%d", &arr[i] ) ;
		upd(arr[i], 1) ;
	}
	
	int ans = 0 ;
	for(int i = N ; i > 0 ; ans++ )
	{
		upd(arr[i], -1 ) ;
		int j = i-1 ;
		while( j > 0 && arr[j] <= arr[j+1] )
		{
			if( qry(arr[i]-1) - qry(arr[j] ) > 0 ) break ;
			upd(arr[j] , -1 ) ;
			j-- ;
		}
		i = j ;

	}

	printf("%d\n", ans ) ;
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |  scanf("%d", &N ) ;
      |  ~~~~~^~~~~~~~~~~
money.cpp:30:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |   scanf("%d", &arr[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	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

#	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	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	380 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	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	380 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	1 ms	1644 KB	Output is correct
38	Correct	1 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	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	380 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	1 ms	1644 KB	Output is correct
38	Correct	1 ms	1772 KB	Output is correct
39	Correct	96 ms	5484 KB	Output is correct
40	Correct	161 ms	8556 KB	Output is correct
41	Correct	80 ms	4460 KB	Output is correct
42	Correct	73 ms	4204 KB	Output is correct
43	Correct	48 ms	3180 KB	Output is correct
44	Correct	205 ms	9580 KB	Output is correct
45	Correct	200 ms	9408 KB	Output is correct
46	Correct	205 ms	9324 KB	Output is correct
47	Correct	188 ms	9196 KB	Output is correct
48	Correct	195 ms	9324 KB	Output is correct
49	Correct	236 ms	13164 KB	Output is correct
50	Correct	212 ms	13164 KB	Output is correct
51	Correct	232 ms	13068 KB	Output is correct
52	Correct	212 ms	13164 KB	Output is correct
53	Correct	258 ms	13164 KB	Output is correct
54	Correct	213 ms	13168 KB	Output is correct
55	Correct	241 ms	13164 KB	Output is correct
56	Correct	270 ms	15084 KB	Output is correct
57	Correct	248 ms	14828 KB	Output is correct
58	Correct	253 ms	15132 KB	Output is correct
59	Correct	256 ms	14956 KB	Output is correct
60	Correct	254 ms	14900 KB	Output is correct
61	Correct	236 ms	14828 KB	Output is correct
62	Correct	258 ms	14828 KB	Output is correct

Submission #377229

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