oj.uz

답안 #619245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
619245 2022-08-02T10:43:03 Z StrawHatWess Self Study (JOI22_ho_t2) C++17
0 / 100
 320 ms 6804 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 4e18;
const int MX = 3e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////


ll N,M; 
vector<ll> a(MX), b(MX);

int check(ll L){
	ll n=0; 

	FOR(i,0,N){
        ll needed=(L+a[i]-1)/a[i]; 
    
        if(a[i]*M>=L){
            assert(M>=needed); 
            n-=M-needed; 
        }
        else{
            n+=(L-a[i]*M+b[i]-1)/b[i]; 
        }
	}

	return (n<=0); 
}

int main() {
    boost; IO();

    cin>>N>>M; 
    
    FOR(i,0,N) cin>>a[i]; 
    FOR(i,0,N) cin>>b[i]; 

    FOR(i,0,N) ckmax(a[i],b[i]); 

    ll l=0, r=INF, ans; 
    while(l<=r){
    	ll m=(l+r)/2; 

    	if(check(m)) ans=m, l=m+1; 
    	else r=m-1;
    }
    assert(ans>0); 
    cout << ans << endl;
    

    return 0;
}
//Change your approach

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 5032 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 5 ms 5076 KB Output is correct
11 Correct 181 ms 6504 KB Output is correct
12 Correct 177 ms 6544 KB Output is correct
13 Correct 173 ms 6552 KB Output is correct
14 Incorrect 320 ms 6548 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5028 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 5040 KB Output is correct
9 Correct 94 ms 6804 KB Output is correct
10 Correct 72 ms 6748 KB Output is correct
11 Correct 49 ms 6404 KB Output is correct
12 Correct 44 ms 6164 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 4 ms 5032 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Incorrect 7 ms 4948 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 5032 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 5 ms 5076 KB Output is correct
11 Correct 181 ms 6504 KB Output is correct
12 Correct 177 ms 6544 KB Output is correct
13 Correct 173 ms 6552 KB Output is correct
14 Incorrect 320 ms 6548 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5028 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 5040 KB Output is correct
9 Correct 94 ms 6804 KB Output is correct
10 Correct 72 ms 6748 KB Output is correct
11 Correct 49 ms 6404 KB Output is correct
12 Correct 44 ms 6164 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 4 ms 5032 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Incorrect 7 ms 4948 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 5032 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 5 ms 5076 KB Output is correct
11 Correct 181 ms 6504 KB Output is correct
12 Correct 177 ms 6544 KB Output is correct
13 Correct 173 ms 6552 KB Output is correct
14 Incorrect 320 ms 6548 KB Output isn't correct
15 Halted 0 ms 0 KB -