oj.uz

답안 #534283

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
534283 2022-03-08T03:06:31 Z Paul_Liao_1457 Self Study (JOI22_ho_t2) C++14
10 / 100
 228 ms 14428 KB 
// 還要更強
#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;
ll aaa[300005],bbb[300005];
long long a[300005],b[300005];



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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 162 ms 14384 KB Output is correct
12 Correct 152 ms 14428 KB Output is correct
13 Correct 178 ms 14428 KB Output is correct
14 Correct 228 ms 14384 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 213 ms 14304 KB Output is correct
17 Correct 178 ms 14276 KB Output is correct
18 Correct 166 ms 14360 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 213 ms 14304 KB Output is correct
3 Correct 178 ms 14276 KB Output is correct
4 Correct 166 ms 14360 KB Output is correct
5 Incorrect 1 ms 332 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 162 ms 14384 KB Output is correct
12 Correct 152 ms 14428 KB Output is correct
13 Correct 178 ms 14428 KB Output is correct
14 Correct 228 ms 14384 KB Output is correct
15 Incorrect 1 ms 332 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

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

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 162 ms 14384 KB Output is correct
12 Correct 152 ms 14428 KB Output is correct
13 Correct 178 ms 14428 KB Output is correct
14 Correct 228 ms 14384 KB Output is correct
15 Incorrect 1 ms 332 KB Output isn't correct
16 Halted 0 ms 0 KB -