Submission #863833

#	Time	Username	Problem	Language	Result	Execution time	Memory
863833		phoenix0423	Self Study (JOI22_ho_t2)	C++17	0 / 100	286 ms	7720 KiB

Main

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
const int maxn = 2e5 + 5;
const ll INF = 8e18;

int main(void){
	fastio;
	ll n, m;
	cin>>n>>m;
	vector<ll> a(n), b(n);
	for(int i = 0; i < n; i++) cin>>a[i];
	for(int i = 0; i < n; i++) cin>>b[i];
	ll l = 0, r = INF;
	while(l + 1 < r){
		ll mid = (l + r) / 2;
		vector<ll> have(n, 0);
		ll nd = 0;
		for(int i = 0; i < n; i++){
			if(a[i] <= b[i]){
				nd += (mid - 1) / b[i] + 1;
				continue;
			}
			if(a[i] * m >= mid){
				nd += (mid - 1) / a[i] + 1;
				continue;
			}
			else{
				nd += m + (mid - a[i] * m - 1) / b[i] + 1;
			}
			if(nd > n * m) break;
		}
		if(nd > n * m) r = mid;
		else l = mid;
	}
	cout<<l<<"\n";
}

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