Submission #1186360

#	Time	Username	Problem	Language	Result	Execution time	Memory
1186360		countless	Wiring (IOI17_wiring)	C++20	100 / 100	22 ms	8116 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 = 1e9;
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;

	int a = 0, b = 0;
	vector<pair<ll, bool>> c(t+1);
	REP(i, 1, t+1) {
		if (b == m or (a != n and r[a] < s[b])) {
			c[i] = {r[a], false};
			a++;
		} else {
			c[i] = {s[b], true};
			b++;
		}
	}
	c[0] = {-INF, !c[1].se};

	vector<ll> d(t+1);
	REP(i, 1, t+1) {
		d[i] = d[i-1] + c[i].fi;
	}

	vector<ll> f(t+1);

	int e = 1;
	REP(i, 1, t+1) {
		// [i, j) is same component
		int j = i+1;
		while (j < t+1 and c[i].se == c[j].se)
			j++;
		
		// connect the previous component to our component's first element
		// take the min ofc
		REP(k, e, i) {
			f[k] = min(f[k], f[k-1] + c[i].fi - c[k].fi);
		}

		// connect our component to the previous component's last element
		ll g = 0, h = f[i-1];
		REP(k, i, j) {
			g += c[k].fi - c[i-1].fi;
			ll x = 2*i-2-k;
			if (x + 1 >= e) {
				// k-(i-1)
				h = min(h, f[x] + c[i-1].fi * (k-i+1) + d[x] - d[i-1]);
				// cerr << "k,x,i,g,h,i-1-x:" sp k sp x sp i sp g sp h sp i-1-x sp k-(i-1) << endl << "f,c,cx,dx:      " sp f[x] sp c[i-1].fi sp c[i-1].fi*(i-1-x) sp d[x] - d[i-1] << endl;
			}
			// cerr << "f:" sp k sp g+h << endl;
			f[k] = g + h;
		}

		e = i;
		i = j-1;
	}

	return f[t];
}

// 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: 7 / 7
• Subtask 2: 13 / 13
• Subtask 3: 10 / 10
• Subtask 4: 25 / 25
• Subtask 5: 45 / 45