oj.uz

Submission #886574

# Submission time Handle Problem Language Result Execution time Memory
886574 2023-12-12T10:33:15 Z dubabuba Self Study (JOI22_ho_t2) C++14
25 / 100
 317 ms 7504 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
typedef long long ll;
const int mxn = 3e5 + 10;
const int mxm = 1e9 + 10;
const int inf = 3e18 + 10;
ll a[mxn], b[mxn], x[mxn];
int n, m;

void build() {
	for(int i = 0; i < n; i++) {
		x[i] = a[i] * m;
	}
}

ll sus(ll s, ll a) {
	return (s + a - 1) / a;
}

bool can(ll MID) {
	ll MIN = 0, MAX = 0;
	for(int i = 0; i < n; i++) {
		if(x[i] < MID) MIN += (MID - x[i] + b[i] - 1) / b[i];
		if(x[i] > MID) MAX += min(m, (x[i] - MID) / a[i]);
		MIN = min(MIN, inf);
		MAX = min(MAX, inf);
	}
	return MIN <= MAX;
}

signed main() {
	cin >> n >> m;
	for(int i = 0; i < n; i++)
		cin >> a[i];
	for(int j = 0; j < n; j++)
		cin >> b[j];

	build();

	ll L = 0, R = 1e18 + 10;
	while(R - L > 1) {
		ll M = (L + R) / 2;
		if(can(M)) L = M;
		else R = M;
	}

	cout << L << '\n';
	return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 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 131 ms 6752 KB Output is correct
10 Correct 87 ms 6568 KB Output is correct
11 Correct 65 ms 6740 KB Output is correct
12 Correct 54 ms 6740 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 4 ms 4444 KB Output is correct
19 Correct 5 ms 4544 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 214 ms 7288 KB Output is correct
22 Correct 317 ms 7248 KB Output is correct
23 Correct 288 ms 7252 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4440 KB Output isn't correct
2 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 4440 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 131 ms 6752 KB Output is correct
10 Correct 87 ms 6568 KB Output is correct
11 Correct 65 ms 6740 KB Output is correct
12 Correct 54 ms 6740 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 4 ms 4444 KB Output is correct
19 Correct 5 ms 4544 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 214 ms 7288 KB Output is correct
22 Correct 317 ms 7248 KB Output is correct
23 Correct 288 ms 7252 KB Output is correct
24 Correct 49 ms 6840 KB Output is correct
25 Correct 128 ms 6736 KB Output is correct
26 Correct 29 ms 6744 KB Output is correct
27 Correct 256 ms 7460 KB Output is correct
28 Correct 262 ms 7344 KB Output is correct
29 Correct 271 ms 7456 KB Output is correct
30 Correct 299 ms 7460 KB Output is correct
31 Correct 316 ms 7456 KB Output is correct
32 Correct 215 ms 7460 KB Output is correct
33 Incorrect 274 ms 7504 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

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