oj.uz

Submission #738013

# Submission time Handle Problem Language Result Execution time Memory
738013 2023-05-08T05:18:14 Z maomao90 Self Study (JOI22_ho_t2) C++17
0 / 100
 480 ms 10812 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 = 1000000000000000005ll;
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;
}

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:77:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         mid = lo + hi + 1 >> 1;
      |               ~~~~~~~~^~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 4 ms 428 KB Output is correct
11 Correct 278 ms 10812 KB Output is correct
12 Correct 277 ms 10808 KB Output is correct
13 Correct 177 ms 8828 KB Output is correct
14 Incorrect 480 ms 8728 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 280 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 88 ms 5452 KB Output is correct
10 Correct 61 ms 3812 KB Output is correct
11 Correct 46 ms 2948 KB Output is correct
12 Correct 38 ms 2420 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Incorrect 5 ms 424 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 4 ms 428 KB Output is correct
11 Correct 278 ms 10812 KB Output is correct
12 Correct 277 ms 10808 KB Output is correct
13 Correct 177 ms 8828 KB Output is correct
14 Incorrect 480 ms 8728 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 280 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 88 ms 5452 KB Output is correct
10 Correct 61 ms 3812 KB Output is correct
11 Correct 46 ms 2948 KB Output is correct
12 Correct 38 ms 2420 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Incorrect 5 ms 424 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 4 ms 428 KB Output is correct
11 Correct 278 ms 10812 KB Output is correct
12 Correct 277 ms 10808 KB Output is correct
13 Correct 177 ms 8828 KB Output is correct
14 Incorrect 480 ms 8728 KB Output isn't correct
15 Halted 0 ms 0 KB -