| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1333286 | wstcube | Self Study (JOI22_ho_t2) | C++20 | 1096 ms | 344 KiB |
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pb push_back
using namespace std;
const int N = 2e5+5;
int main(){
ll n;
cin >> n;
ll m;
cin >> m;
vector<ll> a(n),b(n);
ll ma=0;
for(int i=0;i<n;i++){
cin >> a[i];
ma = max(a[i],ma);
}
for(int i=0;i<n;i++)
cin >> b[i];
ll l=1,r=ma*m;
ll c=0;
while(l!=r){
c=0;
ll x = (l+r)/2;
for(int i=0;i<n;i++){
c+=(x/b[i]);
}
if(c>n*m)
r=x-1;
else
l=x;
}
cout << l;
return 0;
}
| # | 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... | ||||
