oj.uz

Submission #103326

# Submission time Handle Problem Language Result Execution time Memory
103326 2019-03-29T18:38:07 Z RockyB Wiring (IOI17_wiring) C++17
10 / 100
 400 ms 7928 KB 
/// 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 n, m;
int a[N], b[N];
 
 
namespace s2 {
	ll get() {
		ll res = 0;
		int mn = min(n, m);
		rep(i, 1, mn) res += b[i] - a[i];
		if (n > m) {
			rep(i, mn + 1, n) res += b[1] - a[i];
		}
		if (n < m) {
			rep(i, mn + 1, m) res += b[i] - a[n];
		}
		return res;
	}
}
namespace s1 {
	int dp[222][222];
	int calc(int v1 = 1, int v2 = 1) {
		if (v1 > n && v2 > m) return 0; 
		if (~dp[v1][v2]) return dp[v1][v2];
		int res = inf;
		/// 1 & 1
		if (v1 <= n && v2 <= m) res = min(res, calc(v1 + 1, v2 + 1));
		/// 1 & 0
		if (v1 <= n) res = min(res, calc(v1 + 1, v2));
		/// 0 & 1
		if (v2 <= m) res = min(res, calc(v1, v2 + 1));
		return dp[v1][v2] = res + abs(b[min(m, v2)] - a[min(n, v1)]);
	}
	ll get() {
		memset(dp, -1, sizeof(dp));
		return calc();
	}
}
namespace s3 {
	pair <int, int> p[N];

	ll dp[1 << 7], dp2[1 << 7];
	/*
	ll dp[N][1 << 7], nxt[N][1 << 7];
	ll calc(int v, int mask) {
		if (v > n + m) {

			//cout << mask << nl;
			return 0;
		}
		//if (~dp[v][mask]) return dp[v][mask];


		if (mask & 1) return dp[v][mask] = calc(v + 1, mask >> 1);
		
		ll res = linf;
		rep(i, max(1, v - 7), v - 1) {
			if (p[i].s != p[v].s) res = min(res, calc(v + 1, mask >> 1) + p[v].f - p[i].f);
		}
		rep(i, v + 1, min(n + m, v + 7)) {
			if (p[i].s != p[v].s) res = min(res, calc(v + 1, (mask >> 1) | (1 << (i - v - 1))) + p[i].f - p[v].f);
		}

		return dp[v][mask] = res;
	}*/

	int prv[N];
	void upd(ll &x, ll y) {
		if (x > y) x = y;
	}
	ll get() {
		rep(i, 1, n) p[i] = {a[i], 0};
		rep(i, 1, m) p[n + i] = {b[i], 1};
		sort (p + 1, p + n + m + 1);
		memset(prv, -1, sizeof(prv));
		int last[2] = {-1, -1};
		rep(i, 1, n + m) {
			if (last[p[i].s ^ 1] != -1) prv[i] = p[i].f - p[last[p[i].s ^ 1]].f;
			last[p[i].s] = i;
		}

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

		rep(i, 1, n + m) {
			memset(dp2, 0x3f, sizeof(dp2));
			rep(mask, 0, (1 << 7) - 1) {
				if (dp[mask] == linf) continue;
				if (mask & 1) upd(dp2[mask >> 1], dp[mask]);
				else {
					if (prv[i] != -1) upd(dp2[mask >> 1], dp[mask] + prv[i]);
					int to = min(n + m - i, 6);
					rep(j, 1, to) {
						if (p[i].s != p[i + j].s) {
							upd(dp2[(mask >> 1) | (1 << (j - 1))], dp[mask] + p[i + j].f - p[i].f);
						}
					}
					//if (nxt[i].s != -1) upd(dp2[(mask >> 1) | (1 << nxt[i].s)], dp[mask] + nxt[i].f);
				}
			}
			rep(mask, 0, (1 << 7) - 1) {
				dp[mask] = dp2[mask];
			}
		}
		return dp[0];
	}
}
	
ll min_total_length(vector <int> _r, vector <int> _b) {
	n = sz(_r), m = sz(_b);
	rep(i, 1, n) a[i] = _r[i - 1];
	rep(i, 1, m) b[i] = _b[i - 1];
 
	//if (a[n] < b[1]) return s2 :: get();
	//if (max(n, m) <= 200) return s1 :: get();
	return s3 :: get();
}
 
#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);
	#endif
	read :: read();
	ioi
}
 
#endif

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1920 KB Output is correct
2 Incorrect 4 ms 1920 KB 3rd lines differ - on the 1st token, expected: '14340', found: '4557430888798830399'
3 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1920 KB 3rd lines differ - on the 1st token, expected: '904', found: '4557430888798830399'
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1920 KB Output is correct
2 Correct 4 ms 1920 KB Output is correct
3 Correct 289 ms 5908 KB Output is correct
4 Correct 400 ms 5880 KB Output is correct
5 Correct 4 ms 1920 KB Output is correct
6 Correct 3 ms 1920 KB Output is correct
7 Correct 4 ms 1920 KB Output is correct
8 Correct 4 ms 1920 KB Output is correct
9 Correct 3 ms 1920 KB Output is correct
10 Correct 3 ms 1920 KB Output is correct
11 Correct 4 ms 1920 KB Output is correct
12 Correct 4 ms 1920 KB Output is correct
13 Correct 3 ms 1920 KB Output is correct
14 Correct 4 ms 1920 KB Output is correct
15 Correct 5 ms 1920 KB Output is correct
16 Correct 4 ms 1920 KB Output is correct
17 Correct 3 ms 1920 KB Output is correct
18 Correct 319 ms 5752 KB Output is correct
19 Correct 326 ms 5880 KB Output is correct
20 Correct 343 ms 5752 KB Output is correct
21 Correct 323 ms 7928 KB Output is correct
22 Correct 324 ms 7800 KB Output is correct
23 Correct 299 ms 7928 KB Output is correct
24 Correct 271 ms 7804 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1964 KB Output is correct
2 Incorrect 196 ms 5980 KB 3rd lines differ - on the 1st token, expected: '373710605', found: '4557430888798830399'
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1920 KB Output is correct
2 Incorrect 4 ms 1920 KB 3rd lines differ - on the 1st token, expected: '14340', found: '4557430888798830399'
3 Halted 0 ms 0 KB -