답안 #534090

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
534090	2022-03-08T00:58:15 Z	Paul_Liao_1457	Self Study (JOI22_ho_t2)	C++17	10 / 100	270 ms	5000 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>

#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]<tmp){
            tmp-=a[i];
            res--;
        }
        else{
            //ll used=(tmp-1)/a[i]+1;
            //used=max(used,1ll);
            //res+=m-used;
        }
    }
    if(res>=0) return 1;
    return 0;
}

signed main(){
    cin>>n>>m;
    FOR(i,0,n) cin>>a[i];
    FOR(i,0,n){
        cin>>b[i]; a[i]=max(a[i],b[i]);
    }
    ll l=0,r=(2e18+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;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 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	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	4 ms	332 KB	Output is correct
11	Correct	230 ms	4920 KB	Output is correct
12	Correct	239 ms	4880 KB	Output is correct
13	Correct	184 ms	4892 KB	Output is correct
14	Correct	166 ms	4892 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	88 ms	4880 KB	Output is correct
17	Correct	270 ms	5000 KB	Output is correct
18	Correct	226 ms	4876 KB	Output is correct

Subtask #2

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	88 ms	4880 KB	Output is correct
3	Correct	270 ms	5000 KB	Output is correct
4	Correct	226 ms	4876 KB	Output is correct
5	Incorrect	0 ms	204 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 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	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	4 ms	332 KB	Output is correct
11	Correct	230 ms	4920 KB	Output is correct
12	Correct	239 ms	4880 KB	Output is correct
13	Correct	184 ms	4892 KB	Output is correct
14	Correct	166 ms	4892 KB	Output is correct
15	Incorrect	0 ms	204 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	204 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 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	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	4 ms	332 KB	Output is correct
11	Correct	230 ms	4920 KB	Output is correct
12	Correct	239 ms	4880 KB	Output is correct
13	Correct	184 ms	4892 KB	Output is correct
14	Correct	166 ms	4892 KB	Output is correct
15	Incorrect	0 ms	204 KB	Output isn't correct
16	Halted	0 ms	0 KB	-