제출 #659428

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
659428		jhnah917	수열 (APIO14_sequence)	C++14	49 / 100	185 ms	8164 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

struct Line{
    ll a, b; int i;
    Line() = default;
    Line(ll a, ll b, int i) : a(a), b(b), i(i) {}
    ll f(ll x){ return a * x + b; }
};

struct CHT{
    vector<Line> v; int p;
    CHT() : v(), p(0) {}
    bool check(Line a, Line b, Line c){
        return (a.b - c.b) * (b.a - a.a) <= (a.b - b.b) * (c.a - a.a);
    }
    void add(Line l){
        while(p + 1 < v.size() && (v.back().b <= l.b || check(v[v.size()-2], v.back(), l))) v.pop_back();
        v.push_back(l);
    }
    pair<ll, int> get(ll x){
        while(p + 1 < v.size() && v[p].f(x) < v[p+1].f(x)) p++;
        return {v[p].f(x), v[p].i};
    }
};

int N, K, C[101010], P[101010];
ll A[101010];
ll D[101010];

pair<ll, int> Check(ll c){
    CHT S;
    S.add({0, 0, 0});
    for(int i=1; i<=N; i++){
        tie(D[i],P[i]) = S.get(A[i]);
        D[i] += c; C[i] = C[P[i]] + 1;
        S.add({A[i]*2, D[i] - 2*A[i]*A[i], i});
        // S.add({A[i], D[i] - A[i]*A[i], i});
    }
    return {D[N], C[N]};
}

vector<int> Track(ll c){
    Check(c); vector<int> ret;
    for(int i=N; i; i=P[i]) ret.push_back(i);
    ret.push_back(0); reverse(ret.begin(), ret.end());
    return ret;
}

// given partition p, q (p.size() >= q.size()), return k partition
// 1-based, p[0] = q[0] = 0, range : ( v[i-1], v[i] ]
vector<int> AliensTrack(int k, vector<int> p, vector<int> q){
    if(p.size() == k + 1) return p; if(q.size() == k + 1) return q;
    vector<int> ret;
    for(int i=1, j=1; i<p.size(); i++){
        while(j < q.size() && p[i-1] > q[j]) j++;
        if(p[i] <= q[j] && i - j == k - (int)q.size() + 1){
            ret.insert(ret.end(), p.begin(), p.begin()+i);
            ret.insert(ret.end(), q.begin()+j, q.end());
            return ret;
        }
    }
    assert(false);
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N >> K; K++;
    for(int i=1; i<=N; i++) cin >> A[i], A[i] += A[i-1];

    ll l = -1e17, r = 1e17;
    while(l < r){
        ll m = (l + r + 1) / 2;
        auto [dp,cnt] = Check(m*2+1);
        if(cnt <= K) l = m; else r = m - 1;
    }
    auto P1 = Track(l*2+1), P2 = Track(l*2+3);
    auto V = AliensTrack(K, P2, P1); assert(V.size() == K + 1);
    ll R = 0;
    for(int i=1; i+1<V.size(); i++) R += (A[V[i]] - A[V[i-1]]) * (A[N] - A[V[i]]);
    cout << R << "\n";
    for(int i=1; i+1<V.size(); i++) cout << V[i] << " ";
}

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp: In member function 'void CHT::add(Line)':
sequence.cpp:19:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |         while(p + 1 < v.size() && (v.back().b <= l.b || check(v[v.size()-2], v.back(), l))) v.pop_back();
      |               ~~~~~~^~~~~~~~~~
sequence.cpp: In member function 'std::pair<long long int, int> CHT::get(ll)':
sequence.cpp:23:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         while(p + 1 < v.size() && v[p].f(x) < v[p+1].f(x)) p++;
      |               ~~~~~~^~~~~~~~~~
sequence.cpp: In function 'std::vector<int> AliensTrack(int, std::vector<int>, std::vector<int>)':
sequence.cpp:54:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |     if(p.size() == k + 1) return p; if(q.size() == k + 1) return q;
      |        ~~~~~~~~~^~~~~~~~
sequence.cpp:54:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   54 |     if(p.size() == k + 1) return p; if(q.size() == k + 1) return q;
      |     ^~
sequence.cpp:54:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   54 |     if(p.size() == k + 1) return p; if(q.size() == k + 1) return q;
      |                                     ^~
sequence.cpp:54:49: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |     if(p.size() == k + 1) return p; if(q.size() == k + 1) return q;
      |                                        ~~~~~~~~~^~~~~~~~
sequence.cpp:56:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for(int i=1, j=1; i<p.size(); i++){
      |                       ~^~~~~~~~~
sequence.cpp:57:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         while(j < q.size() && p[i-1] > q[j]) j++;
      |               ~~^~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:75:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   75 |         auto [dp,cnt] = Check(m*2+1);
      |              ^
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from sequence.cpp:1:
sequence.cpp:79:54: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   79 |     auto V = AliensTrack(K, P2, P1); assert(V.size() == K + 1);
      |                                             ~~~~~~~~~^~~~~~~~
sequence.cpp:81:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for(int i=1; i+1<V.size(); i++) R += (A[V[i]] - A[V[i-1]]) * (A[N] - A[V[i]]);
      |                  ~~~^~~~~~~~~
sequence.cpp:83:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for(int i=1; i+1<V.size(); i++) cout << V[i] << " ";
      |                  ~~~^~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 17 / 17
• Subtask 5: 21 / 21
• Subtask 6: 0 / 29