oj.uz

Submission #1086215

# Submission time Handle Problem Language Result Execution time Memory
1086215 2024-09-09T18:05:22 Z I_am_Polish_Girl Self Study (JOI22_ho_t2) C++17
62 / 100
 86 ms 10836 KB 
//#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;

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

	r+= 10;

	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 0 ms 604 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 616 KB Output is correct
11 Correct 66 ms 10008 KB Output is correct
12 Correct 64 ms 9808 KB Output is correct
13 Correct 53 ms 8016 KB Output is correct
14 Correct 56 ms 8304 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 43 ms 6300 KB Output is correct
17 Correct 65 ms 10324 KB Output is correct
18 Correct 68 ms 9872 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 43 ms 6300 KB Output is correct
3 Correct 65 ms 10324 KB Output is correct
4 Correct 68 ms 9872 KB Output is correct
5 Correct 1 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 456 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 34 ms 5196 KB Output is correct
14 Correct 23 ms 3740 KB Output is correct
15 Correct 17 ms 2904 KB Output is correct
16 Correct 13 ms 2428 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 408 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 456 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 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 616 KB Output is correct
11 Correct 66 ms 10008 KB Output is correct
12 Correct 64 ms 9808 KB Output is correct
13 Correct 53 ms 8016 KB Output is correct
14 Correct 56 ms 8304 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 456 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 34 ms 5196 KB Output is correct
24 Correct 23 ms 3740 KB Output is correct
25 Correct 17 ms 2904 KB Output is correct
26 Correct 13 ms 2428 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 408 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 456 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 43 ms 6300 KB Output is correct
36 Correct 65 ms 10324 KB Output is correct
37 Correct 68 ms 9872 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 636 KB Output is correct
46 Correct 2 ms 604 KB Output is correct
47 Correct 0 ms 468 KB Output is correct
48 Correct 11 ms 2136 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 35 ms 5460 KB Output is correct
56 Correct 18 ms 3160 KB Output is correct
57 Correct 19 ms 3164 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 34 ms 5196 KB Output is correct
10 Correct 23 ms 3740 KB Output is correct
11 Correct 17 ms 2904 KB Output is correct
12 Correct 13 ms 2428 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 408 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 43 ms 6300 KB Output is correct
22 Correct 65 ms 10324 KB Output is correct
23 Correct 68 ms 9872 KB Output is correct
24 Correct 13 ms 1884 KB Output is correct
25 Correct 34 ms 4956 KB Output is correct
26 Correct 7 ms 1372 KB Output is correct
27 Correct 66 ms 10580 KB Output is correct
28 Correct 71 ms 10632 KB Output is correct
29 Correct 66 ms 10628 KB Output is correct
30 Correct 72 ms 10576 KB Output is correct
31 Correct 86 ms 10580 KB Output is correct
32 Correct 42 ms 6232 KB Output is correct
33 Correct 86 ms 10836 KB Output is correct
34 Incorrect 73 ms 6316 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 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 616 KB Output is correct
11 Correct 66 ms 10008 KB Output is correct
12 Correct 64 ms 9808 KB Output is correct
13 Correct 53 ms 8016 KB Output is correct
14 Correct 56 ms 8304 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 456 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 34 ms 5196 KB Output is correct
24 Correct 23 ms 3740 KB Output is correct
25 Correct 17 ms 2904 KB Output is correct
26 Correct 13 ms 2428 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 408 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 456 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 636 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 0 ms 468 KB Output is correct
44 Correct 11 ms 2136 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 35 ms 5460 KB Output is correct
52 Correct 18 ms 3160 KB Output is correct
53 Correct 19 ms 3164 KB Output is correct
54 Correct 13 ms 1884 KB Output is correct
55 Correct 34 ms 4956 KB Output is correct
56 Correct 7 ms 1372 KB Output is correct
57 Correct 66 ms 10580 KB Output is correct
58 Correct 71 ms 10632 KB Output is correct
59 Correct 66 ms 10628 KB Output is correct
60 Correct 72 ms 10576 KB Output is correct
61 Correct 86 ms 10580 KB Output is correct
62 Correct 42 ms 6232 KB Output is correct
63 Correct 86 ms 10836 KB Output is correct
64 Incorrect 73 ms 6316 KB Output isn't correct
65 Halted 0 ms 0 KB -