oj.uz

답안 #92432

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
92432 2019-01-02T20:33:18 Z Vardanyan 수열 (APIO14_sequence) C++14
100 / 100
 1281 ms 81456 KB 
//#pragma GCC optimize "-O3"
#include<bits/stdc++.h>

using namespace std;
const int N = 1000*100+5;
const long long INF = 1000000000000000000;

int a[N];
long long pref[N];
long long dp[2][N];
int par[202][N];
void get(int kk,int l,int r,int s,int e){
    if(l>r) return;
    int i = (l+r)/2;
    int pos = -1;
    long long mx = -1;
    for(int j = s;j<=e;j++){
            if(dp[0][j]+(pref[i]-pref[j])*pref[j]>mx){
                       pos = j;
                       mx = dp[0][j]+(pref[i]-pref[j])*pref[j];
                       dp[1][i] = dp[0][pos]+(pref[i]-pref[pos])*pref[pos];
                       par[kk][i] = pos;
            }
    }
   // pos = max(1,pos);
    get(kk,l,i-1,s,pos);
    get(kk,i+1,r,pos,e);
}
int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i = 1;i<=n;i++) scanf("%d",&a[i]);
    for(int i = 1;i<=n;i++) pref[i] = pref[i-1]+a[i];
    for(int kk = 1;kk<=k;kk++){
            get(kk,kk,n,kk,n);
            for(int i = 0;i<=n;i++) dp[0][i] = dp[1][i];
            for(int i = 0;i<=n;i++) dp[1][i] = 0;
    }

    printf("%lld\n",dp[0][n]);
    int kk = k;
    int nn = n;
    while(kk>0){
        printf("%d\n",par[kk][nn]);
        nn = par[kk][nn];
        kk--;
    }
    printf("\n");
    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:32:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&k);
     ~~~~~^~~~~~~~~~~~~~
sequence.cpp:33:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1;i<=n;i++) scanf("%d",&a[i]);
                             ~~~~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 376 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 632 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 376 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 376 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 376 KB contestant found the optimal answer: 933702 == 933702
7 Correct 2 ms 504 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 376 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 376 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 376 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 376 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 1400 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 376 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 3 ms 1016 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 3 ms 1272 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 3 ms 1400 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 632 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 504 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 632 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 376 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 7 ms 2040 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 376 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 11 ms 2040 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 9 ms 1784 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 9 ms 2040 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 7 ms 2044 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 764 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 5 ms 1016 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 760 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 760 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 62 ms 9248 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 760 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 69 ms 5780 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 67 ms 6744 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 62 ms 7160 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 44 ms 6008 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 123 ms 6648 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 81 ms 8444 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 4216 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 27 ms 4216 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 665 ms 81356 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 23 ms 4216 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1281 ms 81456 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 761 ms 57976 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 686 ms 61816 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 678 ms 50820 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 660 ms 57956 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 864 ms 73692 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845