제출 #1051317

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1051317		pawned	전선 연결 (IOI17_wiring)	C++17	0 / 100	1090 ms	60056 KiB

wiring

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

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

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;

#include "wiring.h"

ll min_total_length(vector<int> r_g, vector<int> b_g) {
	vi r, b;
	for (int x : r_g)
		r.pb(x);
	for (int x : b_g)
		b.pb(x);
	int N = r.size();
	int M = b.size();
	map<ii, ll> dp;
	// dp[i][j]: min cost to connect first i red (exclusive)
	// with first j blue (exclusive)
	dp[{0, 0}] = 0;
	for (int i = 1; i <= N; i++) {
		for (int j = max(i - 10, 1); j <= min(i + 10, M); j++) {
			dp[{i, j}] = 1e18;
			if (dp.find({i, j - 1}) != dp.end())
				dp[{i, j}] = min(dp[{i, j}], dp[{i, j - 1}] + abs(r[i - 1] - b[j - 1]));
			if (dp.find({i - 1, j}) != dp.end())
				dp[{i, j}] = min(dp[{i, j}], dp[{i - 1, j}] + abs(r[i - 1] - b[j - 1]));
			if (dp.find({i - 1, j - 1}) != dp.end())
				dp[{i, j}] = min(dp[{i, j}], dp[{i - 1, j - 1}] + abs(r[i - 1] - b[j - 1]));
		}
	}
	return dp[{N, M}];
}

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