Submission #636506

#	Time	Username	Problem	Language	Result	Execution time	Memory
636506		vovamr	Cipele (COCI18_cipele)	C++17	90 / 90	791 ms	7616 KiB

cipele

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

inline void solve() {
	int n, m;
	cin >> n >> m;
	ve<int> a(n), b(m);
	for (auto &i : a) cin >> i;
	for (auto &i : b) cin >> i;

	if (n > m) swap(n, m), swap(a, b);
	sort(all(a)), sort(all(b));

	auto ok = [&](int x) {
		map<int,int> mp;
		for (auto &i : b) ++mp[i];

		for (int i = 0; i < n; ++i) {
			auto it = mp.lower_bound(a[i] - x);
			if (it == mp.end() || it->fi > a[i] + x) return 0;

			int x = it->fi;

			--mp[x];
			if (!mp[x]) mp.erase(x);
		}
		return 1;
	};

	int l = 0, r = 1e9, mid, ans = 1e9;
	while (l <= r) {
		mid = l + r >> 1;
		if (ok(mid)) ans = mid, r = mid - 1;
		else l = mid + 1;
	}
	cout << ans;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Compilation message (stderr)

cipele.cpp: In function 'void solve()':
cipele.cpp:51:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |   mid = l + r >> 1;
      |         ~~^~~

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9