Submission #891656

#TimeUsernameProblemLanguageResultExecution timeMemory
89165612345678Self Study (JOI22_ho_t2)C++17
25 / 100
80 ms4956 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int nx=3e5+5; ll n, m, a[nx], b[nx], l=1, r=1e15; bool check(ll x) { ll vl=n*m; for (int i=1; i<=n; i++) { if (vl*a[i]<x) return 0; vl-=(x%a[i]==0)?(x/a[i]):(x/a[i]+1); } return 1; } int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n>>m; for (int i=1; i<=n; i++) cin>>a[i]; for (int i=1; i<=n; i++) cin>>b[i]; while (l<r) { ll md=(l+r+1)/2; if (check(md)) l=md; else r=md-1; } cout<<l; }
#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...