Submission #534121

#TimeUsernameProblemLanguageResultExecution timeMemory
534121Paul_Liao_1457Self Study (JOI22_ho_t2)C++17
10 / 100
350 ms5392 KiB
// 還要更強 #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> #define ll long long #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)(2e18) #define pb push_back #define F first #define S second using namespace std; ll n,m; ll a[300005],b[300005]; bool check(ll x){ ll res=0; FOR(i,0,n){ ll tmp=x; if((a[i]*m)<=tmp){ tmp-=1ll*(a[i]*m); if(tmp<0){ tmp=0; } else if(tmp>0){ tmp=(tmp-1)/abs(b[i])+1; } res-=tmp; } else{ //ll used=(tmp-1)/a[i]+1; //res+=m-used; } } if(res>=0) return 1; return 0; } signed main(){ cin>>n>>m; FOR(i,0,n){ cin>>a[i]; a[i]=abs(a[i]); } FOR(i,0,n){ cin>>b[i]; b[i]=abs(b[i]); a[i]=max(a[i],b[i]); } ll l=0,r=(1e18+1),ans=0; while(l<r){ ll mid=(l+r)>>1; if(check(mid)){ ans=max(ans,mid); l=mid+1; } else{ r=mid; } } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...