Submission #1149840

#TimeUsernameProblemLanguageResultExecution timeMemory
1149840henriessSelf Study (JOI22_ho_t2)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> using namespace std; long long n,m; vector<long long> A; vector<long long> B; bool check(long long mid){ long long ret = 0; for(int i = 0;i<n;i++){ if (B[i] > A[i]){ long long temp = (mid+B[i]-1) / B[i]; ret += temp; } else{ long long rem = (mid+A[i]-1) / A[i]; if (rem > m){ ret = m; } long long attend = rem * A[i]; long long temp = (mid - attend + B[i] - 1) / B[i]; ret += rem + temp; if (ret > n*m){ return false; } } } return ret <= n * m; } void bsta(){ long long lb = 0; long long ub = 1e18; long long mid = -1; long long ans = -1; while (lb <= ub){ mid = (lb + ub) / 2; if (check(mid)){ ans = mid; lb = mid + 1; } else{ ub = mid - 1; } } cout << ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; A.resize(n); B.resize(n); for(int i = 0;i<n;i++){ cin >> A[i]; } for(int i = 0;i<n;i++){ cin >> B[i]; } bsta(); }
#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...