Submission #1185938

#	Time	Username	Problem	Language	Result	Execution time	Memory
1185938		countless	Wiring (IOI17_wiring)	C++20	0 / 100	55 ms	122696 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-12;

#define endl "\n"
#define sp <<" "<<
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define dbg(x) cout << #x << " = " << x << endl
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())

struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}

	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
};

template <typename Key, typename Value>
using hash_map = unordered_map<Key, Value, custom_hash>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(a, b)(rng);
// shuffle(all(a), rng);

long long min_total_length(vector<int> r, vector<int> s) {
	int n = r.size(), m = s.size(), t = n + m;

	vector<bool> vis(1e9+1, false);
	set<int> a(all(r)), b(all(s));
	set<pair<int, int>> locs;
	REP(i, 0, n)
		locs.insert({r[i], 0});
	REP(i, 0, m)
		locs.insert({s[i], 1});

	int ans = 0;
	int lastR, lastB;
	for (auto &[ind, type] : locs) {
		if (!vis[ind]) {
			vis[ind] = true;

			int pair;

			if (type == 0) {
				lastR = ind;
				auto it = lower_bound(all(b), ind);

				if (it == b.end()) {
					pair = lastB;
				} else {
					pair = *it;
					b.erase(it);
				}
			}

			else {
				lastB = ind;
				auto it = lower_bound(all(a), ind);

				if (it == a.end()) {
					pair = lastR;
				} else {
					pair = *it;
					a.erase(it);
				}
			}
			
			vis[pair] = true;

			// cerr << ind sp pair << endl;

			ans += abs(pair - ind);
		}
	}

	return ans;
}

// signed main() {
// 	int n, m; cin >> n >> m;
// 	vector<int> a(n), b(m);
// 	REP(i, 0, n)
// 		cin >> a[i];
// 	REP(i, 0, m)
// 		cin >> b[i];

// 	cout << min_total_length(a, b);
// }

• Subtask 1: 0 / 7
• Subtask 2: 0 / 13
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45