| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 978743 | 2024-05-09T15:02:43 Z | DobromirAngelov | Self Study (JOI22_ho_t2) | C++14 | 143 ms | 17488 KB |
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN=3e6+5;
const long long INF=1e18+5;
int n,m;
long long a[MAXN];
long long b[MAXN];
bool check(long long val)
{
long long s=0;
bool fl=0;
for(int i=1;i<=n;i++)
{
long long cur=0;
if(a[i]*m>=val) cur+=(val+a[i]-1)/a[i];
else cur+=m+(val-a[i]*m+b[i]-1)/b[i];
s+=cur;
if(cur>1) fl=1;
}
if(fl && s<=n) cout<<1/0<<endl;
if(s>n) return 0;
return 1;
}
long long ans;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++) cin>>b[i];
for(int i=1;i<=n;i++) a[i]=max(a[i],b[i]);
ans=INF;
for(int i=1;i<=n;i++) ans=min(ans, a[i]);
long long l=1,r=INF;
while(l<r)
{
long long mid=(l+r+1)/2;
if(check(mid)) l=mid;
else r=mid-1;
}
//if(ans<l) cout<<1/0<<endl;
cout<<l<<endl;
return 0;
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 2392 KB | Output is correct |
| 2 | Correct | 1 ms | 2396 KB | Output is correct |
| 3 | Correct | 1 ms | 2396 KB | Output is correct |
| 4 | Correct | 1 ms | 2396 KB | Output is correct |
| 5 | Correct | 1 ms | 2396 KB | Output is correct |
| 6 | Correct | 1 ms | 2396 KB | Output is correct |
| 7 | Correct | 1 ms | 2396 KB | Output is correct |
| 8 | Correct | 1 ms | 2396 KB | Output is correct |
| 9 | Correct | 1 ms | 2396 KB | Output is correct |
| 10 | Correct | 3 ms | 2396 KB | Output is correct |
| 11 | Correct | 143 ms | 8824 KB | Output is correct |
| 12 | Correct | 143 ms | 8788 KB | Output is correct |
| 13 | Correct | 137 ms | 8788 KB | Output is correct |
| 14 | Runtime error | 46 ms | 17488 KB | Execution killed with signal 4 |
| 15 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 1 ms | 2392 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 2392 KB | Output is correct |
| 2 | Correct | 1 ms | 2396 KB | Output is correct |
| 3 | Correct | 1 ms | 2396 KB | Output is correct |
| 4 | Correct | 1 ms | 2396 KB | Output is correct |
| 5 | Correct | 1 ms | 2396 KB | Output is correct |
| 6 | Correct | 1 ms | 2396 KB | Output is correct |
| 7 | Correct | 1 ms | 2396 KB | Output is correct |
| 8 | Correct | 1 ms | 2396 KB | Output is correct |
| 9 | Correct | 1 ms | 2396 KB | Output is correct |
| 10 | Correct | 3 ms | 2396 KB | Output is correct |
| 11 | Correct | 143 ms | 8824 KB | Output is correct |
| 12 | Correct | 143 ms | 8788 KB | Output is correct |
| 13 | Correct | 137 ms | 8788 KB | Output is correct |
| 14 | Runtime error | 46 ms | 17488 KB | Execution killed with signal 4 |
| 15 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 1 ms | 2392 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 2392 KB | Output is correct |
| 2 | Correct | 1 ms | 2396 KB | Output is correct |
| 3 | Correct | 1 ms | 2396 KB | Output is correct |
| 4 | Correct | 1 ms | 2396 KB | Output is correct |
| 5 | Correct | 1 ms | 2396 KB | Output is correct |
| 6 | Correct | 1 ms | 2396 KB | Output is correct |
| 7 | Correct | 1 ms | 2396 KB | Output is correct |
| 8 | Correct | 1 ms | 2396 KB | Output is correct |
| 9 | Correct | 1 ms | 2396 KB | Output is correct |
| 10 | Correct | 3 ms | 2396 KB | Output is correct |
| 11 | Correct | 143 ms | 8824 KB | Output is correct |
| 12 | Correct | 143 ms | 8788 KB | Output is correct |
| 13 | Correct | 137 ms | 8788 KB | Output is correct |
| 14 | Runtime error | 46 ms | 17488 KB | Execution killed with signal 4 |
| 15 | Halted | 0 ms | 0 KB | - |