oj.uz

답안 #738016

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
738016 2023-05-08T05:28:42 Z maomao90 Self Study (JOI22_ho_t2) C++17
54 / 100
 261 ms 9148 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 2000000000000000005ll;
const int MAXN = 300005;

int n, m;
int a[MAXN], b[MAXN];

ll need[MAXN];
bool isPos(ll x) {
    /*
    ll ex = 0;
    REP (i, 0, n) {
        need[i] = x;
        if (a[i] <= b[i]) {
            ex += m;
            continue;
        }
        ll use = min((ll) m, (x - 1) / a[i] + 1);
        ex += m - use;
        need[i] = max(0ll, x - use * a[i]);
    }
    REP (i, 0, n) {
        if (need[i] == 0) {
            continue;
        }
        ll use = (need[i] - 1) / b[i] + 1;
        ex -= use;
    }
    return ex >= 0;
    */
    ll sm = 0;
    REP (i, 0, n) {
        ll need = (x - 1) / a[i] + 1;
        sm += need;
        if (sm > (ll) n * m) {
            return 0;
        }
    }
    return sm <= (ll) n * m;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> m;
    REP (i, 0, n) {
        cin >> a[i];
    }
    REP (i, 0, n) {
        cin >> b[i];
    }
    ll lo = 0, hi = LINF, mid;
    while (lo < hi) {
        mid = lo + hi + 1 >> 1;
        if (isPos(mid)) {
            lo = mid;
        } else {
            hi = mid - 1;
        }
    }
    cout << lo << '\n';
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:88:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   88 |         mid = lo + hi + 1 >> 1;
      |               ~~~~~~~~^~~

Subtask #1
0 / 10.0

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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 46 ms 1488 KB Output is correct
10 Correct 32 ms 1108 KB Output is correct
11 Correct 26 ms 924 KB Output is correct
12 Correct 20 ms 804 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 31 ms 3744 KB Output is correct
22 Correct 112 ms 9148 KB Output is correct
23 Correct 102 ms 8460 KB Output is correct

Subtask #3
0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 46 ms 1488 KB Output is correct
10 Correct 32 ms 1108 KB Output is correct
11 Correct 26 ms 924 KB Output is correct
12 Correct 20 ms 804 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 31 ms 3744 KB Output is correct
22 Correct 112 ms 9148 KB Output is correct
23 Correct 102 ms 8460 KB Output is correct
24 Correct 31 ms 1572 KB Output is correct
25 Correct 73 ms 3964 KB Output is correct
26 Correct 14 ms 1108 KB Output is correct
27 Correct 118 ms 8412 KB Output is correct
28 Correct 98 ms 8452 KB Output is correct
29 Correct 114 ms 8452 KB Output is correct
30 Correct 131 ms 8468 KB Output is correct
31 Correct 208 ms 8396 KB Output is correct
32 Correct 121 ms 3832 KB Output is correct
33 Correct 261 ms 9144 KB Output is correct
34 Correct 115 ms 3944 KB Output is correct

Subtask #5
0 / 9.0

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