#964671 (C++17) No.2694 The Early Bird Catches The Worm

提出ソース

結果

問題	No.2694 The Early Bird Catches The Worm
ユーザー	mikam
提出日時	2024-03-23 12:43:43
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	74 ms / 2,000 ms
コード長	4,854 bytes
コンパイル時間	7,021 ms
コンパイル使用メモリ	428,632 KB
実行使用メモリ	14,284 KB
最終ジャッジ日時	2024-03-23 12:43:56
合計ジャッジ時間	13,005 ms
ジャッジサーバーID （参考情報）	judge11 / judge13

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,676 KB
testcase_01	AC	2 ms 6,676 KB
testcase_02	AC	1 ms 6,676 KB
testcase_03	AC	2 ms 6,676 KB
testcase_04	AC	2 ms 6,676 KB
testcase_05	AC	2 ms 6,676 KB
testcase_06	AC	2 ms 6,676 KB
testcase_07	AC	2 ms 6,676 KB
testcase_08	AC	3 ms 6,676 KB
testcase_09	AC	2 ms 6,676 KB
testcase_10	AC	2 ms 6,676 KB
testcase_11	AC	2 ms 6,676 KB
testcase_12	AC	2 ms 6,676 KB
testcase_13	AC	2 ms 6,676 KB
testcase_14	AC	2 ms 6,676 KB
testcase_15	AC	2 ms 6,676 KB
testcase_16	AC	2 ms 6,676 KB
testcase_17	AC	2 ms 6,676 KB
testcase_18	AC	3 ms 6,676 KB
testcase_19	AC	2 ms 6,676 KB
testcase_20	AC	2 ms 6,676 KB
testcase_21	AC	2 ms 6,676 KB
testcase_22	AC	2 ms 6,676 KB
testcase_23	AC	2 ms 6,676 KB
testcase_24	AC	20 ms 6,676 KB
testcase_25	AC	18 ms 6,676 KB
testcase_26	AC	23 ms 6,748 KB
testcase_27	AC	32 ms 8,060 KB
testcase_28	AC	36 ms 8,636 KB
testcase_29	AC	12 ms 6,676 KB
testcase_30	AC	55 ms 11,852 KB
testcase_31	AC	32 ms 8,084 KB
testcase_32	AC	58 ms 12,220 KB
testcase_33	AC	57 ms 11,948 KB
testcase_34	AC	4 ms 6,676 KB
testcase_35	AC	29 ms 7,692 KB
testcase_36	AC	37 ms 8,956 KB
testcase_37	AC	64 ms 13,100 KB
testcase_38	AC	43 ms 9,772 KB
testcase_39	AC	11 ms 6,676 KB
testcase_40	AC	32 ms 8,084 KB
testcase_41	AC	15 ms 6,676 KB
testcase_42	AC	3 ms 6,676 KB
testcase_43	AC	7 ms 6,676 KB
testcase_44	AC	65 ms 13,132 KB
testcase_45	AC	64 ms 13,132 KB
testcase_46	AC	20 ms 6,676 KB
testcase_47	AC	21 ms 6,676 KB
testcase_48	AC	35 ms 8,636 KB
testcase_49	AC	54 ms 14,284 KB
testcase_50	AC	53 ms 14,284 KB
testcase_51	AC	54 ms 14,284 KB
testcase_52	AC	53 ms 14,284 KB
testcase_53	AC	54 ms 14,284 KB
testcase_54	AC	72 ms 14,284 KB
testcase_55	AC	72 ms 14,284 KB
testcase_56	AC	72 ms 14,284 KB
testcase_57	AC	73 ms 14,284 KB
testcase_58	AC	72 ms 14,284 KB
testcase_59	AC	72 ms 14,284 KB
testcase_60	AC	72 ms 14,284 KB
testcase_61	AC	74 ms 14,284 KB
testcase_62	AC	72 ms 14,284 KB
testcase_63	AC	72 ms 14,284 KB
testcase_64	AC	71 ms 14,284 KB
testcase_65	AC	73 ms 14,284 KB
testcase_66	AC	73 ms 14,284 KB
testcase_67	AC	72 ms 14,284 KB
testcase_68	AC	72 ms 14,284 KB
testcase_69	AC	62 ms 14,284 KB
testcase_70	AC	62 ms 14,284 KB
testcase_71	AC	62 ms 14,284 KB
testcase_72	AC	61 ms 14,284 KB
testcase_73	AC	61 ms 14,284 KB
testcase_74	AC	31 ms 8,860 KB
testcase_75	AC	63 ms 14,284 KB

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

ソースコード

raw source code

#include <atcoder/all>
using namespace atcoder;
#include <atcoder/internal_math>
using namespace internal;
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
#define pb push_back
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
using ull = unsigned long long;
using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> int print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";return 0;}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> int print(T& a){cout << a<< '\n';return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
template<class T> bool ins(string s,T t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;}
int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;}
int takao(bool takahashi){return yesno(takahashi,"Takahashi","Aoki");}
struct __m___m__ {__m___m__(){cin.tie(0);ios_base::sync_with_stdio(false);cout << fixed << setprecision(20);}} _m_m_;
int di[]={0,1,0,-1,-1,-1,1,1};
int dj[]={1,0,-1,0,-1,1,-1,1};
const ll INF = 8e18;
//using mint = modint1000000007;
using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}
template<typename T>
struct cumsum{
    int n;
    vector<T> v,w;
    cumsum(int _n):n(_n),v(_n+1),w(_n+1){}
    cumsum(vector<T> a):n((int)a.size()),v(a.size()+1),w(a.size()+1){
        rep(i,a.size())v[i+1]=v[i]+a[i];
        rep(i,a.size())w[i+1]=w[i]+a[i]*(i+1);
    }
    T sum(int l,int r){
        assert(0<=l&&l<=r&&r<=n);
        return v[r]-v[l];
    }
    T sum_r(int l,int r,T a,T d){
        assert(0<=l&&l<=r&&r<=n);
        return (a-(l+1)*d)*(v[r]-v[l])+d*(w[r]-w[l]);
    }
};
signed main() {

    INT(n,h);
    vi a(n),b(n);
    cin>>a>>b;
    cumsum ca(a);
    cumsum cb(b);
    int res = 0;
    for(int r=1;r<=n;r++){
        int ok = r-1;
        int ng = -1;
        auto f = [&](int l){
            return cb.sum_r(l,r,1,1)<=h;
        };
        while(abs(ng-ok)>1){
            int mid = ng+(ok-ng)/2;
            if(f(mid))ok = mid;
            else ng = mid;
        }
        if(f(ok))chmax(res,ca.sum(ok,r));
    }
    print(res);
    return 0;
}

yukicoder

結果

テストケース

ソースコード