Submission #33344

#	Time	Username	Problem	Language	Result	Execution time	Memory
33344		mohammad_kilani	전선 연결 (IOI17_wiring)	C++14	0 / 100	26 ms	5736 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 500;
vector<int> r , b;
long long dp[N][N];
int n , m;
long long solve(int i,int j){
	if(i == n && j == m) return 0;
	if(i == n || j == m) return 1e18;
	if(dp[i][j] != -1) return dp[i][j];
	dp[i][j] = 1e18;
	long long cur = 0 ;
	for(int k=j;k<m;k++){
		cur += abs(r[i] - b[k]);
		dp[i][j] = min(dp[i][j],cur + solve(i+1,k+1));
	}
	return dp[i][j];
}




long long min_total_length(std::vector<int> R, std::vector<int> B) {
	memset(dp,-1,sizeof(dp));
	r = R;
	b = B;
	if(r.size() > b.size()) swap(r,b);
	n = r.size();
	m = b.size();
	return solve(0,0);
}

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