Submission #729892

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
729892	2023-04-24T18:52:36 Z	NintsiChkhaidze	Money (IZhO17_money)	C++17	100 / 100	176 ms	15056 KB

money

#include <bits/stdc++.h>
#define pb push_back
#define tree int h,int l,int r
#define left (h<<1),l,(l+r)>>1
#define right ((h<<1)|1),((l+r)>>1) + 1,r
#define f first
#define s second
#define ll long long
using namespace std;

const int N = 2e6 + 5;
int a[N],fen[N];

void upd(int idx){
	while (idx <= 2000000){
		fen[idx] += 1;
		idx += (idx & (-idx));
	}
}
int get(int idx){
	int s = 0;
	while (idx){
		s += fen[idx];
		idx -= (idx & (-idx));
	}
	return s;
}
signed main (){
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
	
	int n;
	cin>>n;
	for (int i = 1; i <= n; i++)
		cin>>a[i];
		
	int l = 1,ans=0;
	while (l <= n){
		int r = l,mn = a[l],mx = a[l];
		while (r + 1 <= n){
			if (a[r + 1] < a[r]) break;
			int mn1 = min(mn,a[r + 1]),mx1 = max(mx,a[r + 1]);
			if (get(mx1 - 1) - get(mn1) > 0) break;
			mn = mn1,mx = mx1;
			r++;
		}
		for (int i = l; i <= r; i++) upd(a[i]);
		l = r + 1;
		++ans;
	}
	cout<<ans;
}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	0 ms	320 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	328 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	456 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	0 ms	320 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	328 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	456 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	328 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	468 KB	Output is correct
26	Correct	1 ms	468 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	0 ms	320 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	328 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	456 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	328 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	468 KB	Output is correct
26	Correct	1 ms	468 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	328 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	452 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	468 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	1748 KB	Output is correct
38	Correct	2 ms	1748 KB	Output is correct

Subtask #4
55.0 / 55.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	0 ms	320 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	328 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	456 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	328 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	468 KB	Output is correct
26	Correct	1 ms	468 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	328 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	452 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	468 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	1748 KB	Output is correct
38	Correct	2 ms	1748 KB	Output is correct
39	Correct	73 ms	5456 KB	Output is correct
40	Correct	118 ms	8892 KB	Output is correct
41	Correct	55 ms	4444 KB	Output is correct
42	Correct	46 ms	4264 KB	Output is correct
43	Correct	29 ms	3108 KB	Output is correct
44	Correct	121 ms	11128 KB	Output is correct
45	Correct	119 ms	11036 KB	Output is correct
46	Correct	131 ms	11232 KB	Output is correct
47	Correct	125 ms	11088 KB	Output is correct
48	Correct	125 ms	11164 KB	Output is correct
49	Correct	138 ms	14860 KB	Output is correct
50	Correct	146 ms	14960 KB	Output is correct
51	Correct	145 ms	14892 KB	Output is correct
52	Correct	161 ms	15056 KB	Output is correct
53	Correct	135 ms	14876 KB	Output is correct
54	Correct	150 ms	14804 KB	Output is correct
55	Correct	164 ms	14948 KB	Output is correct
56	Correct	143 ms	14844 KB	Output is correct
57	Correct	130 ms	14816 KB	Output is correct
58	Correct	176 ms	14848 KB	Output is correct
59	Correct	141 ms	14872 KB	Output is correct
60	Correct	131 ms	14912 KB	Output is correct
61	Correct	131 ms	14908 KB	Output is correct
62	Correct	131 ms	14892 KB	Output is correct

Submission #729892

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