제출 #1288546

#제출 시각아이디문제언어결과실행 시간메모리
1288546WH8Self Study (JOI22_ho_t2)C++20
0 / 100
242 ms5108 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define pll pair<int, int> #define mp make_pair #define pb push_back #define f first #define s second #define endl '\n' #define ld long double #define sz(x) static_cast<int>((x).size()) #define i5 tuple<int,int,int,int,int> int cdiv(int a, int b){ return a/b + !!(a%b); } signed main(){ int n,m;cin>>n>>m; int a[n], b[n]; for(int i=0;i<n;i++)cin>>a[i]; for(int i=0;i<n;i++){ cin>>b[i]; if(a[i] < b[i])a[i]=b[i]; } int l=1, r=1e15, mid; while(r-l>1){ mid=(l+r)/2; int req=0, add=0; for(int i=0;i<n;i++){ if(cdiv(mid, a[i]) > m){ // overflow req+=cdiv(mid-m*a[i], b[i]); } else { add+=m-cdiv(mid,a[i]); } } if(req <= add){ l=mid; } else { r=mid; } } 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...