Submission #1086211

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1086211	2024-09-09T18:00:19 Z	I_am_Polish_Girl	Self Study (JOI22_ho_t2)	C++14	10 / 100	68 ms	11344 KB

Main

//#pragma target("arch=icelake-server")

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <stack> 
#include <queue>
#include <cmath>
#include <random>
#include <chrono>
#include <iomanip>
#include <bitset>

using namespace std;

#define int long long

typedef long long ll;
typedef long double ld;

int log_ = 11;
int inf = 1000000007;

long long mod = 1000000007;

int p = 499;

int NADIYA = 39;

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	
	int n, m;
	cin >> n >> m;

	vector <int> a(n);
	vector <int> b(n);

	for (int i = 0; i < n; i++)
		cin >> a[i];

	for (int i = 0; i < n; i++)
		cin >> b[i];

	for (int i = 0; i < n; i++)
	{
		a[i] = max(a[i], b[i]);
	}


	int l = 0;
	int r = inf;

	while (r - l > 1)
	{
		int mx = (l + r) / 2;


		int c = 0;

		for (int i = 0; i < n; i++)
		{
			if (mx <= a[i] * m)
			{
				int x = ((mx) / a[i]) + ((mx % a[i]) > 0);
				c += (m - x);

			}
			else
			{
				int x = mx - a[i] * m;

				int y = ((x) / b[i]) + ((x % b[i]) > 0);
				c -= y;
			}
		}

		if (c >= 0)
			l = mx;
		else
			r = mx;
	}

	cout << l;
}

/*5
1 2 1
2 3 1
2 4 1
1 5 4
*/

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 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	348 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	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	68 ms	5140 KB	Output is correct
12	Correct	61 ms	5144 KB	Output is correct
13	Correct	59 ms	4952 KB	Output is correct
14	Correct	51 ms	5140 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	42 ms	6264 KB	Output is correct
17	Correct	63 ms	11344 KB	Output is correct
18	Correct	63 ms	10836 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	42 ms	6264 KB	Output is correct
3	Correct	63 ms	11344 KB	Output is correct
4	Correct	63 ms	10836 KB	Output is correct
5	Incorrect	0 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	1 ms	344 KB	Output is correct
2	Correct	0 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	348 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	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	68 ms	5140 KB	Output is correct
12	Correct	61 ms	5144 KB	Output is correct
13	Correct	59 ms	4952 KB	Output is correct
14	Correct	51 ms	5140 KB	Output is correct
15	Incorrect	0 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	0 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	1 ms	344 KB	Output is correct
2	Correct	0 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	348 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	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	68 ms	5140 KB	Output is correct
12	Correct	61 ms	5144 KB	Output is correct
13	Correct	59 ms	4952 KB	Output is correct
14	Correct	51 ms	5140 KB	Output is correct
15	Incorrect	0 ms	348 KB	Output isn't correct
16	Halted	0 ms	0 KB	-