oj.uz

Submission #470440

# Submission time Handle Problem Language Result Execution time Memory
470440 2021-09-03T18:45:10 Z Newtech66 K blocks (IZhO14_blocks) C++17
0 / 100
 1 ms 588 KB 
#include<bits/stdc++.h>
using namespace std;
using lol=long long int;
#define endl "\n"
const lol mod1=1e9+7,mod2=998244353;
const lol inf=1e15+8;
const double eps=1e-12;
const int N=1e5+5;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int lo2g[N];

int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lo2g[1]=0;
for(int i=2;i<N;i++)    lo2g[i]=lo2g[i/2]+1;
int _=1;
//cin>>_;
while(_--)
{
    int n,k;
    cin>>n>>k;
    vector<lol> v(n);
    for(auto& e:v)  cin>>e;
    vector<vector<pair<lol,lol>>> dp(n,vector<pair<lol,lol>>(k));
    dp[0][0]={v[0],v[0]};
    for(int i=1;i<k;i++)
    {
        dp[0][i]={inf,inf};
    }
    for(int i=1;i<n;i++)
    {
        dp[i][0]={*max_element(v.begin(),v.begin()+i+1),*max_element(v.begin(),v.begin()+i+1)};
        for(int j=1;j<k;j++)
        {
            lol M=dp[i-1][j].second;
            if(M==inf)
            {
                dp[i][j]={dp[i-1][j-1].first+v[i],v[i]};
                continue;
            }
            lol a=dp[i-1][j].first+max(v[i]-M,0ll),b=dp[i-1][j-1].first+v[i];
            if(a<b) dp[i][j]={a,max(v[i],M)};
            else   dp[i][j]={b,v[i]};
        }
    }
    /*for(int i=0;i<n;i++)
    {
        for(int j=0;j<k;j++)
        {
            cout<<dp[i][j].first<<" ";
        }
        cout<<endl;
    }*/
    cout<<dp[n-1][k-1].first;
}
return 0;
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

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