Submission #103417

#	Time	Username	Problem	Language	Result	Execution time	Memory
103417		RockyB	Wiring (IOI17_wiring)	C++17	30 / 100	560 ms	11384 KiB

wiring

/// In The Name Of God
 
#include <bits/stdc++.h>
 
#define f first
#define s second
 
#define pb push_back
#define pp pop_back
#define mp make_pair
 
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
 
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
 
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
 
#define nl '\n'
#define ioi exit(0);
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
const int N = (int)4e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
 
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
 
using namespace std;
 
int sz;
pair <ll, int> t[N];
ll dp[N], s[N];


int prv[N], nxt[N];
ll get(int l, int r) {
	if (nxt[l] == -1) assert(0);
	int n, m;
	int id = nxt[l] - 1;
	n = id - l + 1;
	m = r - id;

	ll res = 0;
	res += t[id].f * (id - l + 1) - (s[id] - s[l - 1]);
	res += (s[r] - s[id]) - t[id + 1].f * (r - id);
	res += max(n, m) * (t[id + 1].f - t[id].f);
	return res;
}
int calc(int l, int r) {
	set <int> st;
	rep(i, l, r) st.insert(t[i].f);
	return sz(st);
}
ll min_total_length(vector <int> _r, vector <int> _b) {
	for (auto it : _r) t[++sz] = {it, 0};
	for (auto it : _b) t[++sz] = {it, 1};

	sort (t + 1, t + 1 + sz);
	rep(i, 1, sz) {
		s[i] = s[i - 1] + t[i].f;
	}	
	{ /// calc next
		int pos[2] = {-1, -1};
		per(i, sz, 1) {
			int b = t[i].s;
			nxt[i] = pos[b ^ 1];
			pos[b] = i;
		}
	}
	{ /// calc prev
		int pos[2] = {-1, -1};
		rep(i, 1, sz) {
			int b = t[i].s;
			prv[i] = pos[b ^ 1];
			pos[b] = i;
		}
	}

	memset(dp, 0x3f, sizeof(dp));
	dp[0] = 0;

	rep(i, 1, sz) {
		if (prv[i] != -1) {
			int r = prv[i], l = prv[r];
			if (l == -1) l = 1;
			rep(j, l, min(r, l + 250)) {
				dp[i] = min(dp[i], min(dp[j], dp[j - 1]) + get(j, i));
			}
			per(j, r, max(r - 250, l)) {
				dp[i] = min(dp[i], min(dp[j], dp[j - 1]) + get(j, i));
			}
		}
	}
	return dp[sz];
}

/*
	get(l, r) = 
	m -> t[m].s != t[m + 1].s
	rep(i, m + 1, r) sum += t[i].f - t[m + 1].f
	rep(i, l, m) sum += t[m].f - t[i].f
	sum += (t[m + 1].f - t[m].f) * max(m - l + 1, r - m)

	get(l, r) = s[r] - s[m] - r * t[m + 1].f + t[m + 1].f * m + t[m].f * m - t[m].f * l + t[m].f - s[m] + s[l - 1]
	
	-l * t[m].f + s[l - 1] + b[l]

	+ (t[m + 1].f - t[m].f) * max(m - l + 1, r - m)



*/

 
#ifdef IOI2018
 
namespace read {
 
	void read() {
		int n, m;
		assert(2 == scanf("%d %d", &n, &m));
 
		vector<int> r(n), b(m);
		for(int i = 0; i < n; i++)
			assert(1 == scanf("%d", &r[i]));
		for(int i = 0; i < m; i++)
			assert(1 == scanf("%d", &b[i]));
 
		long long res = min_total_length(r, b);
		printf("%lld\n", res);
		ioi
	}
}
 
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
		//freopen ("slow.out", "w", stdout);
	#endif
	read :: read();
	ioi
}
 
#endif

//// 000 111  111111111

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