oj.uz

Submission #36148

# Submission time Handle Problem Language Result Execution time Memory
36148 2017-12-06T04:17:33 Z Kanvie Money (IZhO17_money) C++14
100 / 100
 413 ms 6080 KB 
#include<bits/stdc++.h>
using namespace std;
int f[1000001]={0},n,ans=0,trc=0,trc_M,x;
void update(int pos,int value)
{
    for (int i=pos; i<=1000000; i+=(i&(-i)))f[i]+=value;
}
int get(int pos)
{
    int r=0;
    for (int i=pos; i>=1; i-=(i&(-i)))r+=f[i];
    return r;
}
int gets(int ll, int rr)
{
    return get(rr)-get(ll-1);
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);
    stack<int>q;
    memset(f,0,sizeof(f));
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&x);
        if(ans==0)
        {
            q.push(x);
            ans++;
            trc=x;
            trc_M=x;
            continue;
        }
        if(x<trc||(trc_M+1<x&&gets(trc_M+1,x-1)>0))
        {
            ans++;
            trc=x;
            trc_M=x;
            while(!q.empty())
            {
                update(q.top(),1);
                q.pop();
            }
            q.push(x);
            continue;
        }
        trc=x;
        q.push(x);
    }
    printf("%d",ans);
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:23:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
money.cpp:26:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&x);
                       ^

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6080 KB Output is correct
2 Correct 0 ms 6080 KB Output is correct
3 Correct 3 ms 6080 KB Output is correct
4 Correct 0 ms 6080 KB Output is correct
5 Correct 0 ms 6080 KB Output is correct
6 Correct 3 ms 6080 KB Output is correct
7 Correct 0 ms 6080 KB Output is correct
8 Correct 0 ms 6080 KB Output is correct
9 Correct 0 ms 6080 KB Output is correct
10 Correct 0 ms 6080 KB Output is correct
11 Correct 0 ms 6080 KB Output is correct
12 Correct 0 ms 6080 KB Output is correct
13 Correct 0 ms 6080 KB Output is correct
14 Correct 3 ms 6080 KB Output is correct
15 Correct 0 ms 6080 KB Output is correct
16 Correct 0 ms 6080 KB Output is correct
17 Correct 0 ms 6080 KB Output is correct
18 Correct 0 ms 6080 KB Output is correct
19 Correct 0 ms 6080 KB Output is correct
20 Correct 0 ms 6080 KB Output is correct
21 Correct 3 ms 6080 KB Output is correct
22 Correct 3 ms 6080 KB Output is correct
23 Correct 3 ms 6080 KB Output is correct
24 Correct 0 ms 6080 KB Output is correct
25 Correct 0 ms 6080 KB Output is correct
26 Correct 0 ms 6080 KB Output is correct
27 Correct 3 ms 6080 KB Output is correct
28 Correct 3 ms 6080 KB Output is correct
29 Correct 0 ms 6080 KB Output is correct
30 Correct 0 ms 6080 KB Output is correct
31 Correct 0 ms 6080 KB Output is correct
32 Correct 0 ms 6080 KB Output is correct
33 Correct 3 ms 6080 KB Output is correct
34 Correct 3 ms 6080 KB Output is correct
35 Correct 0 ms 6080 KB Output is correct
36 Correct 3 ms 6080 KB Output is correct
37 Correct 0 ms 6080 KB Output is correct
38 Correct 0 ms 6080 KB Output is correct
39 Correct 106 ms 6080 KB Output is correct
40 Correct 236 ms 6080 KB Output is correct
41 Correct 76 ms 6080 KB Output is correct
42 Correct 79 ms 6080 KB Output is correct
43 Correct 46 ms 6080 KB Output is correct
44 Correct 289 ms 6080 KB Output is correct
45 Correct 246 ms 6080 KB Output is correct
46 Correct 276 ms 6080 KB Output is correct
47 Correct 236 ms 6080 KB Output is correct
48 Correct 233 ms 6080 KB Output is correct
49 Correct 259 ms 6080 KB Output is correct
50 Correct 269 ms 6080 KB Output is correct
51 Correct 276 ms 6080 KB Output is correct
52 Correct 256 ms 6080 KB Output is correct
53 Correct 283 ms 6080 KB Output is correct
54 Correct 309 ms 6080 KB Output is correct
55 Correct 373 ms 6080 KB Output is correct
56 Correct 359 ms 6080 KB Output is correct
57 Correct 383 ms 6080 KB Output is correct
58 Correct 406 ms 6080 KB Output is correct
59 Correct 413 ms 6080 KB Output is correct
60 Correct 366 ms 6080 KB Output is correct
61 Correct 339 ms 6080 KB Output is correct
62 Correct 329 ms 6080 KB Output is correct