oj.uz

답안 #702111

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
702111 2023-02-23T01:52:31 Z Darren0724 K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 1 ms 468 KB 
#include <bits/stdc++.h>
using namespace std;
const int INF=1e9;
vector<int> v;
struct sparse_table{
    vector<vector<int>> sp;
    int k=20;
    void build(int n){
        sp.resize(k,vector<int>(n));
        for(int i=0;i<n;i++){
            sp[0][i]=v[i];
        }
        for(int i=1;i<k;i++){
            for(int j=0;j+(1<<i)<=n;j++){
                sp[i][j]=max(sp[i-1][j],sp[i-1][j+(1<<(i-1))]);
            }
        }
    }
    int ask(int a,int b){
        int p=b-a;
        int t=__lg(p);
        return max(sp[t][a],sp[t][b-(1<<t)]);
    }
};

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n,k;cin>>n>>k;
    v.resize(n);
    for(int i=1;i<=n;i++){
        cin>>v[i];
    }
    sparse_table sp;
    sp.build(n+1);
    vector<vector<int>> dp(k+1,vector<int>(n+1,INF)),dp1(k+1,vector<int>(n+1,-1));
    dp[0][0]=0;
    for(int i=1;i<=k;i++){
        for(int j=1;j<=n;j++){
            for(int k1=j-1;k1>=0;k1--){
                if(dp[i-1][k1]+sp.ask(k1+1,j+1)<dp[i][j]){
                    dp[i][j]=dp[i-1][k1]+sp.ask(k1+1,j+1);
                    dp1[i][j]=k1;
                }
            }
        }
    }
    /*for(int i=0;i<=k;i++){
        for(int j=1;j<=n;j++){
            cout<<dp[i][j]<<' ';
        }
        cout<<endl;
    }
    for(int i=0;i<=k;i++){
        for(int j=1;j<=n;j++){
            cout<<dp1[i][j]<<' ';
        }
        cout<<endl;
    }*/
    cout<<dp[k][n]<<endl;

    return 0;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Runtime error 1 ms 468 KB Execution killed with signal 6
9 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Runtime error 1 ms 468 KB Execution killed with signal 6
9 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Runtime error 1 ms 468 KB Execution killed with signal 6
9 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Runtime error 1 ms 468 KB Execution killed with signal 6
9 Halted 0 ms 0 KB -