oj.uz

Submission #37179

# Submission time Handle Problem Language Result Execution time Memory
37179 2017-12-22T09:21:24 Z Ulugbek_Abdimanabov Money (IZhO17_money) C++14
45 / 100
 1500 ms 53220 KB 
#include <bits/stdc++.h>

typedef long long ll;
typedef long double ld;
#define vi vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define rep(i,a,n) for(ll i=a; i<n; i++)
#define per(i,a,n) for(ll i=n-1; i>=a; i--)
#define F first
#define S second
#define maxx(a,b) a=max(a,b)
#define minn(a,b) a=min(a,b)
#define db(x) cerr << #x << " = " << x << endl
#define N 1111111

using namespace std;
int a[N];

int main()
{
//    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

   // freopen("money.in","r",stdin);
    //freopen("money.out","w",stdout);

        int n; cin>>n;
                rep(i,0,n)scanf("%d",&a[i]);
                    set<int> s;
                int ans=0;
                s.insert(1e6+1);

                for(int i=0; i<n;)
                {
                    int limit=*s.upper_bound(a[i]);
                    int last=a[i];
                    while(i<n&&a[i]>=last&&a[i]<=limit)last=a[i],s.insert(a[i]),i++;
                    ans++;
                }

                    cout<<ans;

    return 0;
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:28:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 rep(i,0,n)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 76 ms 6360 KB Output is correct
40 Correct 173 ms 6360 KB Output is correct
41 Correct 63 ms 6360 KB Output is correct
42 Correct 63 ms 6360 KB Output is correct
43 Correct 49 ms 6360 KB Output is correct
44 Correct 196 ms 6360 KB Output is correct
45 Correct 186 ms 6360 KB Output is correct
46 Correct 236 ms 6360 KB Output is correct
47 Correct 166 ms 6360 KB Output is correct
48 Correct 189 ms 6360 KB Output is correct
49 Correct 759 ms 24840 KB Output is correct
50 Correct 786 ms 24840 KB Output is correct
51 Correct 756 ms 24840 KB Output is correct
52 Correct 773 ms 24840 KB Output is correct
53 Correct 773 ms 24840 KB Output is correct
54 Correct 759 ms 24840 KB Output is correct
55 Execution timed out 1500 ms 53220 KB Execution timed out
56 Halted 0 ms 0 KB -