Submission #914974

#	Time	Username	Problem	Language	Result	Execution time	Memory
914974		ReLice	Self Study (JOI22_ho_t2)	C++17	100 / 100	222 ms	16220 KiB

Main

#include <bits/stdc++.h>
typedef __int128_t ll;
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define vll vector<ll>
#define bc back()
#define arr array
#define pll vector<pair<ll,ll>>
using namespace std;
template <class _T>
bool chmin(_T &x, const _T &y){
    bool f=0;
    if (x>y){x=y;f=1;}
    return f;
}
template <class _T>
bool chmax(_T &x, const _T &y){
    bool f=0;
    if (x<y){x=y;f=1;}
    return f;
}
//void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=2e18+7;
const ll mod=1e9+7;
const ll N=1e5+7;
const ld eps=1e-9;
istream& operator>>( istream& src, __int128_t& value) {
	long long v;src>>v;
	value = (ll)v;
	return src;
}
void solve(){
    ll i,j;
    ll n,m;
    cin>>n>>m;
    ll a[n],b[n];
    for(i=0;i<n;i++)cin>>a[i];
    for(i=0;i<n;i++)cin>>b[i];
    ll l=1,r=inf;
    while(l+1<r){
        ll mid=(l+r)/2;
        ll sum=0;
        for(i=0;i<n;i++){
            if(a[i]>b[i]){
                if(mid>a[i]*m) sum+=m+(mid-a[i]*m+b[i]-1)/b[i];
                else sum+=(mid+a[i]-1)/a[i];
            }else sum+=(mid+b[i]-1)/b[i];
        }
        if(sum<=n*m)l=mid;
        else r=mid;
    }
    cout<<(long long)l<<endl;
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
    ll t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}
/*



*/

Compilation message (stderr)

Main.cpp: In function 'void solve()':
Main.cpp:51:10: warning: unused variable 'j' [-Wunused-variable]
   51 |     ll i,j;
      |          ^

• Subtask 1: 10 / 10
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29
• Subtask 5: 9 / 9