oj.uz

답안 #527999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527999 2022-02-19T01:37:07 Z amukkalir Self Study (JOI22_ho_t2) C++17
10 / 100
 60 ms 6168 KB 
#include <bits/stdc++.h> 
using namespace std; 
typedef long long ll; 

#define prn printf
#define scn scanf

ll n, m; 
const int nax = 3e5; 
ll a[nax+5], b[nax+5]; 

ll updiv(ll a, ll b) {
    ll ret = a/b; 
    if(b*ret!=a) ret++; 
    return ret; 
}

bool ok (ll x) {
    ll jum = 0; 
    for(int i=0; i<n; i++) {
        ll rem = x; 
        ll cur = 0; 
        if(a[i] > b[i]) {
            cur += min(m, updiv(x, a[i])); 
            rem -= cur*a[i]; 
        }
        if(rem > 0) {
            cur += updiv(rem, b[i]); 
        }
//cerr << i << " " << cur << endl; 
        jum += cur; 
    }
    return jum <= n*m; 
}

signed main () {
    scn("%lld %lld", &n, &m); 
    for(int i=0; i<n; i++) scn("%lld", &a[i]);
    for(int i=0; i<n; i++) scn("%lld", &b[i]);
    ll ans = 1e18; 
    for(int i=0; i<n; i++) ans = min(ans, max(a[i], b[i])); 
    cout << ans << endl; 
    exit(0); 
    //ll ans = 0; 
    ll lo = 1, hi = 1e18; 
    while(lo <= hi) {
        ll mid = (lo+hi)>>1; 
        if(ok(mid)) {
            ans = mid; 
            lo = mid+1; 
        } else hi = mid-1; 
    }
    prn("%lld", ans); 
}

/*
binser 
cek (x)
coba self study semua 
coba kalo nambahin dtg bsb erkurang ga harinya 
jumlahin harinya hrs less than or equal n*m

*/

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:37:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     scn("%lld %lld", &n, &m);
      |        ^
Main.cpp:38:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     for(int i=0; i<n; i++) scn("%lld", &a[i]);
      |                               ^
Main.cpp:39:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |     for(int i=0; i<n; i++) scn("%lld", &b[i]);
      |                               ^

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 1 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 308 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 1 ms 332 KB Output is correct
11 Correct 58 ms 4852 KB Output is correct
12 Correct 57 ms 4932 KB Output is correct
13 Correct 50 ms 4980 KB Output is correct
14 Correct 47 ms 4896 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 38 ms 5280 KB Output is correct
17 Correct 60 ms 5660 KB Output is correct
18 Correct 58 ms 6168 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 38 ms 5280 KB Output is correct
3 Correct 60 ms 5660 KB Output is correct
4 Correct 58 ms 6168 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 1 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 308 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 1 ms 332 KB Output is correct
11 Correct 58 ms 4852 KB Output is correct
12 Correct 57 ms 4932 KB Output is correct
13 Correct 50 ms 4980 KB Output is correct
14 Correct 47 ms 4896 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 1 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 308 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 1 ms 332 KB Output is correct
11 Correct 58 ms 4852 KB Output is correct
12 Correct 57 ms 4932 KB Output is correct
13 Correct 50 ms 4980 KB Output is correct
14 Correct 47 ms 4896 KB Output is correct
15 Incorrect 0 ms 204 KB Output isn't correct
16 Halted 0 ms 0 KB -