제출 #648134

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
648134		alanl	Self Study (JOI22_ho_t2)	C++14	0 / 100	311 ms	5000 KiB

Main

#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define rep(X, a,b) for(int X=a;X<b;++X)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) (int)(a).size()
#define NL "\n"
using namespace std;
typedef pair<long long,long long> pll;
typedef pair<int,int> pii;
typedef long long ll;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << "," << p.second << ')'; }
template<typename A> ostream& operator<<(ostream &os, const vector<A> &p){
	for(const auto &a:p)
		os << a << " ";
	os << "\n";
	return os;
}

ll n, m;
ll a[300010], b[300010];

int check(ll x){
	ll left=0, need=0;
	rep(i,0,n){
		if(max(a[i], b[i])*m>=x) left+=(m-(ll)x/max(a[i], b[i])-(x%max(a[i], b[i])?1ll:0ll));
		else need+=(ll)(x-(ll)max(a[i], b[i])*m)/b[i]+((x-(ll)max(a[i], b[i])*m)%b[i]?1ll:0ll);
	}
	return need<=left;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	rep(i,0,n) cin>>a[i];
	rep(i,0,n) cin>>b[i];
	ll l=0, r=1e18+1;
	while(l<r-1){
		ll mid=(l+r)>>1;
		if(check(mid)) l=mid;
		else r=mid;
	}
	cout<<l<<NL;
}

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