oj.uz

Submission #87070

# Submission time Handle Problem Language Result Execution time Memory
87070 2018-11-29T11:20:29 Z dimash241 Money (IZhO17_money) C++17
45 / 100
 246 ms 12876 KB 
# 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 (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll 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 = 6e5 + 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 () {
	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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 3 ms 508 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 2 ms 508 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 508 KB Output is correct
9 Correct 2 ms 508 KB Output is correct
10 Correct 2 ms 508 KB Output is correct
11 Correct 2 ms 540 KB Output is correct
12 Correct 2 ms 540 KB Output is correct
13 Correct 2 ms 548 KB Output is correct
14 Correct 2 ms 560 KB Output is correct
15 Correct 2 ms 568 KB Output is correct
16 Correct 2 ms 580 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 3 ms 508 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 2 ms 508 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 508 KB Output is correct
9 Correct 2 ms 508 KB Output is correct
10 Correct 2 ms 508 KB Output is correct
11 Correct 2 ms 540 KB Output is correct
12 Correct 2 ms 540 KB Output is correct
13 Correct 2 ms 548 KB Output is correct
14 Correct 2 ms 560 KB Output is correct
15 Correct 2 ms 568 KB Output is correct
16 Correct 2 ms 580 KB Output is correct
17 Correct 2 ms 592 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 644 KB Output is correct
21 Correct 2 ms 648 KB Output is correct
22 Correct 2 ms 648 KB Output is correct
23 Correct 2 ms 656 KB Output is correct
24 Correct 2 ms 660 KB Output is correct
25 Correct 2 ms 660 KB Output is correct
26 Correct 2 ms 660 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 3 ms 508 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 2 ms 508 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 508 KB Output is correct
9 Correct 2 ms 508 KB Output is correct
10 Correct 2 ms 508 KB Output is correct
11 Correct 2 ms 540 KB Output is correct
12 Correct 2 ms 540 KB Output is correct
13 Correct 2 ms 548 KB Output is correct
14 Correct 2 ms 560 KB Output is correct
15 Correct 2 ms 568 KB Output is correct
16 Correct 2 ms 580 KB Output is correct
17 Correct 2 ms 592 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 644 KB Output is correct
21 Correct 2 ms 648 KB Output is correct
22 Correct 2 ms 648 KB Output is correct
23 Correct 2 ms 656 KB Output is correct
24 Correct 2 ms 660 KB Output is correct
25 Correct 2 ms 660 KB Output is correct
26 Correct 2 ms 660 KB Output is correct
27 Correct 2 ms 672 KB Output is correct
28 Correct 2 ms 672 KB Output is correct
29 Correct 2 ms 672 KB Output is correct
30 Correct 2 ms 676 KB Output is correct
31 Correct 2 ms 680 KB Output is correct
32 Correct 2 ms 684 KB Output is correct
33 Correct 2 ms 688 KB Output is correct
34 Correct 3 ms 692 KB Output is correct
35 Correct 3 ms 696 KB Output is correct
36 Correct 2 ms 700 KB Output is correct
37 Correct 2 ms 704 KB Output is correct
38 Correct 2 ms 704 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 3 ms 508 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 2 ms 508 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 508 KB Output is correct
9 Correct 2 ms 508 KB Output is correct
10 Correct 2 ms 508 KB Output is correct
11 Correct 2 ms 540 KB Output is correct
12 Correct 2 ms 540 KB Output is correct
13 Correct 2 ms 548 KB Output is correct
14 Correct 2 ms 560 KB Output is correct
15 Correct 2 ms 568 KB Output is correct
16 Correct 2 ms 580 KB Output is correct
17 Correct 2 ms 592 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 644 KB Output is correct
21 Correct 2 ms 648 KB Output is correct
22 Correct 2 ms 648 KB Output is correct
23 Correct 2 ms 656 KB Output is correct
24 Correct 2 ms 660 KB Output is correct
25 Correct 2 ms 660 KB Output is correct
26 Correct 2 ms 660 KB Output is correct
27 Correct 2 ms 672 KB Output is correct
28 Correct 2 ms 672 KB Output is correct
29 Correct 2 ms 672 KB Output is correct
30 Correct 2 ms 676 KB Output is correct
31 Correct 2 ms 680 KB Output is correct
32 Correct 2 ms 684 KB Output is correct
33 Correct 2 ms 688 KB Output is correct
34 Correct 3 ms 692 KB Output is correct
35 Correct 3 ms 696 KB Output is correct
36 Correct 2 ms 700 KB Output is correct
37 Correct 2 ms 704 KB Output is correct
38 Correct 2 ms 704 KB Output is correct
39 Correct 215 ms 5876 KB Output is correct
40 Runtime error 246 ms 12876 KB Execution killed with signal 11 (could be triggered by violating memory limits)
41 Halted 0 ms 0 KB -