| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1195545 | jesusarg | Self Study (JOI22_ho_t2) | C++20 | 173 ms | 5112 KiB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<ll> a(n), b(n);
for(int i = 0; i < n; i++){cin >> a[i];}
for(int i = 0; i < n; i++){cin >> b[i];}
ll lo = 0, hi =*max_element(a.begin(), a.end())*m;
while(lo <= hi){
ll mid = (lo+hi)>>1;
ll need = 0;
for(int i = 0; i < n; i++){
need += (mid+a[i])/a[i];
if(need>n*m) break;
}
if(need<=n*m){
lo = mid+1;
} else {
hi = mid-1;
}
}
cout << lo;
}| # | 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... | ||||
