oj.uz

답안 #114175

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
114175 2019-05-31T08:09:51 Z patrikpavic2 수열 (APIO14_sequence) C++17
71 / 100
 2000 ms 85752 KB 
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <algorithm>
#include <deque>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;
typedef pair < ll, ll > pll;

const int N = 1e5 + 500;
const int K = 205;

inline ll ccw(const pll &A, const pll &B, const pll &C){
    return A.X * (B.Y - C.Y) + B.X * (C.Y - A.Y) + C.X * (A.Y - B.Y);
}

int ind[N];
pll hl[N];
int cur = 0, n, k;
ll P[N], lst[N], dp[N], a[N];
int rek[N][K], cur_k, sz;

inline void add(const pll &X,const int &i){
    for(;sz >= 2 && ccw(X, hl[sz - 1], hl[sz - 2]) <= 0LL; sz--);
    hl[sz] = X; ind[sz++] = i;
    cur = min(cur, sz - 1);
}

inline ll get(const int &i,const ll &x){
    return hl[i].X * x + hl[i].Y;
}

inline int query(const ll &x){
    if(sz == 0) return -1;
    for(; cur + 1 < sz && get(cur, x) < get(cur +  1, x); cur++);
    return cur;
}

inline void dinamika(){
    sz = 0; cur = 0;
    for(int i = 0;i < n;i++){
        int r = query(P[i]);
        dp[i] = -1;
        if(r >= 0){
            rek[i][cur_k] = ind[r];
            dp[i] = get(r, P[i]);
        }
        if(lst[i] >= 0)
            add({P[i], lst[i] - P[i] * P[i]}, i);
        lst[i] = dp[i];
    }
    cur_k++;
}

int main(){
    scanf("%d%d", &n, &k);
    for(int i = 0;i < n;i++){
        scanf("%d", a + i);
        P[i] = a[i] + (i ? P[i - 1] : 0);
    }
    for(int i = 0;i < k;i++)
        dinamika();
    printf("%lld\n", dp[n - 1]);
    vector < int > fin;
    int cur = n - 1;
    for(int i = k - 1;i >= 0;i--){
        fin.PB(rek[cur][i]);
        cur = fin.back();
    }
    reverse(fin.begin(), fin.end());
    for(int x : fin)
        printf("%d ", x + 1);
    printf("\n");
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:70:26: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
         scanf("%d", a + i);
                     ~~~~~^
sequence.cpp:68: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:70:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", a + i);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8832 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 9 ms 8832 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 77 ms 8952 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 10 ms 8960 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 49 ms 8832 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 57 ms 8908 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 62 ms 8912 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 53 ms 8952 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 57 ms 8832 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 77 ms 8952 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 85240 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 94 ms 85200 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Execution timed out 2037 ms 85752 KB Time limit exceeded
4 Halted 0 ms 0 KB -