Submission #598049

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
598049	2022-07-17T12:55:32 Z	Summers	Money (IZhO17_money)	C++14	0 / 100	1 ms	336 KB

money

#include<bits/stdc++.h>
#include<set>
#define endl '\n'
using namespace std;
set<long long>st;
long long a[1000001];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    long long i,j,n,ans=0;

    cin>>n;

    for(i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    st.insert(a[1]); st.insert(1000001);

    for(i=2;i<=n;)
    {
        auto it=st.upper_bound(a[i]);
        st.insert(a[i]);
        i++;
        while(i<=n && a[i]>=a[i-1] && a[i]<=(*it))
        {
            st.insert(a[i]); i++;
        }
        ans++;
    }
    cout<<ans<<endl;

}

Compilation message

money.cpp: In function 'int main()':
money.cpp:13:17: warning: unused variable 'j' [-Wunused-variable]
   13 |     long long i,j,n,ans=0;
      |                 ^

Subtask #1

0 / 9.0

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

Subtask #2

0 / 16.0

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

Subtask #3

0 / 20.0

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

Subtask #4

0 / 55.0

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