結果
問題 | No.2694 The Early Bird Catches The Worm |
ユーザー | shkiiii_ |
提出日時 | 2024-03-22 22:27:51 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 90 ms / 2,000 ms |
コード長 | 1,717 bytes |
コンパイル時間 | 1,846 ms |
コンパイル使用メモリ | 172,016 KB |
実行使用メモリ | 15,868 KB |
最終ジャッジ日時 | 2024-03-22 22:27:59 |
合計ジャッジ時間 | 7,789 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 2 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 | 2 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 | 22 ms
6,676 KB |
testcase_25 | AC | 20 ms
6,676 KB |
testcase_26 | AC | 26 ms
7,168 KB |
testcase_27 | AC | 36 ms
8,704 KB |
testcase_28 | AC | 40 ms
9,472 KB |
testcase_29 | AC | 13 ms
6,676 KB |
testcase_30 | AC | 64 ms
13,116 KB |
testcase_31 | AC | 37 ms
8,832 KB |
testcase_32 | AC | 67 ms
13,476 KB |
testcase_33 | AC | 65 ms
13,196 KB |
testcase_34 | AC | 4 ms
6,676 KB |
testcase_35 | AC | 34 ms
8,320 KB |
testcase_36 | AC | 43 ms
9,856 KB |
testcase_37 | AC | 74 ms
14,508 KB |
testcase_38 | AC | 48 ms
10,624 KB |
testcase_39 | AC | 12 ms
6,676 KB |
testcase_40 | AC | 37 ms
8,832 KB |
testcase_41 | AC | 17 ms
6,676 KB |
testcase_42 | AC | 3 ms
6,676 KB |
testcase_43 | AC | 7 ms
6,676 KB |
testcase_44 | AC | 75 ms
14,556 KB |
testcase_45 | AC | 73 ms
14,556 KB |
testcase_46 | AC | 22 ms
6,676 KB |
testcase_47 | AC | 24 ms
6,784 KB |
testcase_48 | AC | 41 ms
9,472 KB |
testcase_49 | AC | 65 ms
15,868 KB |
testcase_50 | AC | 64 ms
15,868 KB |
testcase_51 | AC | 83 ms
15,868 KB |
testcase_52 | AC | 64 ms
15,868 KB |
testcase_53 | AC | 65 ms
15,868 KB |
testcase_54 | AC | 82 ms
15,868 KB |
testcase_55 | AC | 82 ms
15,868 KB |
testcase_56 | AC | 82 ms
15,868 KB |
testcase_57 | AC | 82 ms
15,868 KB |
testcase_58 | AC | 82 ms
15,868 KB |
testcase_59 | AC | 83 ms
15,868 KB |
testcase_60 | AC | 83 ms
15,868 KB |
testcase_61 | AC | 82 ms
15,868 KB |
testcase_62 | AC | 83 ms
15,868 KB |
testcase_63 | AC | 90 ms
15,868 KB |
testcase_64 | AC | 82 ms
15,868 KB |
testcase_65 | AC | 83 ms
15,868 KB |
testcase_66 | AC | 83 ms
15,868 KB |
testcase_67 | AC | 83 ms
15,868 KB |
testcase_68 | AC | 81 ms
15,868 KB |
testcase_69 | AC | 72 ms
15,868 KB |
testcase_70 | AC | 71 ms
15,868 KB |
testcase_71 | AC | 71 ms
15,868 KB |
testcase_72 | AC | 71 ms
15,868 KB |
testcase_73 | AC | 72 ms
15,868 KB |
testcase_74 | AC | 37 ms
9,600 KB |
testcase_75 | AC | 72 ms
15,868 KB |
ソースコード
#include<bits/stdc++.h> // #include<atcoder/all> // #include<boost/multiprecision/cpp_int.hpp> using namespace std; // using namespace atcoder; // using bint = boost::multiprecision::cpp_int; using ll = long long; using ull = unsigned long long; using P = pair<int,int>; using vi = vector<ll>; using vvi = vector<vi>; using vvvi = vector<vvi>; #define rep(i,n) for(ll i = 0;i < (ll)n;i++) #define ALL(x) (x).begin(),(x).end() #define sz(c) ((ll)(c).size()) #define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin()) // #define MOD 1000000007 #define MOD 998244353 template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>; template<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?" ":"");return os;} template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;} template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;} template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;} int main(){ ios_base::sync_with_stdio(0), cin.tie(0); ll n,H; cin >> n >> H; vi a(n),b(n); cin >> a >> b; vector<__int128_t> sa(n+1,0),sb(n+1,0),ssb(n+1,0); rep(i,n)sa[i+1] = sa[i] + a[i]; for(int i = n;i > 0;i--)sb[i-1] = sb[i] + b[i-1]; for(int i = n;i > 0;i--)ssb[i-1] = ssb[i] + sb[i-1]; ll res = 0; rep(i,n){ ll l = 0,r = n-i+1; while(r-l > 1){ ll mid = (l+r)/2; __int128_t k = ssb[i]-ssb[i+mid] - sb[i+mid]*mid; if(k <= H)l = mid; else r = mid; } res = max<ll>(res,sa[i+l]-sa[i]); } cout << res << "\n"; return 0; }