제출 #1025612

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1025612		amirhoseinfar1385	전선 연결 (IOI17_wiring)	C++17	17 / 100	1100 ms	8644 KiB

wiring

#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
const long long maxn=200000+10;
long long dp[maxn],inf=1e16,vas[maxn];
long long n,m;
vector<long long>allind;

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	n=(long long)r.size();
	m=(long long)b.size();
	allind.push_back(-1);
	for(auto x:r){
		allind.push_back(x);
	}
	for(auto x:b){
		allind.push_back(x);
	}
	sort(allind.begin(),allind.end());
	allind.resize(unique(allind.begin(),allind.end())-allind.begin());
	for(long long i=0;i<n;i++){
		r[i]=lower_bound(allind.begin(),allind.end(),r[i])-allind.begin();
		vas[r[i]]=1;
	}
	for(long long i=0;i<m;i++){
		b[i]=lower_bound(allind.begin(),allind.end(),b[i])-allind.begin();
		vas[b[i]]=2;
	}
	for(long long i=1;i<maxn;i++){
		dp[i]=inf;
	}
	dp[0]=0;
	long long sz=(long long)allind.size();
	if(sz!=n+m+1){
		exit(23);
	}
	for(long long i=1;i<sz;i++){
		long long av=allind[i],unnow=0,last=i,bar=0,akh;
		for(long long j=i-1;j>=1;j--){
			if(vas[j]==vas[i]&&vas[j]!=vas[j+1]){
				break;
			}
			if(vas[j]==vas[i]){
				last=j;
				unnow+=av;
				av=allind[j];
			}else{
				bar+=allind[j];
				akh=allind[last-1];
				long long ted1=i-last+1;
				long long ted2=(last-1)-j+1;
				dp[i]=min(dp[i],dp[j-1]+unnow-(bar-akh)+max(1ll,ted2-ted1+1)*av-max(1ll,ted1-ted2+1)*akh);
				dp[i]=min(dp[i],dp[j]+unnow-(bar-akh)+max(1ll,ted2-ted1+1)*av-max(1ll,ted1-ted2+1)*akh);
			}
		}
	//	cout<<i<<" "<<dp[i]<<" "<<vas[i]<<endl;
	}
	return dp[sz-1];
}

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