Submission #851736

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
851736	2023-09-20T13:57:33 Z	Trumling	Financial Report (JOI21_financial)	C++14	5 / 100	100 ms	5280 KB

Main

#include<bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()
 
int main()
{
    ll n,d;
    cin>>n>>d;
    ll x;
    vector<int>v;
    for(int i=0;i<n;i++)
    {
        cin>>x;
        if(!v.size() || v[v.size()-1]<x)
        v.pb(x);
        else
        {
            ll pos=lower_bound(all(v),x)-v.begin();
            v[pos]=x;
        }
    }   
    cout<<v.size();
}

Subtask #1

0 / 14.0

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

Subtask #2

0 / 14.0

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

Subtask #3

0 / 20.0

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

Subtask #4

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	80 ms	412 KB	Output is correct
2	Correct	88 ms	2952 KB	Output is correct
3	Incorrect	93 ms	3160 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #5

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	85 ms	404 KB	Output is correct
2	Correct	89 ms	3152 KB	Output is correct
3	Correct	92 ms	3152 KB	Output is correct
4	Correct	94 ms	3152 KB	Output is correct
5	Correct	96 ms	3784 KB	Output is correct
6	Correct	92 ms	3152 KB	Output is correct
7	Correct	81 ms	5280 KB	Output is correct
8	Correct	83 ms	3336 KB	Output is correct
9	Correct	86 ms	3528 KB	Output is correct
10	Correct	91 ms	3152 KB	Output is correct
11	Correct	100 ms	3284 KB	Output is correct
12	Correct	84 ms	3212 KB	Output is correct

Subtask #6

0 / 35.0

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