oj.uz

Submission #858540

# Submission time Handle Problem Language Result Execution time Memory
858540 2023-10-08T16:56:18 Z serifefedartar Cipele (COCI18_cipele) C++17
90 / 90
 34 ms 2896 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 998244353;
const ll LOGN = 18; 
const ll INF = 1e15;
const ll MAXN = 3e5 + 5;

int N, M;
vector<int> A, B;
bool check(int x) {
	int ptr = 0;
	for (int i = 0; i < N; i++) {
		if (ptr == M)
			return false;
		while (abs(A[i] - B[ptr]) > x) {
			ptr++;
			if (ptr == M)
				return false;
		}
		ptr++;
	}
	return true;
}

int main() {
	fast
	cin >> N >> M;

	A = vector<int>(N);
	B = vector<int>(M);
	for (int i = 0; i < N; i++)
		cin >> A[i];
	for (int i = 0; i < M; i++)
		cin >> B[i];
	sort(A.begin(), A.end());
	sort(B.begin(), B.end());

	if (N > M) {
		swap(N, M);
		swap(A, B);
	}

	int L = 0;
	int R = 1e9;
	int ans = -1;
	while (R >= L) {
		int mid = L + (R-L)/2;
		if (check(mid)) {
			ans = mid;
			R = mid - 1;
		} else
			L = mid + 1;
	}
	cout << ans << "\n";
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1116 KB Output is correct
2 Correct 31 ms 1252 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 1116 KB Output is correct
2 Correct 33 ms 2896 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 348 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 1108 KB Output is correct
2 Correct 19 ms 860 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 1116 KB Output is correct
2 Correct 14 ms 2136 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 856 KB Output is correct
2 Correct 29 ms 1116 KB Output is correct