oj.uz

답안 #335603

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335603 2020-12-13T09:09:04 Z Joshc 수열 (APIO14_sequence) C++11
100 / 100
 724 ms 84444 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

const int MAX_N = 100001;

vector<long long int> grad, inter;
vector<int> indexes;
long long int dp[MAX_N][2], psa[MAX_N];
int choice[MAX_N][201], cur=0;

bool bad(long long int m1, long long int c1, long long int m2, long long int c2, long long int m3, long long int c3) {
    return (c1-c3)*(m2-m1) <= (c1-c2)*(m3-m1);
}

void add(long long int m, long long int c, int index) {
    while (grad.size()>=2 && bad(grad[grad.size()-2], inter[inter.size()-2], grad[grad.size()-1], inter[inter.size()-1], m, c)) {
        grad.pop_back();
        inter.pop_back();
        indexes.pop_back();
    }
    grad.push_back(m);
    inter.push_back(c);
    indexes.push_back(index);
}

long long int query(long long int x) {
    while (cur<grad.size()-1 && grad[cur]*x+inter[cur] < grad[cur+1]*x+inter[cur+1]) cur++;
    return grad[cur]*x+inter[cur];
}

int main() {
    int n, k, input;
    scanf("%d %d ", &n, &k);
    psa[0] = 0;
    for (int i=1; i<=n; i++) {
        scanf(" %d ", &input);
        psa[i] = psa[i-1] + input;
    }
    for (int split=1; split<=k; split++) {
        for (int num=split+1; num<=n; num++) {
            add(psa[num-1], dp[num-1][(split-1)&1]-psa[num-1]*psa[num-1], num-1);
            dp[num][split&1] = query(psa[num]);
            choice[num][split] = indexes[cur];
        }
        grad.clear();
        inter.clear();
        indexes.clear();
        cur = 0;
    }
    printf("%lld\n", dp[n][k&1]);
    int trail = n;
    for (int i=k; i>=1; i--) {
        trail = choice[trail][i];
        printf("%d ", trail);
    }
    printf("\n");
}

Compilation message

sequence.cpp: In function 'long long int query(long long int)':
sequence.cpp:29:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     while (cur<grad.size()-1 && grad[cur]*x+inter[cur] < grad[cur+1]*x+inter[cur+1]) cur++;
      |            ~~~^~~~~~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   35 |     scanf("%d %d ", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
sequence.cpp:38:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |         scanf(" %d ", &input);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8684 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 7 ms 8684 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 45 ms 8940 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 8940 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 40 ms 8684 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 43 ms 8684 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 48 ms 8940 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 33 ms 8812 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 38 ms 8812 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 47 ms 8812 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 83548 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 63 ms 83548 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 619 ms 84444 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 65 ms 84316 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 724 ms 83548 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 484 ms 83676 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 543 ms 84316 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 422 ms 84188 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 465 ms 84060 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 579 ms 84008 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845