Submission #6964

# Submission time Handle Problem Language Result Execution time Memory
6964 2014-07-10T16:34:40 Z tncks0121 Split the sequence (APIO14_sequence) C++
100 / 100
1408 ms 84904 KB
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <bits/stdc++.h>
#include <memory.h>
  
typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef long double llf;
typedef unsigned int uint;
  
using namespace std;
  
const int N_ = 100500, K_ = 205;
int N, K, A[N_];
ll Table[2][N_], S[N_];
int opt[K_][N_];
  
void solve (int k, int i) {
    if(k == 1) return;
    solve(k - 1, opt[k][i] - 1);
    printf("%d ", opt[k][i] - 1);
}
 
ll *now, *prev;
 
void conq (int k, int l, int r, int optl, int optr) {
  int m = (l+r) >> 1;
  for(int j = optl; j <= optr && j <= m; j++) {
    ll val = prev[j-1] + (S[m] - S[j-1]) * (S[N] - S[m]);
    if(val >= now[m]) now[m] = val, opt[k][m] = j;
  }
  if(l < r) {
    conq (k, l, m-1, optl, opt[k][m]);
    conq (k, m+1, r, opt[k][m], optr);
  }
}
  
int main() {
    scanf("%d%d", &N, &K);
    for(int i = 1; i <= N; i++) scanf("%d", A+i), S[i] = S[i-1] + A[i];
  
    for(int i = 1; i <= N; i++) Table[1][i] = S[i] * (S[N] - S[i]);
    for(int k = 2; k <= K+1; k++) {
        now = Table[k&1], prev = Table[~k&1];
        for(int i = 1; i <= N; i++) now[i] = -1, opt[k][i] = -1;
        conq(k, k, N, k, N);
    }
  
    printf("%lld\n", Table[~K&1][N]);
    solve(K+1, N);
  
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 108 == 108
2 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 999 == 999
3 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 0 == 0
4 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 1 == 1
7 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 1 == 1
8 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 1 == 1
9 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 805 == 805
16 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 311760000 == 311760000
3 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 107630884 == 107630884
7 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 193556962 == 193556962
9 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 140412195 == 140412195
3 Correct 8 ms 84904 KB Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 8 ms 84904 KB Output is correct - contestant found the optimal answer: 679388326 == 679388326
6 Correct 4 ms 84904 KB Output is correct - contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 8 ms 84904 KB Output is correct - contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 4 ms 84904 KB Output is correct - contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 84904 KB Output is correct - contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 92 ms 84904 KB Output is correct - contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 0 ms 84904 KB Output is correct - contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 72 ms 84904 KB Output is correct - contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 68 ms 84904 KB Output is correct - contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 88 ms 84904 KB Output is correct - contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 60 ms 84904 KB Output is correct - contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 72 ms 84904 KB Output is correct - contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 88 ms 84904 KB Output is correct - contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 32 ms 84904 KB Output is correct - contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 32 ms 84904 KB Output is correct - contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1040 ms 84904 KB Output is correct - contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 28 ms 84904 KB Output is correct - contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1408 ms 84904 KB Output is correct - contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 884 ms 84904 KB Output is correct - contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1044 ms 84904 KB Output is correct - contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 776 ms 84904 KB Output is correct - contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 816 ms 84904 KB Output is correct - contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1044 ms 84904 KB Output is correct - contestant found the optimal answer: 124309619349406845 == 124309619349406845