Submission #885849

#	Time	Username	Problem	Language	Result	Execution time	Memory
885849		NintsiChkhaidze	Self Study (JOI22_ho_t2)	C++17	0 / 100	270 ms	7572 KiB

Main

#include <bits/stdc++.h>
#define pb push_back
#define s second
#define f first
#define pii pair<int,int>
#define ll long long
#define int ll
using namespace std;

const int N = 3e5 + 3;

int a[N],b[N],n,m,cur[N];

bool check(int x){

	int need=0,have=0;
	for (int i = 1; i <= n; i++){
		cur[i] = max(a[i],b[i]) * m;
		if (cur[i] > x){
			have += (cur[i] - x) / max(a[i],b[i]);
		}else if (cur[i] < x){
			need += (x - cur[i] + b[i] - 1)/b[i];
		}
	}

	return (have >= need);
}
signed main (){
    ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
	
	cin>>n>>m;

	for (int i = 1; i <= n; i++) 
		cin >> a[i];
	
	for (int i = 1; i <= n; i++)
		cin >> b[i];

	int l = 0,r = 1e18,res=0;
	while (l <= r){
		int mid = (l + r)/2;
		if (check(mid)){
			res=mid;
			l=mid+1;
		}else{
			r=mid-1;
		}
	}
	cout<<res;
}

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