Submission #979172

# Submission time Handle Problem Language Result Execution time Memory
979172 2024-05-10T10:30:41 Z vjudge1 Self Study (JOI22_ho_t2) C++17
10 / 100
52 ms 8728 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 (m >= (mid - 1) / a[i] + 1) {
                        //s += ((a[i] * m - mid) / a[i]);
                        s += (m - ((mid - 1) / a[i] + 1));
                    } else {
                        //s -= (mid - a[i] * m) / a[i];
                        s -= (mid / a[i] - m);
                    }
                }
                if (s >= 0) {
                    l = mid;
                } else {
                    r = mid;
                }
            }
            cout << l << nl;
        }
    }
}
# Verdict Execution time Memory Grader output
1 Correct 0 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 464 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 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 50 ms 8316 KB Output is correct
12 Correct 52 ms 8460 KB Output is correct
13 Correct 37 ms 7396 KB Output is correct
14 Correct 37 ms 7508 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 25 ms 5980 KB Output is correct
17 Correct 51 ms 8728 KB Output is correct
18 Correct 52 ms 8404 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 25 ms 5980 KB Output is correct
3 Correct 51 ms 8728 KB Output is correct
4 Correct 52 ms 8404 KB Output is correct
5 Incorrect 0 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 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 464 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 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 50 ms 8316 KB Output is correct
12 Correct 52 ms 8460 KB Output is correct
13 Correct 37 ms 7396 KB Output is correct
14 Correct 37 ms 7508 KB Output is correct
15 Incorrect 0 ms 344 KB Output isn't correct
16 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 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 464 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 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 50 ms 8316 KB Output is correct
12 Correct 52 ms 8460 KB Output is correct
13 Correct 37 ms 7396 KB Output is correct
14 Correct 37 ms 7508 KB Output is correct
15 Incorrect 0 ms 344 KB Output isn't correct
16 Halted 0 ms 0 KB -