제출 #1319711

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1319711		MuhammadSaram	Self Study (JOI22_ho_t2)	C++20	62 / 100	251 ms	5088 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define int long long

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], a[i]=max(a[i],b[i]);
	int s=0, e=1e18+1;
	while (s+1<e)
	{
		int mid=(s+e)/2, tot=0;
		for (int i=0;i<n;i++)
		{
			int val;
			if (a[i]*m>=mid)
				val=(mid+a[i]-1)/a[i];
			else
				val=(mid-a[i]*m+b[i]-1)/b[i]+m;
			if (n*m-tot<val)
			{
				tot=n*m+1;
				break;
			}
			else
				tot+=val;
		}
		if (tot<=n*m)
			s=mid;
		else
			e=mid;
	}
	cout<<s<<endl;

	return 0;
}

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