oj.uz

Submission #979176

# Submission time Handle Problem Language Result Execution time Memory
979176 2024-05-10T10:34:11 Z vjudge1 Self Study (JOI22_ho_t2) C++17
10 / 100
 58 ms 8928 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 + 1;
            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 / a[i]);
                    } else {
                        //s -= (mid - a[i] * m) / a[i];
                        s -= ((mid - 1) / a[i] + 1 - m);
                    }
                }
                if (s >= 0) {
                    l = mid;
                } else {
                    r = mid;
                }
            }
            cout << l << nl;
        }
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 500 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 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 54 ms 8652 KB Output is correct
12 Correct 58 ms 8544 KB Output is correct
13 Correct 39 ms 7804 KB Output is correct
14 Correct 47 ms 7764 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 29 ms 6144 KB Output is correct
17 Correct 51 ms 8928 KB Output is correct
18 Correct 51 ms 8496 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 29 ms 6144 KB Output is correct
3 Correct 51 ms 8928 KB Output is correct
4 Correct 51 ms 8496 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 500 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 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 54 ms 8652 KB Output is correct
12 Correct 58 ms 8544 KB Output is correct
13 Correct 39 ms 7804 KB Output is correct
14 Correct 47 ms 7764 KB Output is correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 500 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 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 54 ms 8652 KB Output is correct
12 Correct 58 ms 8544 KB Output is correct
13 Correct 39 ms 7804 KB Output is correct
14 Correct 47 ms 7764 KB Output is correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -