oj.uz

답안 #946240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
946240 2024-03-14T12:54:37 Z KK_1729 수열 (APIO14_sequence) C++17
50 / 100
 2000 ms 32912 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define pb push_back
#define all(a) a.begin(), a.end()
#define endl "\n"

void printVector(vector<int> a){
    for (auto x: a) cout << x << " ";
    cout << endl;
}

int max(int x, int y){
    if (x > y) return x;
    else return y;
}

void solve(){
    int n, k; cin >> n >> k;
    vector<int> a(n+1);
    FOR(i,0,n) cin >> a[i+1];

    vector<int> prefix(n+1);
    FOR(i,1,n+1) prefix[i] = prefix[i-1]+a[i];

    vector<vector<int>> dp(n+1, vector<int>(k+2));
    vector<vector<int>> prev(n+1, vector<int>(k+2));
    for (int j = 1; j <= k+1; ++j){
        for (int i = 1; i <= n; ++i){
            if (j > i) continue;
            for (int u = 0; u < i; u++){
                if (dp[u][j-1]+(prefix[i]-prefix[u])*(prefix[n]-prefix[i]) >= dp[i][j]){
                    prev[i][j] = u;
                    dp[i][j] = dp[u][j-1]+(prefix[i]-prefix[u])*(prefix[n]-prefix[i]);
                }
            }
        }
    }
    int u = n;
    int h = k+1;
    cout << dp[n][k+1] << endl;
    while (prev[u][h] != 0 && h > 1){
        cout << prev[u][h] << " ";
        u = prev[u][h];
        h--;
    }
    
    cout << endl;

}
int32_t main(){
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", stdin)
    int t = 1; // cin >> t;
    while (t--) solve();
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 348 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 5 ms 860 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 348 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 5 ms 860 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 5 ms 860 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 5 ms 860 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 604 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 344 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 4 ms 600 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 604 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 604 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 206 ms 3676 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 604 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 236 ms 3688 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 181 ms 3232 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 220 ms 3672 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 222 ms 3692 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 44 ms 1112 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 87 ms 1816 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 340 ms 1880 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 248 ms 1884 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2058 ms 32912 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2047 ms 15964 KB Time limit exceeded
2 Halted 0 ms 0 KB -