제출 #1274613

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1274613		kl0989e	전선 연결 (IOI17_wiring)	C++20	0 / 100	227 ms	241572 KiB

wiring

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

#define ll long long
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()

ll min_total_length(vi r, vi b) {
	vector<pl> k;
	for (int i=0; i<r.size(); i++) {
		k.pb({r[i],0});
	}
	for (int i=0; i<b.size(); i++) {
		k.pb({b[i],1});
	}
	sort(all(k));
	int n=k.size();
	vector<vector<vl>> dp(n,vector<vl>(min(n+1,21),vl({(ll)1e15,(ll)1e15})));
	for (int i=1; i<=n; i++) {
		dp[0][i][k[0].se]=0;
	}
	for (int i=1; i<n; i++) {
		for (int j=0; j<=min(n,20); j++) {
			for (int j2=0; j2<=min(n,20); j2++) {
				if (j<j2) {
					dp[i][j2][k[i].se]=min(dp[i][j2][k[i].se],min(dp[i-1][j][0],dp[i-1][j][1])+j*(k[i].fi-k[i-1].fi));
				}
				if (j>j2) {
					dp[i][j2][k[i].se]=min(dp[i][j2][k[i].se],dp[i-1][j][1-k[i].se]+j*(k[i].fi-k[i-1].fi));
					dp[i][j2][1-k[i].se]=min(dp[i][j2][1-k[i].se],dp[i-1][j][1-k[i].se]+j*(k[i].fi-k[i-1].fi));
				}
				if (j==j2 && j!=0) {
					dp[i][j2][k[i].se]=min(dp[i][j2][k[i].se],dp[i-1][j][1-k[i].se]+j*(k[i].fi-k[i-1].fi));
				}
			}
		}
	}
	return min(dp[n-1][0][0],dp[n-1][0][1]);
}

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