Submission #783901

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
783901	2023-07-15T12:05:30 Z	borisAngelov	Self Study (JOI22_ho_t2)	C++17	0 / 100	305 ms	10700 KB

Main

#include <bits/stdc++.h>

using namespace std;

const int maxn = 300005;

int n;
long long m;

long long a[maxn];
long long b[maxn];

long long round_up(long long x, long long y)
{
    if (x % y == 0)
    {
        return x / y;
    }

    return x / y + 1;
}

bool check(long long min_score)
{
    long long free_lections = 0;

    for (int i = 1; i <= n; ++i)
    {
        if (b[i] >= a[i])
        {
            long long curr = round_up(min_score, b[i]);
            free_lections += (m - curr);
        }
        else
        {
            long long curr_lections = round_up(min_score, a[i]);

            if (curr_lections <= m)
            {
                free_lections += (m - curr_lections);
            }
            else
            {
                long long add_lections = round_up(min_score - m * a[i], b[i]);
                free_lections -= add_lections;
            }
        }
    }

    return free_lections >= 0;
}

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    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 l = 0;
    long long r = 1e15;

    while (l <= r)
    {
        long long mid = (l + r) / 2;

        if (check(mid) == false)
        {
            r = mid - 1;
        }
        else
        {
            l = mid + 1;
        }
    }

    cout << r << endl;

    return 0;
}

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	3 ms	468 KB	Output is correct
11	Correct	154 ms	10700 KB	Output is correct
12	Correct	143 ms	10628 KB	Output is correct
13	Correct	109 ms	8776 KB	Output is correct
14	Incorrect	305 ms	8764 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	324 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	324 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	61 ms	5560 KB	Output is correct
10	Correct	41 ms	3796 KB	Output is correct
11	Correct	32 ms	2888 KB	Output is correct
12	Correct	26 ms	2424 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	3 ms	340 KB	Output is correct
19	Correct	3 ms	512 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Incorrect	196 ms	6172 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	3 ms	468 KB	Output is correct
11	Correct	154 ms	10700 KB	Output is correct
12	Correct	143 ms	10628 KB	Output is correct
13	Correct	109 ms	8776 KB	Output is correct
14	Incorrect	305 ms	8764 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	324 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	324 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	61 ms	5560 KB	Output is correct
10	Correct	41 ms	3796 KB	Output is correct
11	Correct	32 ms	2888 KB	Output is correct
12	Correct	26 ms	2424 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	3 ms	340 KB	Output is correct
19	Correct	3 ms	512 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Incorrect	196 ms	6172 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	3 ms	468 KB	Output is correct
11	Correct	154 ms	10700 KB	Output is correct
12	Correct	143 ms	10628 KB	Output is correct
13	Correct	109 ms	8776 KB	Output is correct
14	Incorrect	305 ms	8764 KB	Output isn't correct
15	Halted	0 ms	0 KB	-