結果

問題 No.2332 Make a Sequence
ユーザー heno239heno239
提出日時 2023-05-28 14:33:08
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 345 ms / 2,000 ms
コード長 9,557 bytes
コンパイル時間 2,307 ms
コンパイル使用メモリ 158,292 KB
実行使用メモリ 97,636 KB
最終ジャッジ日時 2023-08-27 10:05:51
合計ジャッジ時間 23,202 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
11,808 KB
testcase_01 AC 8 ms
11,556 KB
testcase_02 AC 7 ms
11,728 KB
testcase_03 AC 8 ms
11,596 KB
testcase_04 AC 8 ms
11,524 KB
testcase_05 AC 7 ms
11,568 KB
testcase_06 AC 7 ms
11,596 KB
testcase_07 AC 246 ms
77,972 KB
testcase_08 AC 33 ms
14,400 KB
testcase_09 AC 173 ms
51,380 KB
testcase_10 AC 236 ms
77,216 KB
testcase_11 AC 150 ms
48,536 KB
testcase_12 AC 284 ms
83,540 KB
testcase_13 AC 298 ms
85,576 KB
testcase_14 AC 277 ms
82,008 KB
testcase_15 AC 275 ms
81,748 KB
testcase_16 AC 293 ms
84,580 KB
testcase_17 AC 282 ms
82,800 KB
testcase_18 AC 277 ms
82,104 KB
testcase_19 AC 291 ms
84,408 KB
testcase_20 AC 300 ms
84,368 KB
testcase_21 AC 284 ms
82,728 KB
testcase_22 AC 295 ms
84,616 KB
testcase_23 AC 288 ms
83,892 KB
testcase_24 AC 290 ms
84,308 KB
testcase_25 AC 289 ms
83,896 KB
testcase_26 AC 289 ms
83,804 KB
testcase_27 AC 290 ms
83,680 KB
testcase_28 AC 287 ms
83,528 KB
testcase_29 AC 290 ms
83,568 KB
testcase_30 AC 288 ms
83,632 KB
testcase_31 AC 287 ms
83,524 KB
testcase_32 AC 290 ms
83,540 KB
testcase_33 AC 291 ms
83,616 KB
testcase_34 AC 289 ms
83,796 KB
testcase_35 AC 290 ms
83,588 KB
testcase_36 AC 293 ms
83,544 KB
testcase_37 AC 291 ms
84,332 KB
testcase_38 AC 290 ms
84,048 KB
testcase_39 AC 291 ms
84,316 KB
testcase_40 AC 289 ms
84,144 KB
testcase_41 AC 290 ms
83,840 KB
testcase_42 AC 298 ms
87,720 KB
testcase_43 AC 297 ms
87,560 KB
testcase_44 AC 294 ms
86,688 KB
testcase_45 AC 293 ms
85,896 KB
testcase_46 AC 295 ms
86,532 KB
testcase_47 AC 305 ms
77,952 KB
testcase_48 AC 306 ms
78,240 KB
testcase_49 AC 306 ms
78,000 KB
testcase_50 AC 304 ms
78,348 KB
testcase_51 AC 310 ms
77,980 KB
testcase_52 AC 291 ms
83,492 KB
testcase_53 AC 289 ms
83,948 KB
testcase_54 AC 288 ms
83,536 KB
testcase_55 AC 287 ms
83,616 KB
testcase_56 AC 290 ms
83,800 KB
testcase_57 AC 342 ms
96,504 KB
testcase_58 AC 344 ms
97,636 KB
testcase_59 AC 344 ms
97,224 KB
testcase_60 AC 342 ms
97,328 KB
testcase_61 AC 345 ms
97,512 KB
testcase_62 AC 324 ms
83,880 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = long double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
    vector<T> res;
    int ida = 0, idb = 0;
    while (ida < a.size() || idb < b.size()) {
        if (idb == b.size()) {
            res.push_back(a[ida]); ida++;
        }
        else if (ida == a.size()) {
            res.push_back(b[idb]); idb++;
        }
        else {
            if (a[ida] < b[idb]) {
                res.push_back(a[ida]); ida++;
            }
            else {
                res.push_back(b[idb]); idb++;
            }
        }
    }
    return res;
}
template<typename T>
void cinarray(vector<T>& v) {
    rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
    rep(i, v.size()) {
        if (i > 0)cout << " "; cout << v[i];
    }
    cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
    if (n < 0) {
        ll res = mod_pow(x, -n, m);
        return mod_pow(res, m - 2, m);
    }
    if (abs(x) >= m)x %= m;
    if (x < 0)x += m;
    //if (x == 0)return 0;
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
//mod should be <2^31
struct modint {
    int n;
    modint() :n(0) { ; }
    modint(ll m) {
        if (m < 0 || mod <= m) {
            m %= mod; if (m < 0)m += mod;
        }
        n = m;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    a = abs(a); b = abs(b);
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
    if (loc >= v.size())v.resize(loc + 1, 0);
    v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
    fill(isp + 2, isp + mn, true);
    for (int i = 2; i < mn; i++) {
        if (!isp[i])continue;
        ps.push_back(i);
        for (int j = 2 * i; j < mn; j += i) {
            isp[j] = false;
        }
    }
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    if (res == st.begin())return st.end();
    res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
    return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
    a = a + b; return a;
}
mP operator-(mP a, mP b) {
    return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
    a = a - b; return a;
}
LP operator+(LP a, LP b) {
    return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
    a = a + b; return a;
}
LP operator-(LP a, LP b) {
    return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
    a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------

void Z_algorithm(const vector<int>& s, vector<int>& a) {
    int sz = s.size();
    a.resize(sz);
    a[0] = sz;
    int i = 1, j = 0;
    while (i < sz) {
        while (i + j < sz && s[j] == s[i + j])++j;
        a[i] = j;
        if (j == 0) { ++i; continue; }
        int k = 1;
        while (i + k < sz && k + a[k] < j)a[i + k] = a[k], ++k;
        i += k; j -= k;
    }
}
struct LiChaoTree {
    struct Node {
        ll l, r;
        Node* chl; Node* chr;
        LP val;
        Node(ll l, ll r) :l(l), r(r) {
            val = { 0,4 * INF };
            chl = chr = NULL;
        }
    };
    Node* root;
    void init(ll le, ll ri) {
        root = new Node(le, ri);
    }
    ll calc(LP a, ll x) {
        return a.first * x + a.second;
    }
    void add(Node* node, LP a) {
        if (!node)return;
        ll l = node->l, r = node->r;
        ll m = (l + r) / 2;
        //そのノードでの最小値
        if (calc(node->val, m) > calc(a, m))swap(node->val, a);
        if (r - l == 1)return;
        //左側をさらに更新しなきゃ
        if (calc(node->val, l) > calc(a, l)) {
            if (!node->chl)node->chl = new Node(l, m);
            add(node->chl, a);
        }
        else if (calc(node->val, r) > calc(a, r)) {
            if (!node->chr)node->chr = new Node(m, r);
            add(node->chr, a);
        }
    }
    void add(LP a) {
        add(root, a);
    }
    ll query(ll x) {
        ll ret = INF;
        Node* node = root;
        while (node) {
            ret = min(ret, calc(node->val, x));
            ll m = (node->l + node->r) / 2;
            if (x < m) {
                node = node->chl;
            }
            else {
                node = node->chr;
            }
        }
        return ret;
    }
};

void solve() {
    int n, m; cin >> n >> m;
    vector<int> a(n); rep(i, n)cin >> a[i];
    vector<int> b(m); rep(i, m)cin >> b[i];
    vector<int> c(m); rep(i, m)cin >> c[i];
    int sz = 1;
    while (sz < m+1)sz *= 2;
    vector<LiChaoTree> node(2 * sz - 1);
    rep(i, 2 * sz - 1)node[i].init(0, m + 1);
    //[0,ri)
    auto resol = [&](int ri) {
        vector<int> res;
        if (ri == sz) {
            res.push_back(0); return res;
        }
        int k = 0, l = 0, r = sz;
        while (k < sz - 1) {
            int m = (l + r) / 2;
            if (m <= ri) {
                res.push_back(2 * k + 1);
                k = 2 * k + 2;
                l = m;
            }
            else {
                k = 2 * k + 1; r = m;
            }
        }
        return res;
    };
    vector<int> ab = a;
    rep(i, m)ab.push_back(b[i]);
    vector<int> za;
    Z_algorithm(ab, za);
    vector<ll> dp(m + 1, INF);
    dp[0] = 0;
    rep(i, m + 1) {
        if (i > 0) {
            int k = i + sz - 1;
            while (k > 0) {
                ll v = node[k].query(i);
                chmin(dp[i], v);
                k = (k - 1) / 2;
            }
            ll v = node[k].query(i);
            chmin(dp[i], v);
        }
        if (i < m) {
            LP p;
            p.first = c[i];
            p.second = dp[i] - (ll)i * c[i];
            int len = za[n + i];
            chmin(len, n);
            int ri = i + len + 1;
            //cout << "? " << i << " "<<dp[i]<<" " << ri << "\n";
            auto ks = resol(ri);
            //coutarray(ks);
            for (int k : ks) {
                node[k].add(p);
            }
        }
    }
    if (dp[m] >= INF/2)dp[m] = -1;
    cout << dp[m] << "\n";
}





signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(15);
    //init_f();
    //init();
    //while(true)
    //expr();
    //int t; cin >> t; rep(i, t)
        solve();
    return 0;
}
0