# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
674586 | guagua0407 | Self Study (JOI22_ho_t2) | C++17 | 475 ms | 5004 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
希望全國賽不要墊底
全國賽策略:
0:00-0:15:讀題
0:15-3:00:寫掉有把握的
3:00-5:00:撈分+寫掉快好的
記得上廁所
記得吃東西
*/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const ll mxn=3e5+5;
ll n,m;
ll a[mxn],b[mxn];
bool check(ll k){
ll need=0,used=0;
for(ll i=0;i<n;i++){
ll tmp=min(m,(k+a[i]-1)/a[i]);
ll kk=k-(tmp*a[i]);
if(kk>0){
need+=(kk+b[i]-1)/b[i];
}
else{
used+=m-tmp;
}
}
return used>=need;
}
int main() {_
//setIO("wayne");
cin>>n>>m;
for(ll i=0;i<n;i++){
cin>>a[i];
}
for(ll i=0;i<n;i++){
cin>>b[i];
a[i]=max(a[i],b[i]);
}
ll l = 0, r = 4e18;
while (l!=r) {
ll mid = (l+r)/2;
if (check(mid)) {
l = mid+1;
}else{
r = mid;
}
}
cout<<l-1<<'\n';
return 0;
}
//maybe its multiset not set
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |