結果

問題 No.703 ゴミ拾い Easy
ユーザー raven7959raven7959
提出日時 2022-05-24 14:19:58
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 85 ms / 1,500 ms
コード長 5,636 bytes
コンパイル時間 2,409 ms
コンパイル使用メモリ 207,108 KB
実行使用メモリ 12,800 KB
最終ジャッジ日時 2024-09-20 14:22:56
合計ジャッジ時間 6,521 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 3 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 3 ms
5,376 KB
testcase_05 AC 3 ms
5,376 KB
testcase_06 AC 3 ms
5,376 KB
testcase_07 AC 3 ms
5,376 KB
testcase_08 AC 3 ms
5,376 KB
testcase_09 AC 3 ms
5,376 KB
testcase_10 AC 3 ms
5,376 KB
testcase_11 AC 3 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 4 ms
5,376 KB
testcase_15 AC 4 ms
5,376 KB
testcase_16 AC 3 ms
5,376 KB
testcase_17 AC 4 ms
5,376 KB
testcase_18 AC 4 ms
5,376 KB
testcase_19 AC 3 ms
5,376 KB
testcase_20 AC 4 ms
5,376 KB
testcase_21 AC 3 ms
5,376 KB
testcase_22 AC 3 ms
5,376 KB
testcase_23 AC 3 ms
5,376 KB
testcase_24 AC 83 ms
12,672 KB
testcase_25 AC 81 ms
12,672 KB
testcase_26 AC 80 ms
12,652 KB
testcase_27 AC 79 ms
12,608 KB
testcase_28 AC 81 ms
12,672 KB
testcase_29 AC 80 ms
12,800 KB
testcase_30 AC 81 ms
12,624 KB
testcase_31 AC 81 ms
12,544 KB
testcase_32 AC 83 ms
12,576 KB
testcase_33 AC 81 ms
12,672 KB
testcase_34 AC 71 ms
12,800 KB
testcase_35 AC 78 ms
12,672 KB
testcase_36 AC 74 ms
12,572 KB
testcase_37 AC 78 ms
12,672 KB
testcase_38 AC 78 ms
12,672 KB
testcase_39 AC 73 ms
12,604 KB
testcase_40 AC 72 ms
12,672 KB
testcase_41 AC 73 ms
12,672 KB
testcase_42 AC 70 ms
12,576 KB
testcase_43 AC 76 ms
12,544 KB
testcase_44 AC 2 ms
5,376 KB
testcase_45 AC 2 ms
5,376 KB
testcase_46 AC 85 ms
12,672 KB
testcase_47 AC 80 ms
12,672 KB
testcase_48 AC 2 ms
5,376 KB
testcase_49 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define yn(joken) cout<<((joken) ? "Yes" : "No")<<"\n"
#define YN(joken) cout<<((joken) ? "YES" : "NO")<<"\n"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vd = vector<double>;
using vld = vector<long double>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvc = vector<vector<char>>;
using vvd = vector<vector<double>>;
using vvld = vector<vector<long double>>;
using vvvi = vector<vector<vector<int>>>;
using vvvl = vector<vector<vector<ll>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using vvvvl = vector<vector<vector<vector<ll>>>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
const int INF = 1e9;
const ll LINF = 2e18;
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
bool ispow2(int i) { return i && (i & -i) == i; }
bool ispow2(ll i) { return i && (i & -i) == i; }
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        is >> v[i];
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        os << v[i];
        if (i < int(v.size()) - 1) os << ' ';
    }
    return os;
}

static uint32_t RandXor(){
    static uint32_t x=123456789;
    static uint32_t y=362436069;
    static uint32_t z=521288629;
    static uint32_t w=88675123;
    uint32_t t;
 
    t=x^(x<<11);
    x=y; y=z; z=w;
    return w=(w^(w>>19))^(t^(t>>8));
}

// DynamicLiChaoTree<ll> LCT(ll min_index,ll max_index); などする
// xの動きうる最大範囲が[min_index,max_index)
// void add_line(T a,T b): 直線 ax+b を追加
// void add_segment_line(T Llim,T Rlim,T a,T b): [Llim,Rlim]の線分 ax+b を追加
// T get(T x): min(ax+b) を返す

template <typename T>
struct DynamicLiChaoTree{
private:
    struct Line{
        T slope, intercept;
        Line() : slope(0), intercept(numeric_limits<T>::max() / 2) {}
        Line(T a, T b):slope(a),intercept(b) {}
        T f(T x) {return slope * x + intercept;}
    };

    struct node {
        Line line;
        node *left, *right;

        node(Line line):
            line(line),
            left(nullptr),
            right(nullptr) {}
    };

    const long long min_index,max_index;
    node* root;

    node* add_line(node* &t, long long l, long long r, Line line) const {
        if(l == r) return nullptr;
        if (!t) {
            t = new node(line);
            return t;
        }
        long long m = (l + r) >> 1;
        bool L = (line.f(l) <= t->line.f(l));
        bool M = (line.f(m) <= t->line.f(m));
        bool R = (line.f(r) <= t->line.f(r));
        if(L && R){
            t->line = line;
            return t;
        }
        if(!L && !R){
            return t;
        }
        if(M){
            swap(t->line, line);
        }
        if(L != M){
            t->left=add_line(t->left, l, m, line);
        }
        else{
            t->right=add_line(t->right, m, r, line);
        }
        return t;
    }

    node* add_segment_line(node* t, long long Llim, long long Rlim, long long l, long long r, Line line){
        if(r < Llim || Rlim < l) return t;
        if(Llim <= l && r <= Rlim) return add_line(t, l, r, line);
        if(t == nullptr) t = new node();
        long long m = (l + r) >> 1;
        t->left = add_segment_line(t, Llim, Rlim, l, m, line);
        t->right = add_segment_line(t, Llim, Rlim, m, r, line);
        return t;
    }

public:
    DynamicLiChaoTree(T min_index,T max_index):
        min_index(min_index),
        max_index(max_index),
        root(nullptr){}

    void add_line(T a, T b){
        Line line = Line{a, b};
        add_line(root, min_index, max_index, line);
    }

    void add_segment_line(T Llim, T Rlim, T a, T b){
        Line line = Line{a,b};
        add_segment_line(root, Llim, Rlim, min_index, max_index, line);
    }

    T get(long long x){
        node *t = root;
        long long l = min_index, r = max_index;
        T ret = numeric_limits<T>::max() / 2;
        while(r - l > 0 && t != nullptr){
            long long m = (l + r) >> 1;
            ret = min(ret, t->line.f(x));
            if(x < m){
                r = m;
                t = t->left;
            }
            else{
                l = m;
                t = t->right;
            }
        }
        return ret;
    }
};

void solve(){
    ll N;
    cin>>N;
    vl A(N),X(N),Y(N);
    cin>>A>>X>>Y;
    vl DP(N+1);
    DynamicLiChaoTree<ll> LCT(0,1e6);
    DP[0]=0;
    for(ll i=1;i<=N;i++){
        LCT.add_line(-2*X[i-1],X[i-1]*X[i-1]+Y[i-1]*Y[i-1]+DP[i-1]);
        DP[i]=LCT.get(A[i-1])+A[i-1]*A[i-1];
    }
    cout<<DP[N]<<endl;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();
}
0