oj.uz

Submission #925424

# Submission time Handle Problem Language Result Execution time Memory
925424 2024-02-11T15:15:45 Z De3b0o Financial Report (JOI21_financial) C++14
5 / 100
 42 ms 9800 KB 
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define er erase
#define pb push_back
#define ppb pop_back()
#define ph push
#define pp pop()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007

using namespace std;

int main()
{
    d3
    ll n , d;
    cin >> n >> d;
    ll a[n];
    for(int i = 0 ; n>i ; i++)
        cin >> a[i];
    if(d==1)
    {
        ll mx = 0;
        ll ans = 0;
        for(int i = 0 ; n>i ; i++)
        {
            if(a[i]>mx)
                ans++;
            mx=max(mx,a[i]);
        }
        cans
        return 0;
    }
    if(d==n)
    {
        vector<ll> ans;
        for(int i = 0 ; n>i ; i++)
        {
            auto it = lower_bound(ans.begin(),ans.end(),a[i]);
            if(it==ans.end())
                ans.pb(a[i]);
            else
                *it = a[i];
        }
        cout << ans.size();
        return 0;
    }
    ll ans[n];
    ans[0]=1;
    for(int i = 1 ; n>i ; i++)
    {
        ll mx = 0;
        ll j = i-d;
        if(j<0)
            j=0;
        ll h = i-1;
        while(h>=j)
        {
            if(a[h]<a[i])
                mx=max(mx,ans[h]);
            if(a[h]<a[i])
                j=h-d;
            if(j<0)
                j=0;
            h--;
        }
        ans[i]=mx+1;
    }
    ll mx = 0;
    for(int i = 0 ; n>i ; i++)
        mx=max(mx,ans[i]);
    cout << mx;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2648 KB Output is correct
2 Incorrect 22 ms 2652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 2904 KB Output is correct
2 Correct 36 ms 5468 KB Output is correct
3 Correct 38 ms 5592 KB Output is correct
4 Correct 39 ms 5464 KB Output is correct
5 Correct 42 ms 6876 KB Output is correct
6 Correct 38 ms 5712 KB Output is correct
7 Correct 34 ms 9800 KB Output is correct
8 Correct 23 ms 5724 KB Output is correct
9 Correct 32 ms 6812 KB Output is correct
10 Correct 36 ms 5720 KB Output is correct
11 Correct 38 ms 5456 KB Output is correct
12 Correct 26 ms 5596 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -