oj.uz

답안 #1074996

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1074996 2024-08-25T17:25:14 Z sitablechair K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 2 ms 8840 KB 
#include <bits/stdc++.h>

#define ll long long
#define ldb long double
#define endl '\n'
#define For(i,l,r) for(int i=l;i<=r;i++)
#define ForD(i,r,l) for(int i=r;i>=l;i--)
#define REP(i,l,r) For(i,l,r-1)
#define PER(i,r,l) ForD(i,r-1,l)
#define ff first
#define ss second
#define pb emplace_back
#define all(x) x.begin(),x.end()
#define All(x,n) x+1,x+1+n
#define Alll(x,n) x,x+n
#define sz(x) (signed)x.size()
#define unq(x) x.resize(unique(all(x))-x.begin())
#define mpa make_pair

#ifdef NCGM
#include"debug.h"
#else 
#define debug(...) "fr";
#endif

using namespace std;

const int N=1e5+3;
const ll INF=1e17;

int n,k,a[N],l[N],r[N];
ll f[N][104];
stack<int> skull;
vector<ll> in[N],out[N];
multiset<ll> st;
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k;
    For(i,1,n) cin >> a[i];
    fill(l,l+n+1,-1);
    fill(r,r+n+1,n+1);
    For(i,1,n) {
        while(sz(skull) && a[skull.top()]<a[i]) {
            r[skull.top()]=i;
            skull.pop();
        }
        skull.push(i);
    }
    while(sz(skull)) skull.pop();
    ForD(i,n,1) {
        while(sz(skull) && a[skull.top()]<a[i]) {
            l[skull.top()]=i;
            skull.pop();
        }
        skull.push(i);
    }
    For(i,1,n) l[i]++,r[i]--;
    For(i,0,n)
        For(j,1,k) f[i][j]=INF;
    f[1][1]=a[1];
    For(i,2,n) f[i][1]=max(1LL*a[i],f[i-1][1]);
    For(j,2,k) {
        For(i,1,n) in[i].clear(),out[i].clear();
        For(i,j,n) {
            for(auto el: in[i]) st.insert(el);
            for(auto el: out[i]) st.erase(st.find(el));
            ll cur=f[max(l[i]-1,j-1)][j-1]+a[i];
            f[i][j]=min(f[i][j],cur);
            if (sz(st)) f[i][j]=min(f[i][j],*st.begin());
            if (r[i]>i) {
                in[i+1].pb(cur);
                out[r[i]+1].pb(cur);
            }
            // For(k,j,i) f[i][j]=min(f[i][j],f[k-1][j-1]+get(k,i));
        }
    }
    cout << f[n][k];
    return 0;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8792 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 1 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8840 KB Output is correct
6 Correct 2 ms 8792 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 1 ms 8796 KB Output is correct
9 Incorrect 1 ms 8796 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 1 ms 8628 KB Output is correct
3 Correct 1 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8796 KB Output is correct
6 Correct 1 ms 8796 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Incorrect 1 ms 8796 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8792 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 1 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8840 KB Output is correct
6 Correct 2 ms 8792 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 1 ms 8796 KB Output is correct
9 Incorrect 1 ms 8796 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8792 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 1 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8840 KB Output is correct
6 Correct 2 ms 8792 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 1 ms 8796 KB Output is correct
9 Incorrect 1 ms 8796 KB Output isn't correct
10 Halted 0 ms 0 KB -