제출 #1295456

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1295456		muhammad-mutahir	Self Study (JOI22_ho_t2)	C++20	100 / 100	224 ms	7488 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e9+7;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;

void solve(int testcase_number){
    cin>>n>>k;
    input(int,a,n);
    input(int,b,n);

    int ans = inf;
    for(int i = 0;i<n;i++){
    	ans = min(ans,max(a[i],b[i]));
    }
    int l = 0;
    int r = 3e18;
    while(r-l>1){
    	int m = (l+r)/2;
    	vector<int>cn(n,0);
    	int ec = 0;
    	for(int i =0 ;i<n;i++){
    		if(a[i] >= b[i]){
    			cn[i] += a[i]*min(k,((m+a[i]-1)/a[i]));
    			ec += k-min(k,((m+a[i]-1)/a[i]));
    		}
    		else{
    			ec += k;
    			
    		}
    	}
    	for(int i = 0;i<n;i++){
    		if(cn[i]>=m)continue;
    		int y = cn[i];
    		cn[i] += b[i] * min(ec,(( (m-y) + b[i]-1)/b[i]));
    		ec -= min(ec,(((m-y)+b[i]-1)/b[i]));    		
    	}
    	int f = 1;
    	for(int i = 0;i<n;i++){
    		if(cn[i]<m){
    			f = 0;
    			break;
    		}
    	}
    	if(ec>=0 and f){
    		l = m;
    	}
    	else{
    		r = m;
    	}
    }
    
    
    cout<<l<<endl;
}


signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);

    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

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