Submission #936639

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
936639	2024-03-02T12:34:03 Z	william950615	Self Study (JOI22_ho_t2)	C++14	0 / 100	72 ms	5620 KB

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.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	600 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	360 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	72 ms	5620 KB	Output is correct
10	Correct	49 ms	3932 KB	Output is correct
11	Correct	37 ms	2908 KB	Output is correct
12	Correct	31 ms	2396 KB	Output is correct
13	Correct	1 ms	600 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	4 ms	472 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	600 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	360 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	72 ms	5620 KB	Output is correct
10	Correct	49 ms	3932 KB	Output is correct
11	Correct	37 ms	2908 KB	Output is correct
12	Correct	31 ms	2396 KB	Output is correct
13	Correct	1 ms	600 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	4 ms	472 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-