oj.uz

Submission #36243

# Submission time Handle Problem Language Result Execution time Memory
36243 2017-12-06T13:49:29 Z touristk2000 Money (IZhO17_money) C++14
45 / 100
 1500 ms 53220 KB 
#include <bits/stdc++.h>
#define inf 1111111
using namespace std;
int n,tom;
int a[inf];
set<int> kom;
int main(){
    //freopen("money.in","r",stdin);
	//freopen("money.out","w",stdout);
    scanf("%d",&n); 
    for(int i =0; i < n; i ++) scanf("%d",a + i);
    kom.insert(inf);
    int i = 0; 
    while(i < n){
        kom.insert(a[i]);
        int up = *kom.upper_bound(a[i]);
        int j = i + 1;
        while(a[j - 1] <= a[j] && a[j] <= up){
            kom.insert(a[j ++]);
        }
        tom ++;
        i = j;
    }
    cout << tom;
    return 0;
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:10:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n); 
                   ^
money.cpp:11:49: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i =0; i < n; i ++) scanf("%d",a + i);
                                                 ^

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6360 KB Output is correct
2 Correct 0 ms 6360 KB Output is correct
3 Correct 0 ms 6360 KB Output is correct
4 Correct 0 ms 6360 KB Output is correct
5 Correct 0 ms 6360 KB Output is correct
6 Correct 0 ms 6360 KB Output is correct
7 Correct 0 ms 6360 KB Output is correct
8 Correct 0 ms 6360 KB Output is correct
9 Correct 0 ms 6360 KB Output is correct
10 Correct 0 ms 6360 KB Output is correct
11 Correct 0 ms 6360 KB Output is correct
12 Correct 0 ms 6360 KB Output is correct
13 Correct 0 ms 6360 KB Output is correct
14 Correct 0 ms 6360 KB Output is correct
15 Correct 0 ms 6360 KB Output is correct
16 Correct 0 ms 6360 KB Output is correct
17 Correct 0 ms 6360 KB Output is correct
18 Correct 0 ms 6360 KB Output is correct
19 Correct 0 ms 6360 KB Output is correct
20 Correct 0 ms 6360 KB Output is correct
21 Correct 0 ms 6360 KB Output is correct
22 Correct 0 ms 6360 KB Output is correct
23 Correct 0 ms 6360 KB Output is correct
24 Correct 0 ms 6360 KB Output is correct
25 Correct 0 ms 6360 KB Output is correct
26 Correct 0 ms 6360 KB Output is correct
27 Correct 0 ms 6360 KB Output is correct
28 Correct 0 ms 6360 KB Output is correct
29 Correct 0 ms 6360 KB Output is correct
30 Correct 0 ms 6360 KB Output is correct
31 Correct 0 ms 6360 KB Output is correct
32 Correct 0 ms 6360 KB Output is correct
33 Correct 0 ms 6360 KB Output is correct
34 Correct 0 ms 6360 KB Output is correct
35 Correct 0 ms 6360 KB Output is correct
36 Correct 0 ms 6360 KB Output is correct
37 Correct 0 ms 6360 KB Output is correct
38 Correct 0 ms 6360 KB Output is correct
39 Correct 106 ms 6360 KB Output is correct
40 Correct 149 ms 6360 KB Output is correct
41 Correct 73 ms 6360 KB Output is correct
42 Correct 109 ms 6360 KB Output is correct
43 Correct 49 ms 6360 KB Output is correct
44 Correct 236 ms 6360 KB Output is correct
45 Correct 169 ms 6360 KB Output is correct
46 Correct 219 ms 6360 KB Output is correct
47 Correct 179 ms 6360 KB Output is correct
48 Correct 199 ms 6360 KB Output is correct
49 Correct 879 ms 24840 KB Output is correct
50 Correct 893 ms 24840 KB Output is correct
51 Correct 886 ms 24840 KB Output is correct
52 Correct 939 ms 24840 KB Output is correct
53 Correct 773 ms 24840 KB Output is correct
54 Correct 789 ms 24840 KB Output is correct
55 Execution timed out 1500 ms 53220 KB Execution timed out
56 Halted 0 ms 0 KB -