oj.uz

Submission #1085910

# Submission time Handle Problem Language Result Execution time Memory
1085910 2024-09-09T03:52:42 Z RiverFlow Self Study (JOI22_ho_t2) C++14
100 / 100
 137 ms 9044 KB 
#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)3e5 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

int a[N], b[N];

void main_code() {
    int n, m; cin >> n >> m;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 1; i <= n; ++i) cin >> b[i];
    long long lb = 1, rb = (long long)1e18, ans = -1;
    while (lb <= rb) {
        long long mid = (lb + rb) >> 1;
        long long r = 0;

        FOR(i, 1, n) {
            r += m;
            if (a[i] <= b[i]) {
                r -= (mid / b[i]) + (mid % b[i] != 0);
            } else {
                // a[i] > b[i]
                if (1LL * a[i] * m >= mid) {
                    r -= (mid / a[i]) + (mid % a[i] != 0);
                } else {
                    r -= m;
                    long long tmp = mid - 1LL * a[i] * m;
                    r -= (tmp / b[i]) + (tmp % b[i] != 0);
                }
            }
            if (r + 1LL * (n - i) * m < 0)
                break ;
        }

        if (r >= 0) {
            ans = mid,
            lb = mid + 1;
        } else {
            rb = mid - 1;
        }
    }
    cout << ans;
}


/*     Let the river flows naturally     */

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 84 ms 8528 KB Output is correct
12 Correct 86 ms 8532 KB Output is correct
13 Correct 50 ms 6484 KB Output is correct
14 Correct 42 ms 6484 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 28 ms 3844 KB Output is correct
17 Correct 63 ms 8996 KB Output is correct
18 Correct 60 ms 8528 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 28 ms 3844 KB Output is correct
3 Correct 63 ms 8996 KB Output is correct
4 Correct 60 ms 8528 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 30 ms 4328 KB Output is correct
14 Correct 22 ms 3160 KB Output is correct
15 Correct 17 ms 2380 KB Output is correct
16 Correct 12 ms 1884 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 84 ms 8528 KB Output is correct
12 Correct 86 ms 8532 KB Output is correct
13 Correct 50 ms 6484 KB Output is correct
14 Correct 42 ms 6484 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 30 ms 4328 KB Output is correct
24 Correct 22 ms 3160 KB Output is correct
25 Correct 17 ms 2380 KB Output is correct
26 Correct 12 ms 1884 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 28 ms 3844 KB Output is correct
36 Correct 63 ms 8996 KB Output is correct
37 Correct 60 ms 8528 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 464 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 2 ms 476 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 15 ms 1628 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 464 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 51 ms 4324 KB Output is correct
56 Correct 17 ms 2396 KB Output is correct
57 Correct 15 ms 2392 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 30 ms 4328 KB Output is correct
10 Correct 22 ms 3160 KB Output is correct
11 Correct 17 ms 2380 KB Output is correct
12 Correct 12 ms 1884 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 28 ms 3844 KB Output is correct
22 Correct 63 ms 8996 KB Output is correct
23 Correct 60 ms 8528 KB Output is correct
24 Correct 13 ms 1628 KB Output is correct
25 Correct 34 ms 4100 KB Output is correct
26 Correct 7 ms 1116 KB Output is correct
27 Correct 67 ms 8360 KB Output is correct
28 Correct 60 ms 8536 KB Output is correct
29 Correct 63 ms 8580 KB Output is correct
30 Correct 75 ms 8524 KB Output is correct
31 Correct 85 ms 8592 KB Output is correct
32 Correct 44 ms 3956 KB Output is correct
33 Correct 91 ms 9044 KB Output is correct
34 Correct 46 ms 3932 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 84 ms 8528 KB Output is correct
12 Correct 86 ms 8532 KB Output is correct
13 Correct 50 ms 6484 KB Output is correct
14 Correct 42 ms 6484 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 30 ms 4328 KB Output is correct
24 Correct 22 ms 3160 KB Output is correct
25 Correct 17 ms 2380 KB Output is correct
26 Correct 12 ms 1884 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 464 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 2 ms 476 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 15 ms 1628 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 464 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 51 ms 4324 KB Output is correct
52 Correct 17 ms 2396 KB Output is correct
53 Correct 15 ms 2392 KB Output is correct
54 Correct 13 ms 1628 KB Output is correct
55 Correct 34 ms 4100 KB Output is correct
56 Correct 7 ms 1116 KB Output is correct
57 Correct 67 ms 8360 KB Output is correct
58 Correct 60 ms 8536 KB Output is correct
59 Correct 63 ms 8580 KB Output is correct
60 Correct 75 ms 8524 KB Output is correct
61 Correct 85 ms 8592 KB Output is correct
62 Correct 44 ms 3956 KB Output is correct
63 Correct 91 ms 9044 KB Output is correct
64 Correct 46 ms 3932 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 28 ms 3844 KB Output is correct
67 Correct 63 ms 8996 KB Output is correct
68 Correct 60 ms 8528 KB Output is correct
69 Correct 12 ms 1112 KB Output is correct
70 Correct 2 ms 692 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 19 ms 1608 KB Output is correct
73 Correct 3 ms 604 KB Output is correct
74 Correct 1 ms 480 KB Output is correct
75 Correct 91 ms 8444 KB Output is correct
76 Correct 92 ms 8448 KB Output is correct
77 Correct 100 ms 8348 KB Output is correct
78 Correct 114 ms 8532 KB Output is correct
79 Correct 137 ms 8532 KB Output is correct
80 Correct 132 ms 8372 KB Output is correct
81 Correct 76 ms 6400 KB Output is correct
82 Correct 74 ms 6608 KB Output is correct