oj.uz

답안 #126957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126957 2019-07-08T17:05:31 Z AQT 수열 (APIO14_sequence) C++14
22 / 100
 1338 ms 31224 KB 
#include <bits/stdc++.h>

using namespace std;

int N, K;
long long pre[100005];
long long dp[100005][25];
int par[100005][25];
deque<int>dq;

double f(int idx1, int idx2, int lvl){
    return (dp[idx1][lvl]-dp[idx2][lvl]-pre[idx1]*pre[idx1]+pre[idx2]*pre[idx2]);
}

int main(){
    cin.sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> N >> K;
    for(int i = 1; i<=N; i++){
        cin >> pre[i];
        pre[i] += pre[i-1];
    }
    for(int k = 1; k<=K; k++){
        dq.push_back(k);
        for(int i = k+1; i<=N; i++){
            while(dq.size() >= 2){
                if(f(dq[0], dq[1], k-1) <= pre[i]*(pre[dq[1]]-pre[dq[0]])){
                    dq.pop_front();
                }
                else{
                    break;
                }
            }
            dp[i][k] = dp[dq.front()][k-1] + pre[dq.front()]*(pre[i]-pre[dq.front()]);
            par[i][k] = dq.front();
            //cout << i << " " << k << " " << dp[i][k] << " " << par[i][k] << endl;
            while(dq.size() >= 2){
                if(f(dq[dq.size()-2], dq[dq.size()-1], k-1)*(pre[i]-pre[dq.back()])
                   >= f(dq.back(), i, k-1)*(pre[dq[dq.size()-1]]-pre[dq[dq.size()-2]])){
                    dq.pop_back();
                }
                else{
                    break;
                }
            }
            dq.push_back(i);
        }
        dq.clear();
    }
    cout << dp[N][K] << "\n";
    int crnt = N;
    for(int k = K; k>=1; k--){
        cout << par[crnt][k] << " ";
        crnt = par[crnt][k];
    }
    cout << "\n";
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 376 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 376 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 376 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 376 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 376 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 376 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 376 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 376 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 376 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 376 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 376 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 376 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 380 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 376 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 380 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 376 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 376 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 376 KB contestant found the optimal answer: 933702 == 933702
7 Correct 2 ms 376 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 376 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 376 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 504 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 376 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 376 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 380 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Incorrect 3 ms 376 KB declared answer doesn't correspond to the split scheme: declared = 1019625819, real = 1019625716
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 632 KB contestant found the optimal answer: 140412195 == 140412195
3 Incorrect 10 ms 764 KB declared answer doesn't correspond to the split scheme: declared = 49729674225461, real = 49714281154746
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3448 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 3448 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Incorrect 86 ms 3492 KB declared answer doesn't correspond to the split scheme: declared = 4973126687469639, real = 4549928873438477
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 30712 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 54 ms 30840 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Incorrect 1338 ms 31224 KB declared answer doesn't correspond to the split scheme: declared = 497313449256899208, real = 440698798889299986
4 Halted 0 ms 0 KB -