oj.uz

답안 #983005

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983005 2024-05-15T06:50:35 Z Hugo1729 수열 (APIO14_sequence) C++11
50 / 100
 2000 ms 104644 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll dp[100001][202]={0};
ll pref[100001]={0};
ll p[100001][202];

int main(){
    // cin.tie(0)->sync_with_stdio(0);

    int n, k; cin >> n >> k;
    vector<ll> a(n);
    for(int i=0;i<n;i++)cin >> a[i];
    for(int i=0;i<n;i++)pref[i+1]=pref[i]+a[i];

    for(int j=1;j<=k+1;j++){
        for(int i=1;i<=n;i++){   //maak i = 0
            for(int x=0;x<i;x++){
                if(dp[x][j-1]+(pref[i]-pref[x])*(pref[n]-pref[i])>=dp[i][j]){
                    dp[i][j]=dp[x][j-1]+(pref[i]-pref[x])*(pref[n]-pref[i]);
                    p[i][j]=x;
                }
            }
            // cout << '(' << i << ' ' << j << ')' << dp[i][j] << ' ' << p[i][j] << ' ';
        }
        // cout << '\n';
    }

    cout << dp[n][++k] << '\n';

    int sus=p[n][k--];

    while(k>0){
        cout << sus << ' ';
        sus=p[sus][k--];
    }

    return 0;
// 7 3
// 4 1 3 4 0 2 3

}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 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 344 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 0 ms 348 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 500 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 348 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 348 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 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 448 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 444 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 1 ms 604 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 600 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 604 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 604 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 856 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 604 KB contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 604 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 604 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 604 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 604 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 860 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 860 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 2908 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 4 ms 856 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 860 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 860 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 1112 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3420 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 6 ms 3420 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 107 ms 3420 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 3420 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 107 ms 3636 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 97 ms 3668 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 108 ms 3620 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 116 ms 3416 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 23 ms 3420 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 51 ms 3420 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 578 ms 32196 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 555 ms 32340 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2035 ms 32188 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

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