Submission #497947

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
497947	2021-12-24T05:42:44 Z	tmn2005	Money (IZhO17_money)	C++17	100 / 100	910 ms	62000 KB

money

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

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_back

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],b,c;

main(){
	NeedForSpeed
    cin>>n;
    for(int i=1; i<=n; i++)cin>>a[i];
	set<int>s;
	s.ins(INF);
	s.ins(0);
	
	for(int i=1; i<=n; i++){		
		res++;
		int l = *s.upper_bound(a[i]);
		s.ins(a[i]);
		while(a[i] <= a[i+1] && a[i+1] <= l && i < n){
			i++;
			s.ins(a[i]);
		}
	}
	cout<<res;
	return 0;
}

Compilation message

money.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main(){
      | ^~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
55.0 / 55.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	316 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	320 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	320 KB	Output is correct
20	Correct	1 ms	316 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	0 ms	320 KB	Output is correct
25	Correct	1 ms	300 KB	Output is correct
26	Correct	0 ms	316 KB	Output is correct
27	Correct	0 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 ms	316 KB	Output is correct
30	Correct	0 ms	324 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	0 ms	316 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	0 ms	316 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	1 ms	204 KB	Output is correct
37	Correct	0 ms	204 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	56 ms	7248 KB	Output is correct
40	Correct	92 ms	11780 KB	Output is correct
41	Correct	38 ms	5824 KB	Output is correct
42	Correct	37 ms	5256 KB	Output is correct
43	Correct	27 ms	3756 KB	Output is correct
44	Correct	125 ms	14720 KB	Output is correct
45	Correct	104 ms	14776 KB	Output is correct
46	Correct	99 ms	14888 KB	Output is correct
47	Correct	106 ms	14868 KB	Output is correct
48	Correct	105 ms	15008 KB	Output is correct
49	Correct	380 ms	33468 KB	Output is correct
50	Correct	370 ms	33296 KB	Output is correct
51	Correct	378 ms	33356 KB	Output is correct
52	Correct	371 ms	33328 KB	Output is correct
53	Correct	407 ms	33460 KB	Output is correct
54	Correct	380 ms	33348 KB	Output is correct
55	Correct	910 ms	61852 KB	Output is correct
56	Correct	891 ms	61784 KB	Output is correct
57	Correct	887 ms	61828 KB	Output is correct
58	Correct	881 ms	61916 KB	Output is correct
59	Correct	849 ms	62000 KB	Output is correct
60	Correct	900 ms	61804 KB	Output is correct
61	Correct	907 ms	61800 KB	Output is correct
62	Correct	863 ms	61712 KB	Output is correct

Submission #497947

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