oj.uz

답안 #158359

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
158359 2019-10-16T16:44:37 Z arnold518 수열 (APIO14_sequence) C++14
0 / 100
 1287 ms 87368 KB 
#include <bits/stdc++.h>
using namespace std;

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

const int MAXN = 1e5;
const int MAXK = 200;

int N, K;
ll A[MAXN+10], dp[MAXN+10], dp2[MAXN+10];
int memo[MAXN+10][MAXK+10];

struct CHT
{
    void init()
    {
        S.clear();
        pos=0;
    }

    struct Line { ll a, b, c; };
    double cross(const Line &p, const Line &q) { return (double)(q.b-p.b)/(p.a-q.a); }
    vector<Line> S;

    void update(Line p)
    {
        while(S.size()>1 && ((S[S.size()-1].a==p.a && S[S.size()-1].b<=p.b) || (S[S.size()-1].a!=p.a && cross(S[S.size()-1], p)<=cross(S[S.size()-2], S[S.size()-1])))) S.pop_back();
        S.push_back(p);
    }

    int pos=0;
    pll query(ll x)
    {
        if(S.size()<=pos) pos=S.size()-1;
        else while(pos+1<S.size() && cross(S[pos], S[pos+1])<=x) pos++;
        return {S[pos].a*x+S[pos].b, S[pos].c};
    }
};
CHT cht;

int main()
{
    int i, j;

    scanf("%d%d", &N, &K);
    for(i=1; i<=N; i++) scanf("%lld", &A[i]), A[i]+=A[i-1];

    for(j=1; j<=K; j++)
    {
        cht.init();
        cht.update({A[j], dp2[j]-A[j]*A[j], j});
        for(i=j+1; i<=N; i++)
        {
            pll t=cht.query(A[i]);
            dp[i]=t.first;
            memo[i][j]=t.second;
            cht.update({A[i], dp2[i]-A[i]*A[i], i});
        }
        for(i=1; i<=N; i++) dp2[i]=dp[i];
        //for(i=1; i<=N; i++) printf("%lld ", dp[i]); printf("\n");
    }
    printf("%lld\n", dp[N]);
    int now=N;
    for(i=K; i>=1; i--)
    {
        now=memo[now][i];
        printf("%d ", now);
    }
}

Compilation message

sequence.cpp: In member function 'pll CHT::query(ll)':
sequence.cpp:36:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(S.size()<=pos) pos=S.size()-1;
            ~~~~~~~~^~~~~
sequence.cpp:37:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         else while(pos+1<S.size() && cross(S[pos], S[pos+1])<=x) pos++;
                    ~~~~~^~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:47: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:48:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1; i<=N; i++) scanf("%lld", &A[i]), A[i]+=A[i-1];
                         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 376 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 376 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 376 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 376 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Incorrect 2 ms 376 KB contestant didn't find the optimal answer: 0 < 1
7 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 376 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 376 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 376 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Incorrect 2 ms 376 KB contestant didn't find the optimal answer: 1005301269 < 1005304678
6 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 504 KB contestant didn't find the optimal answer: 407161746 < 610590000
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 1148 KB contestant didn't find the optimal answer: 20166072 < 21503404
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 9144 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 11 ms 9144 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 100 ms 9204 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 11 ms 9204 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Incorrect 64 ms 9144 KB contestant didn't find the optimal answer: 1077516459 < 1085432199
6 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 86884 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 96 ms 86852 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1287 ms 87268 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 106 ms 87368 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Incorrect 1178 ms 87008 KB contestant didn't find the optimal answer: 30320842943 < 36183271951
6 Halted 0 ms 0 KB -