oj.uz

Submission #286519

# Submission time Handle Problem Language Result Execution time Memory
286519 2020-08-30T13:59:41 Z BeanZ Split the sequence (APIO14_sequence) C++14
100 / 100
 1836 ms 83192 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] + 1ll * 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

# 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 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 0 ms 384 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 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 512 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 0 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 0 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
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 384 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 384 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 384 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 384 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 384 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 384 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 384 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 384 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 384 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 512 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 512 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 512 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 512 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 1 ms 512 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 1 ms 512 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 512 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 512 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 512 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.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 7 ms 1152 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1152 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 8 ms 1152 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 7 ms 1152 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 8 ms 1152 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 6 ms 1152 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 1152 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 3 ms 1152 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8576 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 8576 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 85 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 65 ms 8576 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 67 ms 8576 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 78 ms 8616 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 58 ms 8620 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 65 ms 8576 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 83 ms 8612 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 82540 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 68 ms 82704 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1756 ms 82576 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 68 ms 82552 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1836 ms 82552 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 1258 ms 82808 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1398 ms 83192 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 1089 ms 83068 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 1277 ms 82948 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1613 ms 83064 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845