답안 #87074 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
87074	2018-11-29T11:25:12 Z	dimash241	Money (IZhO17_money)	C++11	100 / 100	1484 ms	57648 KB

money

# include <stdio.h>
# include <bits/stdc++.h>
 
 
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (int i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (int i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red
 
using namespace std;
 
inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}
 
const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 1e6 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;
 
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, cur, ans;
int a[N];
 
int main () {
	SpeedForce;
	cin >> n;
    For (i, 1, n ) {
    	cin >> a[i];
    }
 
    set < int > st;
    st.insert(inf);
    For (i, 1, n) {
    	st.insert(a[i]);
    	cur = *st.upper_bound(a[i]);
    	ans ++;
    	while (i + 1 <= n && a[i] <= a[i + 1] && a[i + 1] <= cur) st.insert(a[++ i]); 	
    }
 
    cout << ans;
 
    return Accepted;
}
 
// Coded By OB

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	460 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	460 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	520 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	2 ms	564 KB	Output is correct
9	Correct	2 ms	564 KB	Output is correct
10	Correct	2 ms	580 KB	Output is correct
11	Correct	2 ms	580 KB	Output is correct
12	Correct	2 ms	580 KB	Output is correct
13	Correct	2 ms	580 KB	Output is correct
14	Correct	2 ms	592 KB	Output is correct
15	Correct	2 ms	592 KB	Output is correct
16	Correct	2 ms	608 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	460 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	460 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	520 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	2 ms	564 KB	Output is correct
9	Correct	2 ms	564 KB	Output is correct
10	Correct	2 ms	580 KB	Output is correct
11	Correct	2 ms	580 KB	Output is correct
12	Correct	2 ms	580 KB	Output is correct
13	Correct	2 ms	580 KB	Output is correct
14	Correct	2 ms	592 KB	Output is correct
15	Correct	2 ms	592 KB	Output is correct
16	Correct	2 ms	608 KB	Output is correct
17	Correct	2 ms	608 KB	Output is correct
18	Correct	2 ms	608 KB	Output is correct
19	Correct	2 ms	608 KB	Output is correct
20	Correct	2 ms	608 KB	Output is correct
21	Correct	2 ms	608 KB	Output is correct
22	Correct	2 ms	608 KB	Output is correct
23	Correct	2 ms	608 KB	Output is correct
24	Correct	2 ms	608 KB	Output is correct
25	Correct	2 ms	608 KB	Output is correct
26	Correct	2 ms	608 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	460 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	460 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	520 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	2 ms	564 KB	Output is correct
9	Correct	2 ms	564 KB	Output is correct
10	Correct	2 ms	580 KB	Output is correct
11	Correct	2 ms	580 KB	Output is correct
12	Correct	2 ms	580 KB	Output is correct
13	Correct	2 ms	580 KB	Output is correct
14	Correct	2 ms	592 KB	Output is correct
15	Correct	2 ms	592 KB	Output is correct
16	Correct	2 ms	608 KB	Output is correct
17	Correct	2 ms	608 KB	Output is correct
18	Correct	2 ms	608 KB	Output is correct
19	Correct	2 ms	608 KB	Output is correct
20	Correct	2 ms	608 KB	Output is correct
21	Correct	2 ms	608 KB	Output is correct
22	Correct	2 ms	608 KB	Output is correct
23	Correct	2 ms	608 KB	Output is correct
24	Correct	2 ms	608 KB	Output is correct
25	Correct	2 ms	608 KB	Output is correct
26	Correct	2 ms	608 KB	Output is correct
27	Correct	2 ms	608 KB	Output is correct
28	Correct	2 ms	608 KB	Output is correct
29	Correct	3 ms	608 KB	Output is correct
30	Correct	3 ms	608 KB	Output is correct
31	Correct	3 ms	612 KB	Output is correct
32	Correct	2 ms	612 KB	Output is correct
33	Correct	2 ms	616 KB	Output is correct
34	Correct	3 ms	744 KB	Output is correct
35	Correct	2 ms	744 KB	Output is correct
36	Correct	2 ms	744 KB	Output is correct
37	Correct	2 ms	744 KB	Output is correct
38	Correct	2 ms	744 KB	Output is correct

Subtask #4
55.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	460 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	460 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	520 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	2 ms	564 KB	Output is correct
9	Correct	2 ms	564 KB	Output is correct
10	Correct	2 ms	580 KB	Output is correct
11	Correct	2 ms	580 KB	Output is correct
12	Correct	2 ms	580 KB	Output is correct
13	Correct	2 ms	580 KB	Output is correct
14	Correct	2 ms	592 KB	Output is correct
15	Correct	2 ms	592 KB	Output is correct
16	Correct	2 ms	608 KB	Output is correct
17	Correct	2 ms	608 KB	Output is correct
18	Correct	2 ms	608 KB	Output is correct
19	Correct	2 ms	608 KB	Output is correct
20	Correct	2 ms	608 KB	Output is correct
21	Correct	2 ms	608 KB	Output is correct
22	Correct	2 ms	608 KB	Output is correct
23	Correct	2 ms	608 KB	Output is correct
24	Correct	2 ms	608 KB	Output is correct
25	Correct	2 ms	608 KB	Output is correct
26	Correct	2 ms	608 KB	Output is correct
27	Correct	2 ms	608 KB	Output is correct
28	Correct	2 ms	608 KB	Output is correct
29	Correct	3 ms	608 KB	Output is correct
30	Correct	3 ms	608 KB	Output is correct
31	Correct	3 ms	612 KB	Output is correct
32	Correct	2 ms	612 KB	Output is correct
33	Correct	2 ms	616 KB	Output is correct
34	Correct	3 ms	744 KB	Output is correct
35	Correct	2 ms	744 KB	Output is correct
36	Correct	2 ms	744 KB	Output is correct
37	Correct	2 ms	744 KB	Output is correct
38	Correct	2 ms	744 KB	Output is correct
39	Correct	70 ms	2552 KB	Output is correct
40	Correct	121 ms	3732 KB	Output is correct
41	Correct	57 ms	3732 KB	Output is correct
42	Correct	55 ms	3732 KB	Output is correct
43	Correct	41 ms	3732 KB	Output is correct
44	Correct	154 ms	4476 KB	Output is correct
45	Correct	158 ms	4604 KB	Output is correct
46	Correct	150 ms	4604 KB	Output is correct
47	Correct	128 ms	4604 KB	Output is correct
48	Correct	140 ms	4604 KB	Output is correct
49	Correct	668 ms	23060 KB	Output is correct
50	Correct	704 ms	23060 KB	Output is correct
51	Correct	684 ms	23152 KB	Output is correct
52	Correct	627 ms	23152 KB	Output is correct
53	Correct	694 ms	23152 KB	Output is correct
54	Correct	640 ms	23152 KB	Output is correct
55	Correct	1444 ms	51560 KB	Output is correct
56	Correct	1444 ms	51844 KB	Output is correct
57	Correct	1422 ms	51844 KB	Output is correct
58	Correct	1413 ms	51844 KB	Output is correct
59	Correct	1479 ms	51844 KB	Output is correct
60	Correct	1484 ms	55948 KB	Output is correct
61	Correct	1392 ms	57648 KB	Output is correct
62	Correct	1409 ms	57648 KB	Output is correct

답안 #87074

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