oj.uz

Submission #527996

# Submission time Handle Problem Language Result Execution time Memory
527996 2022-02-19T01:30:01 Z amukkalir Self Study (JOI22_ho_t2) C++17
0 / 100
 473 ms 7120 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; 
int 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("%d", &a[i]);
    for(int i=0; i<n; i++) scn("%d", &b[i]);

    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("%d", &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("%d", &b[i]);
      |                               ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 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 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 209 ms 7120 KB Output is correct
12 Correct 213 ms 6952 KB Output is correct
13 Correct 157 ms 4208 KB Output is correct
14 Incorrect 473 ms 6296 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 1 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 89 ms 3588 KB Output is correct
10 Correct 57 ms 1884 KB Output is correct
11 Correct 43 ms 1524 KB Output is correct
12 Correct 34 ms 1304 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Incorrect 5 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 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 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 209 ms 7120 KB Output is correct
12 Correct 213 ms 6952 KB Output is correct
13 Correct 157 ms 4208 KB Output is correct
14 Incorrect 473 ms 6296 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 1 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 89 ms 3588 KB Output is correct
10 Correct 57 ms 1884 KB Output is correct
11 Correct 43 ms 1524 KB Output is correct
12 Correct 34 ms 1304 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Incorrect 5 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 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 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 209 ms 7120 KB Output is correct
12 Correct 213 ms 6952 KB Output is correct
13 Correct 157 ms 4208 KB Output is correct
14 Incorrect 473 ms 6296 KB Output isn't correct
15 Halted 0 ms 0 KB -