Submission #979161

# Submission time Handle Problem Language Result Execution time Memory
979161 2024-05-10T10:16:50 Z vjudge1 Self Study (JOI22_ho_t2) C++17
35 / 100
497 ms 11144 KB
#include<bits/stdc++.h>
#define ft first
#define sd second
#define pb push_back
#define nl "\n"
#define int ll
typedef long long ll;
typedef long double ld;
using namespace std;

const int mod = 1e9 + 7;
const int N = 2000;

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    while(T--) {
        int n, m;
        cin >> n >> m;
        int a[n + 1], b[n + 1], mn = 1e18, mx = 0;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
            mn = min( mn, a[i] * m);
            mx = max( mx, a[i] * m);
        }
        for (int i = 1; i <= n; i++) {
            cin >> b[i];
        }
        if (m == 1) {
            int l = 1e18;
            for (int i = 1; i <= n; i++) {
                l = min( l, max(a[i], b[i]));
            }
            cout << l << nl;
        } else {
            int l = mn, r = mx;
            while(l + 1 < r) {
                int mid = (l + r) / 2;
                int s = 0;
                for (int i = 1; i <= n; i++) {
                    if (a[i] * m >= mid) {
                        s += (a[i] * m - mid) / a[i];
                    } else {
                        s -= (mid - a[i] * m) / a[i];
                        if (mid % a[i] != 0) {
                            s--;
                        }
                    }
                }
                if (s >= 0) {
                    l = mid;
                } else {
                    r = mid;
                }
            }
            cout << l << nl;
        }
    }
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 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 1 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 604 KB Output is correct
11 Correct 58 ms 11144 KB Output is correct
12 Correct 61 ms 11056 KB Output is correct
13 Correct 44 ms 8696 KB Output is correct
14 Correct 38 ms 8796 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 31 ms 4956 KB Output is correct
17 Correct 61 ms 4956 KB Output is correct
18 Correct 52 ms 4956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 31 ms 4956 KB Output is correct
3 Correct 61 ms 4956 KB Output is correct
4 Correct 52 ms 4956 KB Output is correct
5 Correct 1 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 344 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 50 ms 2652 KB Output is correct
14 Correct 31 ms 1884 KB Output is correct
15 Correct 26 ms 1372 KB Output is correct
16 Correct 21 ms 1372 KB Output is correct
17 Correct 1 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 1 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 2 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 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 1 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 604 KB Output is correct
11 Correct 58 ms 11144 KB Output is correct
12 Correct 61 ms 11056 KB Output is correct
13 Correct 44 ms 8696 KB Output is correct
14 Correct 38 ms 8796 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 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 344 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 50 ms 2652 KB Output is correct
24 Correct 31 ms 1884 KB Output is correct
25 Correct 26 ms 1372 KB Output is correct
26 Correct 21 ms 1372 KB Output is correct
27 Correct 1 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 1 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 2 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 31 ms 4956 KB Output is correct
36 Correct 61 ms 4956 KB Output is correct
37 Correct 52 ms 4956 KB Output is correct
38 Incorrect 0 ms 348 KB Output isn't correct
39 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 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 344 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 50 ms 2652 KB Output is correct
10 Correct 31 ms 1884 KB Output is correct
11 Correct 26 ms 1372 KB Output is correct
12 Correct 21 ms 1372 KB Output is correct
13 Correct 1 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 1 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 2 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 31 ms 4956 KB Output is correct
22 Correct 61 ms 4956 KB Output is correct
23 Correct 52 ms 4956 KB Output is correct
24 Correct 30 ms 1176 KB Output is correct
25 Correct 72 ms 2392 KB Output is correct
26 Correct 13 ms 856 KB Output is correct
27 Correct 88 ms 4956 KB Output is correct
28 Correct 91 ms 4956 KB Output is correct
29 Correct 94 ms 4956 KB Output is correct
30 Correct 122 ms 4956 KB Output is correct
31 Correct 210 ms 5124 KB Output is correct
32 Correct 25 ms 4956 KB Output is correct
33 Correct 48 ms 5120 KB Output is correct
34 Incorrect 497 ms 5200 KB Output isn't correct
35 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 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 1 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 604 KB Output is correct
11 Correct 58 ms 11144 KB Output is correct
12 Correct 61 ms 11056 KB Output is correct
13 Correct 44 ms 8696 KB Output is correct
14 Correct 38 ms 8796 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 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 344 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 50 ms 2652 KB Output is correct
24 Correct 31 ms 1884 KB Output is correct
25 Correct 26 ms 1372 KB Output is correct
26 Correct 21 ms 1372 KB Output is correct
27 Correct 1 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 1 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 2 ms 348 KB Output is correct
34 Incorrect 0 ms 348 KB Output isn't correct
35 Halted 0 ms 0 KB -