oj.uz

Submission #526099

# Submission time Handle Problem Language Result Execution time Memory
526099 2022-02-13T17:32:45 Z TheKingAleks Money (IZhO17_money) C++14
0 / 100
 1 ms 324 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAX_N = 1e6+2;
int a[MAX_N];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin>>n;
    for(int i=0; i<n; i++)
    {
        cin>>a[i];
    }
    multiset<int> s;
    s.insert(a[0]);
    for(int i=1; i<n; i++)
    {
        if(a[i] >= a[i-1])
        {
            s.insert(a[i]);
        }
        else break;
    }
    int idx = s.size();
    int ans = 1;
    while(idx < n)
    {
        vector<int> cur;
        set<int>::iterator first_lower_bound = s.lower_bound(a[idx]+1);
        cur.push_back(a[idx]);
        idx++;
        ans++;
        while(idx < n)
        {
            if(a[idx] < a[idx-1]) break;
            set<int>::iterator tmp = s.lower_bound(a[idx]);
            if(tmp != first_lower_bound)
            {
                break;
            }
            cur.push_back(a[idx]);
            idx++;
        }
        for(auto x: cur) s.insert(x);
//        for(auto x: cur)
//        {
//            cout<<x<<" ";
//        }
//        cout<<endl;
    }
    cout<<ans<<endl;
}
/**
6
3 6 4 5 1 2
*/

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 55.0

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