제출 #1177276

#제출 시각아이디문제언어결과실행 시간메모리
1177276chikien2009Self Study (JOI22_ho_t2)C++20
0 / 100
123 ms5136 KiB
#include <bits/stdc++.h> using namespace std; void setup() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int n; long long m, l, r, mid, res, a[300000], b[300000]; inline bool Check(long long inp) { long long k = 0; for (int i = 0; i < n; ++i) { if (a[i] <= b[i]) { k += m - (inp + b[i] - 1) / b[i]; } else { if (a[i] * m <= inp) { k -= (inp - a[i] * m + b[i] - 1) / b[i]; } else { k += (a[i] * m - inp) / a[i]; } } } return k >= 0; } int main() { setup(); cin >> n >> m; for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = 0; i < n; ++i) { cin >> b[i]; } l = 1; r = 2e18; while (l <= r) { mid = (l + r) >> 1; if (Check(mid)) { res = mid; l = mid + 1; } else { r = mid - 1; } } cout << res; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...