Submission #914855

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
914855	2024-01-22T18:52:07 Z	andrei_iorgulescu	Self Study (JOI22_ho_t2)	C++14	0 / 100	300 ms	13168 KB

Main

#include <bits/stdc++.h>

using namespace std;

#define int long long

int n,m,a[300005],b[300005],nev[300005];

bool pot(int x)
{
    int extra = 0;
    for (int i = 1; i <= n; i++)
    {
        nev[i] = x;
        if (a[i] <= b[i])
            extra += m;
        else
        {
            if (x <= m * a[i])
            {
                extra += m - ((x - 1) / a[i] + 1);
                nev[i] = 0;
            }
            else
            {
                nev[i] = x - m * a[i];
            }
        }
    }
    for (int i = 1; i <= n; i++)
        if (nev[i] != 0)
            extra -= ((nev[i] - 1) / b[i] + 1);
    if (extra >= 0)
        return true;
    return false;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
        cin >> b[i];
    int st = 0,pas = 1ll << 60;
    while (pas != 0)
    {
        if (pot(st + pas) == true)
            st += pas;
        pas /= 2;
    }
    cout << st;
    return 0;
}

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	4 ms	4444 KB	Output is correct
11	Correct	236 ms	13168 KB	Output is correct
12	Correct	235 ms	13040 KB	Output is correct
13	Correct	145 ms	11088 KB	Output is correct
14	Incorrect	300 ms	11088 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	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4564 KB	Output is correct
7	Correct	2 ms	4692 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	80 ms	9532 KB	Output is correct
10	Correct	53 ms	8708 KB	Output is correct
11	Correct	40 ms	8228 KB	Output is correct
12	Correct	32 ms	7768 KB	Output is correct
13	Correct	2 ms	4444 KB	Output is correct
14	Correct	1 ms	4696 KB	Output is correct
15	Correct	1 ms	4440 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	4440 KB	Output is correct
18	Incorrect	5 ms	4444 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	4 ms	4444 KB	Output is correct
11	Correct	236 ms	13168 KB	Output is correct
12	Correct	235 ms	13040 KB	Output is correct
13	Correct	145 ms	11088 KB	Output is correct
14	Incorrect	300 ms	11088 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	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4564 KB	Output is correct
7	Correct	2 ms	4692 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	80 ms	9532 KB	Output is correct
10	Correct	53 ms	8708 KB	Output is correct
11	Correct	40 ms	8228 KB	Output is correct
12	Correct	32 ms	7768 KB	Output is correct
13	Correct	2 ms	4444 KB	Output is correct
14	Correct	1 ms	4696 KB	Output is correct
15	Correct	1 ms	4440 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	4440 KB	Output is correct
18	Incorrect	5 ms	4444 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	4 ms	4444 KB	Output is correct
11	Correct	236 ms	13168 KB	Output is correct
12	Correct	235 ms	13040 KB	Output is correct
13	Correct	145 ms	11088 KB	Output is correct
14	Incorrect	300 ms	11088 KB	Output isn't correct
15	Halted	0 ms	0 KB	-