oj.uz

답안 #534228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
534228 2022-03-08T02:37:39 Z Paul_Liao_1457 Self Study (JOI22_ho_t2) C++14
0 / 100
 428 ms 4996 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 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];
    FOR(i,1,n+1) cin>>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){
            aaa[i]=max(aaa[i],bbb[i]);
            if(aaa[i]*m<mid){
                ll tmp=mid-aaa[i]*m;
                tot+=(tmp-1)/bbb[i]+1+INF;
            }
            else{
                //ll tmp=(mid-1)/aaa[i]+1;
                //tot-=m-tmp;
            }
        }
        //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 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 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 1 ms 204 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 302 ms 4932 KB Output is correct
12 Correct 302 ms 4996 KB Output is correct
13 Correct 256 ms 4936 KB Output is correct
14 Incorrect 428 ms 4964 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 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 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 1 ms 204 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 302 ms 4932 KB Output is correct
12 Correct 302 ms 4996 KB Output is correct
13 Correct 256 ms 4936 KB Output is correct
14 Incorrect 428 ms 4964 KB Output isn't correct
15 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 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 1 ms 204 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 302 ms 4932 KB Output is correct
12 Correct 302 ms 4996 KB Output is correct
13 Correct 256 ms 4936 KB Output is correct
14 Incorrect 428 ms 4964 KB Output isn't correct
15 Halted 0 ms 0 KB -