Submission #69928

#	Time	Username	Problem	Language	Result	Execution time	Memory
69928		E869120	Wiring (IOI17_wiring)	C++14	7 / 100	46 ms	4716 KiB

wiring

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

long long dp[209][209],N,M;bool p[209][209];

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	N=r.size();M=b.size();
	for(int i=0;i<=N;i++){for(int j=0;j<=M;j++) dp[i][j]=(1LL<<60);}
	
	for(int i=0;i<N;i++){
		int minx=(1<<30),minid=-10;
		for(int j=0;j<M;j++){if(minx>abs(r[i]-b[j])){minx=abs(r[i]-b[j]);minid=j;}}
		p[i+1][minid+1]=true;
	}
	for(int i=0;i<M;i++){
		int minx=(1<<30),minid=-10;
		for(int j=0;j<N;j++){if(minx>abs(r[j]-b[i])){minx=abs(r[j]-b[i]);minid=j;}}
		p[minid+1][i+1]=true;
	}
	dp[0][0]=0;
	for(int i=1;i<=N;i++){
		for(int j=1;j<=M;j++){
			dp[i][j]=dp[i-1][j-1];
			if(p[i][j]==true) dp[i][j]=min({dp[i-1][j-1],dp[i][j-1],dp[i-1][j]});
			dp[i][j]+=abs(r[i-1]-b[j-1]);
		}
	}
	return dp[N][M];
}

/*int main(){
	int n,m;cin>>n>>m;
	vector<int>vec1,vec2;
	for(int i=0;i<n;i++){int p;cin>>p;vec1.push_back(p);}
	for(int i=0;i<m;i++){int p;cin>>p;vec2.push_back(p);}
	
	cout<<min_total_length(vec1,vec2)<<endl;
	return 0;
}*/

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