#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 ) {
__int128 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();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
600 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
76 ms |
2652 KB |
Output is correct |
10 |
Correct |
49 ms |
1880 KB |
Output is correct |
11 |
Correct |
36 ms |
1628 KB |
Output is correct |
12 |
Correct |
30 ms |
1372 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
360 KB |
Output is correct |
16 |
Correct |
0 ms |
348 KB |
Output is correct |
17 |
Correct |
0 ms |
344 KB |
Output is correct |
18 |
Correct |
4 ms |
344 KB |
Output is correct |
19 |
Correct |
3 ms |
604 KB |
Output is correct |
20 |
Correct |
0 ms |
348 KB |
Output is correct |
21 |
Correct |
180 ms |
4956 KB |
Output is correct |
22 |
Correct |
146 ms |
4956 KB |
Output is correct |
23 |
Correct |
143 ms |
4952 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
600 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
76 ms |
2652 KB |
Output is correct |
10 |
Correct |
49 ms |
1880 KB |
Output is correct |
11 |
Correct |
36 ms |
1628 KB |
Output is correct |
12 |
Correct |
30 ms |
1372 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
360 KB |
Output is correct |
16 |
Correct |
0 ms |
348 KB |
Output is correct |
17 |
Correct |
0 ms |
344 KB |
Output is correct |
18 |
Correct |
4 ms |
344 KB |
Output is correct |
19 |
Correct |
3 ms |
604 KB |
Output is correct |
20 |
Correct |
0 ms |
348 KB |
Output is correct |
21 |
Correct |
180 ms |
4956 KB |
Output is correct |
22 |
Correct |
146 ms |
4956 KB |
Output is correct |
23 |
Correct |
143 ms |
4952 KB |
Output is correct |
24 |
Correct |
32 ms |
2068 KB |
Output is correct |
25 |
Correct |
77 ms |
4984 KB |
Output is correct |
26 |
Correct |
16 ms |
1368 KB |
Output is correct |
27 |
Correct |
147 ms |
10836 KB |
Output is correct |
28 |
Correct |
150 ms |
10760 KB |
Output is correct |
29 |
Correct |
148 ms |
10832 KB |
Output is correct |
30 |
Correct |
172 ms |
10772 KB |
Output is correct |
31 |
Correct |
207 ms |
10772 KB |
Output is correct |
32 |
Correct |
209 ms |
6224 KB |
Output is correct |
33 |
Correct |
209 ms |
11344 KB |
Output is correct |
34 |
Correct |
203 ms |
6228 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |