oj.uz

Submission #886573

# Submission time Handle Problem Language Result Execution time Memory
886573 2023-12-12T10:32:50 Z dubabuba Self Study (JOI22_ho_t2) C++14
25 / 100
 324 ms 7464 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 = 2e18 + 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 4444 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 4444 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 4536 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 141 ms 6744 KB Output is correct
10 Correct 105 ms 6568 KB Output is correct
11 Correct 67 ms 6752 KB Output is correct
12 Correct 53 ms 6748 KB Output is correct
13 Correct 1 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 4544 KB Output is correct
19 Correct 6 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 220 ms 7464 KB Output is correct
22 Correct 286 ms 7332 KB Output is correct
23 Correct 270 ms 7276 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 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 4444 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 4536 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 141 ms 6744 KB Output is correct
10 Correct 105 ms 6568 KB Output is correct
11 Correct 67 ms 6752 KB Output is correct
12 Correct 53 ms 6748 KB Output is correct
13 Correct 1 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 4544 KB Output is correct
19 Correct 6 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 220 ms 7464 KB Output is correct
22 Correct 286 ms 7332 KB Output is correct
23 Correct 270 ms 7276 KB Output is correct
24 Correct 57 ms 6752 KB Output is correct
25 Correct 130 ms 6572 KB Output is correct
26 Correct 30 ms 6744 KB Output is correct
27 Correct 263 ms 7328 KB Output is correct
28 Correct 263 ms 7276 KB Output is correct
29 Correct 271 ms 7332 KB Output is correct
30 Correct 278 ms 7456 KB Output is correct
31 Correct 324 ms 7456 KB Output is correct
32 Correct 225 ms 7452 KB Output is correct
33 Incorrect 297 ms 7328 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 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -