oj.uz

답안 #286517

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
286517 2020-08-30T13:58:38 Z BeanZ 수열 (APIO14_sequence) C++14
11 / 100
 79 ms 82680 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl '\n'

const int N = 1e5 + 5;
ll dp[N][2];
int opt[N][205];
int a[N];
void DP(int k, int l, int r, int optl, int optr){
        if (l > r) return;
        int mid = (l + r) >> 1;
        dp[mid][1] = -1e18;
        int best = optl;
        for (int i = optl; i <= min(mid - 1, optr); i++){
                if (dp[mid][1] <= (dp[i][0] + 1ll * a[i] * (a[mid] - a[i]))){
                        dp[mid][1] = dp[i][0] + a[i] * (a[mid] - a[i]);
                        best = i;
                        opt[mid][k] = i;
                }
        }
        DP(k, l, mid - 1, optl, best);
        DP(k, mid + 1, r, best, optr);
}
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("VietCT.INP", "r")){
                freopen("VietCT.INP", "r", stdin);
                freopen("VietCT.OUT", "w", stdout);
        }
        int n, k;
        cin >> n >> k;
        for (int i = 1; i <= n; i++) cin >> a[i], a[i] = a[i] + a[i - 1];
        for (int i = 1; i <= k; i++){
                DP(i, 1, n, 1, n);
                for (int j = 1; j <= n; j++){
                        dp[j][0] = dp[j][1];
                }
        }
        cout << dp[n][1] << endl;
        for (int i = k; i >= 1; i--){
                cout << opt[n][i] << " ";
                n = opt[n][i];
        }
}
/*
7 3
4 1 3 4 0 2 3
*/

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:31:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   31 |                 freopen("VietCT.INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:32:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   32 |                 freopen("VietCT.OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 384 KB contestant found the optimal answer: 302460000 == 302460000
3 Incorrect 1 ms 384 KB declared answer doesn't correspond to the split scheme: declared = 2194370073, real = 122453454361
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 74 ms 82680 KB declared answer doesn't correspond to the split scheme: declared = 2147433776, real = 6442401072
2 Halted 0 ms 0 KB -