# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588077 | Mounir | Self Study (JOI22_ho_t2) | C++14 | 136 ms | 11340 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.
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define pb push_back
#define pii pair<int, int>
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
#define print(x) cout << #x << " est " << x << endl;
#define x first
#define y second
#define int long long
using namespace std;
const signed N = 1e6;
signed nCours, nWeeks;
int a[N], b[N];
inline bool isOk(int bInf){
signed aAllouer = 0;
for (signed iCours = 0; iCours < nCours; ++iCours){
signed besoin = ceil(bInf/(long double)a[iCours]);
if (besoin <= nWeeks)
aAllouer += nWeeks - besoin;
else
aAllouer -= ceil((bInf - nWeeks * a[iCours])/(long double)b[iCours]);
}
// cout << aAllouer
return aAllouer >= 0;
}
signed main(){
scanf("%d%d", &nCours, &nWeeks);
for (signed i = 0; i < nCours; ++i)
scanf("%lld", &a[i]);
for (signed i = 0; i < nCours; ++i){
scanf("%lld", &b[i]);
chmax(a[i], b[i]);
}
int gauche = 0, droite = nWeeks * 1e9;
while (droite > gauche){
int mid = (gauche + droite)/2 + 1;
if (isOk(mid))
gauche = mid;
else
droite = mid - 1;
}
printf("%lld\n", gauche);
return 0;
}
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... |