oj.uz

Submission #286528

# Submission time Handle Problem Language Result Execution time Memory
286528 2020-08-30T14:05:04 Z BeanZ Split the sequence (APIO14_sequence) C++14
21 / 100
 2000 ms 82684 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 bestl = optr, bestr = 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] + 1ll * a[i] * (a[mid] - a[i]);
                        bestl = min(bestl, i);
                        bestr = max(bestr, i);
                        opt[mid][k] = i;
                }
                if (dp[mid][1] < (dp[i][0] + 1ll * a[i] * (a[mid] - a[i]))){
                        dp[mid][1] = dp[i][0] + 1ll * a[i] * (a[mid] - a[i]);
                        bestl = i;
                        bestr = i;
                        opt[mid][k] = i;
                }
        }
        DP(k, l, mid - 1, optl, bestr);
        DP(k, mid + 1, r, bestl, 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:38:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   38 |                 freopen("VietCT.INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:39:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   39 |                 freopen("VietCT.OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 384 KB contestant found the optimal answer: 999 == 999
3 Incorrect 1 ms 384 KB Integer 0 violates the range [1, 1]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB contestant found the optimal answer: 1093956 == 1093956
2 Incorrect 1 ms 384 KB contestant didn't find the optimal answer: 202461680 < 302460000
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB contestant found the optimal answer: 610590000 == 610590000
2 Incorrect 1 ms 512 KB contestant didn't find the optimal answer: 211798415 < 311760000
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory 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 Correct 8 ms 1152 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1152 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Incorrect 13 ms 1152 KB contestant didn't find the optimal answer: 579388374 < 679388326
6 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8576 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 8 ms 8576 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 103 ms 8576 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 7 ms 8576 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 115 ms 8636 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 111 ms 8636 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 95 ms 8576 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 79 ms 8576 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 96 ms 8576 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 131 ms 8576 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 82684 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 80 ms 82680 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1957 ms 82680 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 74 ms 82680 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Execution timed out 2048 ms 82680 KB Time limit exceeded
6 Halted 0 ms 0 KB -