oj.uz

답안 #552551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
552551 2022-04-23T09:44:51 Z tht2005 수열 (APIO14_sequence) C++17
100 / 100
 596 ms 83276 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

const int N = 100005;
const int K = 202;

LL div_(LL a, LL b) {
    return a / b - ((a ^ b) < 0 && a % b);
}

struct line_t {
    LL k, m;
    int i;
    line_t() {}
    line_t(LL k_, LL m_, int i_) : k(k_), m(m_), i(i_) {}
    LL operator() (LL x) const {
        return k * x + m;
    }
};
struct cht {
    int n, p;
    line_t L[N];
    void init() {
        n = p = 0;
    }
    bool bad(const line_t& a, const line_t& b, const line_t& c) {
        if(b.k == c.k) return b.m >= c.m;
        return div_(b.m - a.m, a.k - b.k) >= div_(c.m - b.m, b.k - c.k);
    }
    void insert(LL k, LL m, int i) {
        line_t nw(k, m, i);
        while(n > 1 && bad(L[n - 2], L[n - 1], nw)) --n;
        if(n == 0 || L[n - 1].k != nw.k) L[n++] = nw;
    }
    line_t query(LL x) {
        while(p + 1 < n && L[p](x) > L[p + 1](x)) ++p;
        return L[p];
    }
} S;

int n, kk, s[N], trc[K][N];
LL f[N], g[N];

int main() {
    scanf("%d %d", &n, &kk);
    for(int i = 1; i <= n; ++i) {
        int a;
        scanf("%d", &a);
        s[i] = s[i - 1] + a;
    }
    memset(f, 0, sizeof(f));
    for(int t = 1; t <= kk; ++t) {
        memcpy(g, f, sizeof(g));
        memset(f, 0, sizeof(f));
        S.init();
        for(int i = t + 1; i <= n; ++i) {
            S.insert(-s[i - 1], (LL)s[i - 1] * s[i - 1] - g[i - 1], i - 1);
            line_t tmp = S.query(s[i]);
            f[i] = -tmp(s[i]);
            trc[t][i] = tmp.i;
        }
    }
    printf("%lld\n", f[n]);
    for(int i = n; (i = trc[kk--][i]); ) {
        printf("%d ", i);
    }
    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     scanf("%d %d", &n, &kk);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
sequence.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         scanf("%d", &a);
      |         ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1876 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 1876 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 11 ms 2900 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 1876 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 13 ms 2612 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 13 ms 2772 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 15 ms 2888 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 4 ms 2104 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 3 ms 1972 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 4 ms 2132 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1848 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1876 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 15 ms 3504 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 1876 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 20 ms 3560 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 15 ms 3248 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 20 ms 3556 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 19 ms 3492 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 4 ms 2260 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 8 ms 2580 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2240 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 2240 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 75 ms 10792 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 2292 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 43 ms 7352 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 52 ms 8204 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 56 ms 8644 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 36 ms 7468 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 48 ms 8220 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 55 ms 9956 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 5328 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 21 ms 5460 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 549 ms 83276 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 20 ms 6236 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 596 ms 82496 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 437 ms 59068 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 463 ms 63700 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 355 ms 52716 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 369 ms 59464 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 461 ms 75056 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845