oj.uz

Submission #556057

# Submission time Handle Problem Language Result Execution time Memory
556057 2022-05-02T09:29:30 Z HeatDroppa Stove (JOI18_stove) C++14
50 / 100
 1000 ms 2644 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll lim=1e5+4;
const ll inf=1e18;
ll dp_new[lim];
ll dp_old[lim];
ll t[lim];
ll n,k;
void solve(ll l,ll r,ll optl,ll optr)
{
    if(l>r) return ;
    ll med=(l+r)>>1;
    pair<ll,ll> bst={inf,-1};
    for(ll i=optl;i<=min(med,optr);++i)
        bst=min(bst,{dp_old[i-1]+t[med]-t[i]+1,i});
    ll opt=bst.second;
    dp_new[med]=bst.first;
    solve(l,med-1,optl,opt);
    solve(med+1,r,opt,optr);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>n>>k;
    for(ll i=1;i<=n;++i)
        cin>>t[i];
    for(ll i=1;i<=n;++i)
        dp_old[i]=t[i]-t[1]+1;
    for(ll i=2;i<=k;++i)
        solve(i,n,i,n),
        swap(dp_old,dp_new);
    cout<<dp_old[n]<<'\n';
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 2 ms 1876 KB Output is correct
5 Correct 2 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 2 ms 1876 KB Output is correct
8 Correct 2 ms 1876 KB Output is correct
9 Correct 0 ms 212 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 2 ms 1876 KB Output is correct
5 Correct 2 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 2 ms 1876 KB Output is correct
8 Correct 2 ms 1876 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 4 ms 1876 KB Output is correct
11 Correct 17 ms 1924 KB Output is correct
12 Correct 153 ms 1900 KB Output is correct
13 Correct 264 ms 1904 KB Output is correct
14 Correct 390 ms 1896 KB Output is correct
15 Correct 381 ms 1900 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 2 ms 1876 KB Output is correct
5 Correct 2 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 2 ms 1876 KB Output is correct
8 Correct 2 ms 1876 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 4 ms 1876 KB Output is correct
11 Correct 17 ms 1924 KB Output is correct
12 Correct 153 ms 1900 KB Output is correct
13 Correct 264 ms 1904 KB Output is correct
14 Correct 390 ms 1896 KB Output is correct
15 Correct 381 ms 1900 KB Output is correct
16 Correct 34 ms 2644 KB Output is correct
17 Correct 239 ms 2644 KB Output is correct
18 Execution timed out 1088 ms 2644 KB Time limit exceeded
19 Halted 0 ms 0 KB -