답안 #534243

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
534243	2022-03-08T02:43:56 Z	Paul_Liao_1457	Self Study (JOI22_ho_t2)	C++14	0 / 100	465 ms	4980 KB

Main

// 還要更強
#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 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)(1e9)
#define pb push_back
#define F first
#define S second

using namespace std;

ll n,m;
ll aaa[300005],bbb[300005];


signed main(){
    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=(1e18+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;
                tot-=m-used;
            }
            //cout<<"m="<<m<<endl;
        }
        //cout<<"mid="<<mid<<" tot="<<tot<<endl;
        if(tot<=0){
            ans=max(ans,mid);
            l=mid+1;
        }
        else{
            r=mid;
        }
    }
    cout<<ans<<endl;
}

Subtask #1

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 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	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	5 ms	364 KB	Output is correct
11	Correct	340 ms	4940 KB	Output is correct
12	Correct	325 ms	4972 KB	Output is correct
13	Correct	265 ms	4980 KB	Output is correct
14	Incorrect	465 ms	4968 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	204 KB	Output is correct
6	Correct	1 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	171 ms	2604 KB	Output is correct
10	Correct	112 ms	1844 KB	Output is correct
11	Correct	86 ms	1372 KB	Output is correct
12	Correct	83 ms	1348 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Incorrect	6 ms	332 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 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	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	5 ms	364 KB	Output is correct
11	Correct	340 ms	4940 KB	Output is correct
12	Correct	325 ms	4972 KB	Output is correct
13	Correct	265 ms	4980 KB	Output is correct
14	Incorrect	465 ms	4968 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	204 KB	Output is correct
6	Correct	1 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	171 ms	2604 KB	Output is correct
10	Correct	112 ms	1844 KB	Output is correct
11	Correct	86 ms	1372 KB	Output is correct
12	Correct	83 ms	1348 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Incorrect	6 ms	332 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 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	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	5 ms	364 KB	Output is correct
11	Correct	340 ms	4940 KB	Output is correct
12	Correct	325 ms	4972 KB	Output is correct
13	Correct	265 ms	4980 KB	Output is correct
14	Incorrect	465 ms	4968 KB	Output isn't correct
15	Halted	0 ms	0 KB	-