제출 #145389

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
145389		Minnakhmetov	전선 연결 (IOI17_wiring)	C++14	20 / 100	40 ms	6260 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define all(aaa) aaa.begin(), aaa.end()

const ll INF = 1e18;
const int N = 205;
ll dp[N][N];

void upd(ll &a, ll b) {
	a = min(a, b);
}

ll min_total_length(vector<int> r, vector<int> b) {
	int n = r.size(), m = b.size();

	if (r[n - 1] < b[0]) {
		ll ans = 0;
		if (n < m) {
			for (int i = 0; i < n; i++)
				ans += b[i] - r[i];
			for (int i = n; i < m; i++)
				ans += b[i] - r[n - 1];
		}
		else {
			for (int i = 0; i < m; i++)
				ans += b[i] - r[n - 1 - i];
			for (int i = 0; i < n - m; i++)
				ans += b[0] - r[i];
		}
		return ans;
	}
	else {
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				dp[i][j] = INF;
			}
		}

		dp[0][0] = 0;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				ll val = dp[i][j] + abs(r[i] - b[j]);
				upd(dp[i + 1][j], val);
				upd(dp[i][j + 1], val);
				upd(dp[i + 1][j + 1], val);
			}
		}

		return dp[n][m];
	}
}

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