#876185 (C++14) No.2332 Make a Sequence

提出ソース

結果

問題	No.2332 Make a Sequence
ユーザー	woodywoody
提出日時	2023-05-31 02:13:37
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,772 bytes
コンパイル時間	3,882 ms
コンパイル使用メモリ	234,860 KB
実行使用メモリ	21,788 KB
最終ジャッジ日時	2024-06-08 20:55:27
合計ジャッジ時間	13,062 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	3 ms 5,376 KB
testcase_02	AC	3 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	1 ms 5,376 KB
testcase_05	AC	1 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	81 ms 15,020 KB
testcase_08	AC	24 ms 7,024 KB
testcase_09	AC	67 ms 13,624 KB
testcase_10	AC	63 ms 10,696 KB
testcase_11	AC	49 ms 9,172 KB
testcase_12	AC	90 ms 16,828 KB
testcase_13	AC	94 ms 19,516 KB
testcase_14	AC	94 ms 16,444 KB
testcase_15	AC	95 ms 16,568 KB
testcase_16	AC	94 ms 19,516 KB
testcase_17	AC	95 ms 17,084 KB
testcase_18	AC	97 ms 15,164 KB
testcase_19	AC	99 ms 19,516 KB
testcase_20	AC	99 ms 17,208 KB
testcase_21	AC	96 ms 16,696 KB
testcase_22	AC	96 ms 14,272 KB
testcase_23	AC	98 ms 14,272 KB
testcase_24	AC	97 ms 14,136 KB
testcase_25	AC	94 ms 14,392 KB
testcase_26	AC	93 ms 14,268 KB
testcase_27	AC	92 ms 13,504 KB
testcase_28	AC	95 ms 13,500 KB
testcase_29	AC	95 ms 13,404 KB
testcase_30	AC	92 ms 13,372 KB
testcase_31	AC	91 ms 13,372 KB
testcase_32	AC	89 ms 13,376 KB
testcase_33	AC	91 ms 13,372 KB
testcase_34	AC	88 ms 13,372 KB
testcase_35	AC	89 ms 13,372 KB
testcase_36	AC	90 ms 13,376 KB
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	AC	91 ms 21,788 KB
testcase_48	AC	94 ms 21,660 KB
testcase_49	AC	94 ms 21,596 KB
testcase_50	AC	89 ms 21,784 KB
testcase_51	AC	92 ms 21,660 KB
testcase_52	AC	95 ms 13,496 KB
testcase_53	AC	93 ms 13,500 KB
testcase_54	AC	92 ms 13,628 KB
testcase_55	AC	93 ms 13,496 KB
testcase_56	AC	96 ms 13,632 KB
testcase_57	AC	78 ms 13,500 KB
testcase_58	AC	73 ms 13,376 KB
testcase_59	AC	74 ms 13,496 KB
testcase_60	AC	73 ms 13,376 KB
testcase_61	AC	75 ms 13,504 KB
testcase_62	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

struct state{
    ll c,ans,i,len;
 
    state(ll c,ll ans,ll i,ll len) : c(c),ans(ans),i(i),len(len) {}
 
    bool operator>(state const &ot) const{
        return c > ot.c;
    }
};

void solve(){
    int n,m; cin>>n>>m;
    vl a(n),b(m),c(m);
    rep(i,n) cin>>a[i];
    rep(i,m) cin>>b[i];
    rep(i,m) cin>>c[i];

    vl v;
    rep(i,n) v.pb(a[i]);
    rep(i,m) v.pb(b[i]);
    vi z = z_algorithm(v);
    
    vi mxlen(m);
    rep(i,m) mxlen[i] = z[i+n];
    
    showv(mxlen);
    mpq<state> q;
    ll ans = 0;
    rep(i,m){
        q.push(state(c[i],ans,i,mxlen[i]));
        while(sz(q)){
            state p = q.top();
            if (p.len+p.i<=i) q.pop();
            else break;
        }
        if (sz(q)==0){
            ans = -1;
            break;
        }
        state p = q.top();
        ans = p.ans + p.c*(i-p.i+1);
    }
    out;

    return;
}

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

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}

yukicoder

結果

テストケース

ソースコード