oj.uz

답안 #444760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444760 2021-07-15T06:33:13 Z impri 수열 (APIO14_sequence) C++14
100 / 100
 1409 ms 89632 KB 
#include<bits/stdc++.h>
using namespace std;
int n,k;
int arr[100001];
long long psum[100001];
long long dp[100001][2];
int res[100001][201];
struct line{
long long a,b;
double s;
int p;
};
int main(void){
cin >> n >> k;
k++;
for(int i=1;i<=n;i++)
    cin >> arr[i];
for(int i=1;i<=n;i++)
    psum[i]=psum[i-1]+arr[i];
for(int i=1;i<n;i++)
    dp[i][1]=psum[i]*(psum[n]-psum[i]);
for(int i=2;i<=k;i++){
    vector<line>lines;
    lines.push_back({-psum[i-1],dp[i-1][(i+1)%2],10e15,i-1});

    int cur=0;
    for(int j=i;j<=n;j++){
        while(1){
            if(cur+1==lines.size())break;
            if(lines[cur+1].s<(psum[n]-psum[j]))break;
            cur++;
        }
        dp[j][i%2]=lines[cur].a*(psum[n]-psum[j])+lines[cur].b+psum[j]*psum[n]-psum[j]*psum[j];
        res[j][i]=lines[cur].p;
        if(arr[j]==0)continue;
        line nxt;
        nxt.a=-psum[j];
        nxt.b=dp[j][(i+1)%2];
        nxt.p=j;
        while(!lines.empty()){
            double point=1.0*(lines.back().b-nxt.b)/(nxt.a-lines.back().a);
            if(point>lines.back().s)
               {

                lines.pop_back();
                if(cur==lines.size())
                    cur--;
               }
            else{
                nxt.s=point;
                break;
            }
        }
        lines.push_back(nxt);
    }
}
cout << dp[n][k%2] <<'\n';
int cur=n;
vector<int>r;
for(int i=k;i>1;i--){
    r.push_back(res[cur][i]);
    cur=res[cur][i];
}
for(int i=k-2;i>=0;i--)
    cout << r[i] << ' ';
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:29:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |             if(cur+1==lines.size())break;
      |                ~~~~~^~~~~~~~~~~~~~
sequence.cpp:46:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |                 if(cur==lines.size())
      |                    ~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8916 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 9 ms 8908 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 105 ms 9336 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 9 ms 9296 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 50 ms 8984 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 51 ms 8912 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 81 ms 9368 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 67 ms 9308 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 70 ms 9296 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 87 ms 9296 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 88556 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 68 ms 88340 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1308 ms 89512 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 83 ms 89408 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1409 ms 88684 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 482 ms 85964 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1020 ms 89632 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 795 ms 89200 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 892 ms 89132 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1098 ms 89068 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845