Submission #534172

#TimeUsernameProblemLanguageResultExecution timeMemory
534172PixelCatSelf Study (JOI22_ho_t2)C++14
54 / 100
221 ms5024 KiB
#include <bits/stdc++.h> #define For(i,a,b) for(int i=a;i<=b;i++) #define Forr(i,a,b) for(int i=a;i>=b;i--) #define F first #define S second #define sz(x) ((int)x.size()) #define all(x) x.begin(),x.end() #define eb emplace_back #define INF (LL)(9e18) #define int __int128_t using namespace std; using LL=long long; using pii=pair<int,int>; const int MAXN=300030; int a[MAXN]; int b[MAXN]; bool check(int n,int m,int tar){ int s=0; For(i,1,n){ s+=(tar+a[i]-1)/a[i]; } return s<=n*m; } int32_t main(){ ios::sync_with_stdio(false); cin.tie(0); // OAO LL n,m; cin>>n>>m; For(i,1,n){ LL t; cin>>t; a[i]=t; } int hi=1000000000000000010; int lo=0; while(hi-lo>1){ int mi=lo+(hi-lo)/2; if(check(n,m,mi)) lo=mi; else hi=mi; } cout<<(LL)lo<<"\n"; 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...