結果
問題 | No.2332 Make a Sequence |
ユーザー |
![]() |
提出日時 | 2023-05-28 14:54:44 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 356 ms / 2,000 ms |
コード長 | 3,337 bytes |
コンパイル時間 | 4,351 ms |
コンパイル使用メモリ | 238,608 KB |
実行使用メモリ | 23,016 KB |
最終ジャッジ日時 | 2024-12-27 03:31:52 |
合計ジャッジ時間 | 25,456 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 61 |
ソースコード
#include <stdio.h>#include <atcoder/all>#include <bits/stdc++.h>using namespace std;using namespace atcoder;using mint = modint998244353;#define rep(i,n) for (int i = 0; i < (n); ++i)#define Inf32 1000000001#define Inf64 4000000000000000001template <typename T>struct Z_algorithm{vector<int> A;Z_algorithm(T &s){A.resize(s.size(),0);A[0] = s.size();int i=1,j=0;while(i<s.size()){while (i+j<s.size()&&s[j]==s[i+j])j++;A[i] = j;if(j==0){i++;continue;}int k = 1;while(i+k<s.size()&&k+A[k]<j){A[i+k] = A[k];k++;}i+=k;j-=k;}}//[0,S.size)と[pos,S.size)の最長共通接頭辞の長さint get_length(int pos){return A[pos];}};/*iv...Infs...if maxCHT, set -1*/template <typename T>struct CHT{vector<T> v;vector<T> a,b;int n;long long sign;T init_value;CHT(vector<T> &x,T iv,long long s=1){init_value = iv;sign = s;v = x;sort(v.begin(),v.end());int temp = distance(v.begin(),unique(v.begin(),v.end()));v.resize(temp);n=1;while(true){if(n>=v.size())break;n<<=1;}T t = v.back();v.resize(n,t+1);a.resize(2*n,0);b.resize(2*n,init_value);}void add(T A,T B,int start){int now = start;while(true){int ll = (now<<(__builtin_clz(now)-__builtin_clz(n)))-n;int rr = ll + (n>>(31-__builtin_clz(now))) -1;int m = (ll+rr)>>1;bool fl = (A*v[ll]+B)<(a[now]*v[ll]+b[now]);bool fm = (A*v[m]+B)<(a[now]*v[m]+b[now]);bool fr = (A*v[rr]+B)<(a[now]*v[rr]+b[now]);if(fl&&fr){a[now]=A;b[now]=B;break;}if(!fl&&!fr){break;}if(fm){swap(A,a[now]);swap(B,b[now]);swap(fl,fr);}if(fl){now<<=1;}else{now<<=1;now++;}}}void add_line(T A,T B){A *= sign;B *= sign;add(A,B,1);}void add_segment(T A,T B,T L,T R){L = distance(v.begin(),lower_bound(v.begin(),v.end(),L));R = distance(v.begin(),lower_bound(v.begin(),v.end(),R));if(R==L)return;L+=n;R+=n;while(true){if(L&1){add(A,B,L++);}if(R&1){add(A,B,--R);}if(L>=R)break;L>>=1;R>>=1;}}T query(T x){int now = n + distance(v.begin(),lower_bound(v.begin(),v.end(),x));T ret = init_value;while(true){ret = min(ret,(a[now]*x+b[now]));now>>=1;if(now<=0)break;}return ret*sign;}void show(){int n = 1;for(int i=1;i<a.size();i++){for(int j=0;j<n;j++){if(j!=0)cout<<' ';cout<<a[i+j];}cout<<endl;i+=n-1;n*=2;}}};int main(){int N,M;cin>>N>>M;vector<int> a(N);rep(i,N)cin>>a[i];a.push_back(-1);rep(i,M){int t;cin>>t;a.push_back(t);}Z_algorithm<vector<int>> Z(a);vector<long long> c(M);rep(i,M)cin>>c[i];vector<long long> dp(M+1,Inf64);vector<long long> t(M+5);rep(i,M+5)t[i] = i;CHT<long long> C(t,Inf64);rep(i,M+1){if(i==0)dp[i] = 0;else{//cout<<C.query(i)<<endl;dp[i] = min(dp[i],C.query(i));}if(dp[i]!=Inf64&&i!=M){long long b = dp[i];b -= c[i] * i;//cout<<c[i]<<','<<b<<','<<i<<','<<Z.get_length(N+1+i)<<endl;C.add_segment(c[i],b,i,i+Z.get_length(N+1+i)+1);//C.add_line(c[i],b);}}long long ans = dp.back();if(ans>=Inf64)ans = -1;cout<<ans<<endl;return 0;}