제출 #936639

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

Main

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

#define F first
#define S second
#define mkp make_pair
#define PH push
#define PB push_back
#define REP(i,N) for( int i = 0; i < (N); ++i )
#define FOR(i,a,b) for( int i = (a); i <= (b); ++i )
#define ALL(x) begin(x), end(x)
#define MEM(x) memset(x, 0, sizeof(x))

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T>
using V=vector<T>;

void solve() {
	int N, M; cin >> N >> M;
	V<pll> vc(N);
	for( auto &i : vc ) cin >> i.F;
	for( auto &i : vc ) cin >> i.S;
	ll total = 1LL*N*M;

	auto check = [&]( ll val ) {
		ll sum = 0;
		for( auto &i : vc ){
			sum += (val+i.S-1)/i.S;
		}
		return sum;
	};

	ll l = 0, r = 1e18+3000;
	while( r-l > 1 ) {
		ll m = (l+r)>>1;
		if( check(m)<=total )
			l=m;
		else 
			r=m;
	}
	cout << l << '\n';
}
int main() {
	int T = 1;
#ifdef LOCAL
	freopen( "input.txt", "r", stdin);
	freopen( "output.txt", "w", stdout );
	cin >> T;
#else
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif
	while(T--) solve();

}

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