# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921489 | cthbst | Self Study (JOI22_ho_t2) | C++14 | 326 ms | 11052 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 <algorithm>
#include <cmath>
#include <iostream>
#define int long long
using namespace std;
const int MAXN = 300005;
int n, m;
int a[MAXN];
int b[MAXN];
void init() {
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) cin >> b[i];
for (int i = 0; i < n; i++) a[i] = max(a[i], b[i]);
}
bool check(int D) {
__int128 extra = 0;
// cout << "D = " << D << '\n';
for (int i = 0; i < n; i++) {
if (a[i] * m >= D) {
extra += m - ceil(1.0 * D / a[i]);
} else { // a[i] * m < D
extra -= ceil(1.0 * (D - a[i] * m) / b[i]);
# | 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... |