| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1179444 | 12345678 | Self Study (JOI22_ho_t2) | C++17 | 118 ms | 5132 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin>>n>>m;
int a[n],b[n];
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
cin>>b[i];
int l=0,r=1e18;
while(l<r)
{
int mid=(l+r+1)/2;
int cnt=0;
for(int i=0;i<n;i++)
{
if (cnt>n*m) break;
int t=mid;
if(b[i]>=a[i])
{
cnt+=ceil((double)t/b[i]);
continue;
}
if(a[i]*m>=t)
{
cnt+=ceil((double)t/a[i]);
continue;
}
cnt+=m;
t-=a[i]*m;
cnt+=ceil((double)t/b[i]);
if (cnt>n*m) break;
}
//cout<<l<<" "<<r<<" "<<mid<<endl;
if(cnt<=n*m)
l=mid;
else
r=mid-1;
}
cout<<l;
}| # | 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... | ||||
