oj.uz

Submission #473656

# Submission time Handle Problem Language Result Execution time Memory
473656 2021-09-15T19:36:59 Z ogibogi2004 Money (IZhO17_money) C++14
0 / 100
 1 ms 332 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e6+6;
int dp[MAXN],n,a[MAXN],mappeda[MAXN];
int fen[MAXN];
void update(int idx,int val)
{
    for(;idx<MAXN;idx+=idx&(-idx))
    {
        fen[idx]+=val;
    }
}
int query(int idx)
{
    int ret=0;
    for(;idx>0;idx-=idx&(-idx))
    {
        ret+=fen[idx];
    }
    return ret;
}
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        update(a[i],+1);
    }
    int ans=1,last=a[n];
    for(int i=n;i>=1;i--)
    {
        if(i!=n&&a[i]>=a[i+1])
        {
            ans++;
            last=a[i];
        }
        update(a[i],-1);
        if(query(last-1)-query(a[i])>0)
        {
            last=a[i];
            ans++;
        }
    }
    cout<<ans<<endl;
return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Incorrect 1 ms 332 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Incorrect 1 ms 332 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Incorrect 1 ms 332 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Incorrect 1 ms 332 KB Output isn't correct
8 Halted 0 ms 0 KB -