## 답안 #517078

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
517078 2022-01-22T13:28:27 Z Gurban 수열 (APIO14_sequence) C++17
100 / 100
772 ms 81536 KB
```#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int N = 205;
const int maxn=1e5+5;
int n,k;
ll p[maxn];
ll dp[maxn],now[maxn];
int go[N][maxn];

struct line {
ll m, c;
int idx;
long long eval(long long x) { return m * x + c; }
long double intersectX(line l) {
if(l.m == m){
cout<<"HAHAHAHA\n";
exit(0);
}
return (long double) (c - l.c) / (l.m - m);
}
};

int main(){
ios::sync_with_stdio(false);
cin.tie(0);

cin >> n >> k;
for(int i = 1;i <= n;i++){
int x; cin >> x;
p[i] = x + p[i - 1];
}

for(int i = 1;i <= k;i++){
deque<line>dq;
dq.push_front({p[i],dp[i] - p[i] * p[i],i});
for(int j = i + 1;j <= n;j++){
while(dq.size() >= 2 and dq[0].eval(p[j]) <= dq[1].eval(p[j])) dq.pop_front();
now[j] = dq[0].eval(p[j]);
go[i][j] = dq[0].idx;
line cur = {p[j],dp[j] - p[j] * p[j],j};
while(dq.size() >= 2 and cur.intersectX(dq[(int)dq.size()-2]) <= dq.back().intersectX(dq[(int)dq.size()-2])) dq.pop_back();
dq.push_back(cur);
}
for(int j = i + 1;j <= n;j++) dp[j] = now[j];
}
cout<<dp[n]<<'\n';
int idx = go[k][n];
for(int i = k-1;i >= 0;i--){
cout<<idx<<' ';
// assert(idx >= 0 and idx <= n);
idx = go[i][idx];
}
}```

#### Subtask #1 11.0 / 11.0

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

#### Subtask #2 11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 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 460 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 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 1 ms 332 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 460 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 332 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 332 KB contestant found the optimal answer: 29000419931 == 29000419931

#### Subtask #3 11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 332 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 1356 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 332 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 972 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 1 ms 1228 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 1356 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 588 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 588 KB contestant found the optimal answer: 490686959791 == 490686959791

#### Subtask #4 17.0 / 17.0

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

#### Subtask #5 21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 716 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 792 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 64 ms 9332 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 716 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 49 ms 5928 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 51 ms 6724 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 65 ms 7092 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 50 ms 5976 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 51 ms 6828 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 67 ms 8420 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

#### Subtask #6 29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 4328 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 19 ms 4360 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 630 ms 81536 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 26 ms 4932 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 772 ms 81256 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 569 ms 57780 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 563 ms 61880 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 460 ms 50824 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 537 ms 57892 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 614 ms 73576 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845