// 還要更強
#include<iostream>
#include<queue>
#include<set>
#include<map>
#include<iomanip>
#include<math.h>
#include<cstring>
#include<stack>
#include<string.h>
#include<random>
#include<algorithm>
#include<vector>
#include <cassert>
#define ll __int128_t
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define INF (ll)(1e9)
#define pb push_back
#define F first
#define S second
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
using namespace std;
long long n,m;
long long aaa[300005],bbb[300005];
signed main(){
AC;
cin>>n>>m;
FOR(i,1,n+1){
cin>>aaa[i]; aaa[i]=abs(aaa[i]);
}
FOR(i,1,n+1){
cin>>bbb[i]; bbb[i]=abs(bbb[i]); aaa[i]=max(aaa[i],bbb[i]);
}
ll l=0,r=(2e18+1),ans=0;
while(l<r){
ll mid=(l+r)/2,tot=0;
FOR(i,1,n+1){
if(aaa[i]*m<mid){
ll tmp=mid-aaa[i]*m;
tot+=1ll*(tmp-1)/abs(bbb[i])+1;
}
else{
ll used=(mid-1)/aaa[i]+1;
used=1;
tot-=m-used;
//cerr<<"m="<<m<<endl;
}
//cout<<"m="<<m<<endl;
}
//cout<<"mid="<<mid<<" tot="<<tot<<endl;
if(tot<=0){
ans=max(ans,mid);
l=mid+1;
}
else{
r=mid;
}
}
cout<<(long long)ans<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
3 ms |
332 KB |
Output is correct |
11 |
Correct |
132 ms |
4992 KB |
Output is correct |
12 |
Correct |
134 ms |
4988 KB |
Output is correct |
13 |
Correct |
179 ms |
4980 KB |
Output is correct |
14 |
Correct |
210 ms |
4996 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
200 ms |
5236 KB |
Output is correct |
17 |
Correct |
214 ms |
5728 KB |
Output is correct |
18 |
Correct |
139 ms |
5700 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
200 ms |
5236 KB |
Output is correct |
3 |
Correct |
214 ms |
5728 KB |
Output is correct |
4 |
Correct |
139 ms |
5700 KB |
Output is correct |
5 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
3 ms |
332 KB |
Output is correct |
11 |
Correct |
132 ms |
4992 KB |
Output is correct |
12 |
Correct |
134 ms |
4988 KB |
Output is correct |
13 |
Correct |
179 ms |
4980 KB |
Output is correct |
14 |
Correct |
210 ms |
4996 KB |
Output is correct |
15 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
3 ms |
332 KB |
Output is correct |
11 |
Correct |
132 ms |
4992 KB |
Output is correct |
12 |
Correct |
134 ms |
4988 KB |
Output is correct |
13 |
Correct |
179 ms |
4980 KB |
Output is correct |
14 |
Correct |
210 ms |
4996 KB |
Output is correct |
15 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |