oj.uz

답안 #114196

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
114196 2019-05-31T09:05:41 Z patrikpavic2 수열 (APIO14_sequence) C++17
0 / 100
 122 ms 4216 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 long double ld;
typedef pair < ll, ll > pll;

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

inline bool ccw(const pll &A, const pll &B, const pll &C){
    return (ld)A.X * (B.Y - C.Y) + (ld)B.X * (C.Y - A.Y) + (ld)C.X * (A.Y - B.Y) <= 0;
}

int ind[N], a[N];
pll hl[N];
int cur = 0, n, k;
ll P[N], lst[N], dp[N];
int rek[N], cur_k, sz, cnt[N];
ll cost, lo = 0, hi = 1e9;

inline void add(const pll &X,const int &i){
    for(;sz >= 2 && ccw(X, hl[sz - 1], hl[sz - 2]); 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 int dinamika(){
    sz = 0; cur = 0;
    add({0, 0}, 0);
    for(int i = 1;i <= n;i++){
        int r = query(P[i]);
        rek[i] = ind[r];
        cnt[i] = cnt[ind[r]] + 1;
        dp[i] = get(r, P[i]) - cost;
        add({P[i], dp[i] - P[i] * P[i]}, i);
        //printf("%lld ", dp[i]);
    }
   // printf("\n");
    cur_k++;
    return cnt[n] <= k;
}

int main(){
    scanf("%d%d", &n, &k);
    //if(n > 50000 && k > 150) return 0;
    for(int i = 0;i < n;i++){
        scanf("%d", a + i);
        P[i + 1] = a[i] + P[i];
    }
    //lo = hi = 12;
    cost = (lo + hi) / 2;
    for(int i = 0;i < 60;i++){
        if(dinamika()){
            hi = cost;
        }
        else{
            lo = cost;
        }
        cost = (lo + hi) / 2;
        //if(lo  == hi) break;
    }
    printf("%lld\n", dp[n] + cnt[n] * cost);
    vector < int > fin;
    int cur = n;
    for(int i = 0;i < k;i++){
        cur = rek[cur];
        fin.PB(cur);
    }
    reverse(fin.begin(), fin.end());
    for(int x : fin)
        printf("%d ", x);
    printf("\n");
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:70: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:73:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", a + i);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
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 Incorrect 2 ms 384 KB Integer 0 violates the range [1, 1]
4 Halted 0 ms 0 KB -

Subtask #2
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 Incorrect 2 ms 384 KB declared answer doesn't correspond to the split scheme: declared = 112456354208, real = 59975852417
5 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 384 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 384 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Incorrect 2 ms 384 KB declared answer doesn't correspond to the split scheme: declared = 1949268818397, real = 284902358258
5 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 384 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 2 ms 384 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Incorrect 2 ms 384 KB declared answer doesn't correspond to the split scheme: declared = 49730858040494, real = 1484417457095
5 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 768 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 12 ms 768 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Incorrect 10 ms 896 KB declared answer doesn't correspond to the split scheme: declared = 4995495204090671, real = 949370977020086
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 122 ms 4216 KB declared answer doesn't correspond to the split scheme: declared = 21115495422, real = 19004001021
2 Halted 0 ms 0 KB -