oj.uz

답안 #233875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233875 2020-05-22T06:16:17 Z anonymous 수열 (APIO14_sequence) C++14
100 / 100
 844 ms 89060 KB 
#include <iostream>
#include <vector>
#define MAXN 100005
#define MAXK 205
#define LL __int128
using namespace std;
int N, K, Prev[MAXN][MAXK];
long long A[MAXN], P[MAXN], dp[MAXN][2];
vector <int> Out;
struct line {LL m, c, data;};
class CHT {
    int pt;
    vector<line> S;
public:
    void nuke() {
        pt = 0;
        S.clear();
    }
    bool bad(line L0) {
        line L1 = S.back(), L2 = S[S.size() - 2];
        if (L0.m == L1.m) {return(L0.c <= L1.m);}
        return((L2.c - L1.c)*(L0.m - L2.m) >= (L2.c - L0.c)*(L1.m - L2.m)); //int128?
    }
    void put(LL m, LL c, LL id) {
        while (S.size() > 1 && bad(line {m,c,id})) {S.pop_back();}
        S.push_back(line {m,c,id});
        pt = min(pt, (int) S.size()-1);
    }
    LL eval(line L, LL x) {
        return(L.m * x + L.c);
    }
    line ask(LL x) {
        while (pt + 1 < S.size() && eval(S[pt+1], x) > eval(S[pt], x)) {pt++;}
        return(S[pt]);
    }

} CHT;

int main() {
    //freopen("sequencein.txt","r",stdin);
    scanf("%d %d",&N,&K);
    for (int i=1; i<=N; i++) {
        scanf("%lld",&A[i]);
        P[i] = P[i-1] + A[i];
    }
    for (int j=1; j<=K; j++) {
        CHT.nuke();
        dp[0][j&1] = -(1LL << 60);
        CHT.put(0, dp[0][j&1],0);
        for (int i=1; i<=N; i++) {
            line res = CHT.ask(P[i]);
            dp[i][j&1] = res.m*P[i] + res.c;
            Prev[i][j] = res.data;
            CHT.put(P[i], dp[i][(j-1)&1] - P[i]*P[i], i);
        }
    }
    printf("%lld\n",(long long) dp[N][K&1]);
    for (int i=N, j=K; i>0 && j > 0; i=Prev[i][j], j--) {
        Out.push_back(Prev[i][j]);
    }
    while (Out.size()) {
        printf("%d ", Out.back());
        Out.pop_back();
    }
}

Compilation message

sequence.cpp: In member function 'line CHT::ask(__int128)':
sequence.cpp:33:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (pt + 1 < S.size() && eval(S[pt+1], x) > eval(S[pt], x)) {pt++;}
                ~~~~~~~^~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:41: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:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",&A[i]);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 9212 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 10 ms 9212 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 71 ms 9336 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 11 ms 9336 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 58 ms 9212 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 59 ms 9212 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 64 ms 9336 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 50 ms 9336 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 54 ms 9208 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 68 ms 9208 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 87652 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 66 ms 87776 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 731 ms 89060 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 66 ms 89052 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 844 ms 87772 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 578 ms 87780 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 662 ms 88928 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 504 ms 88932 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 555 ms 88420 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 684 ms 88420 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845