제출 #593726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
593726		FatihSolak	전선 연결 (IOI17_wiring)	C++17	7 / 100	28 ms	5844 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
#define N 205
using namespace std;
long long dp[N][N];
int worstr[N];
int worstb[N];
vector<int> r,b;
long long dist(int i,int j){
	long long ret = abs(r[i] - b[j]);
	return ret;
}
long long min_total_length(vector<int> r_, vector<int> b_) {
	r = r_;
	b = b_;
	int n = r.size(),m = b.size();
	for(int i = 0;i<n;i++){
		if(b[0] < r[i]){
			worstr[i] = max(worstr[i], abs(*prev(lower_bound(b.begin(),b.end(),r[i])) - r[i]));
		}
		if(r[i] < b[m-1]){
			worstr[i] = max(worstr[i], abs(*lower_bound(b.begin(),b.end(),r[i]) - r[i]));
		}
	}
	for(int i = 0;i<m;i++){
		if(r[0] < b[i]){
			worstb[i] = max(worstb[i], abs(*prev(lower_bound(r.begin(),r.end(),b[i])) - b[i]));
		}
		if(b[i] < r[n-1]){
			worstb[i] = max(worstb[i], abs(*lower_bound(r.begin(),r.end(),b[i]) - b[i]));
		}
	}
	for(int i = 0;i<n;i++){
		for(int j = 0;j<m;j++){
			dp[i][j] = 1e18;
		}
	}
	dp[0][0] = abs(r[0] - b[0]);
	for(int i = 0;i<n;i++){
		for(int j = 0;j<m;j++){
			if(i)
				dp[i][j] = min(dp[i][j],dp[i-1][j] + dist(i,j));
			if(j)
				dp[i][j] = min(dp[i][j],dp[i][j-1] + dist(i,j));
			if(i && j)
				dp[i][j] = min(dp[i][j],dp[i-1][j-1] + dist(i,j));
		}
	}
	return dp[n-1][m-1];
}

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