제출 #66712

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66712		leejseo	전선 연결 (IOI17_wiring)	C++11	100 / 100	83 ms	11020 KiB

wiring

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

typedef long long lld;
typedef pair<int, int> pii;

vector<pii> X;
vector<pii> Y;

lld S[200005];
int con[200001];
int lst[400002];
lld D[200002];

long long min_total_length(vector<int> A, vector<int> B) {
	int N = A.size(), M = B.size();
	int K = N+M;
	int i = 0, j = 0;
	while (i+j < K){
		if (j >= M || (i < N && A[i] <= B[j])){
			X.push_back(pii(A[i], 0));
			if (j >= M) Y.push_back(pii(abs(A[i] - B.back()), M-1));
			else Y.push_back(min(pii(abs(A[i]-B[(M+j-1)%M]), j-1), pii(abs(A[i]-B[j]), j)));
			i++;
		}
		else{
			X.push_back(pii(B[j], 1));
			if (i >= N) Y.push_back(pii(abs(B[j] - A.back()), N-1));
			else Y.push_back(min(pii(abs(A[(N+i-1)%N]-B[j]), i-1), pii(abs(A[i]-B[j]), i)));
			j++;
		}
	}
	int cur = 0;
	for (int i=0; i<K; i++) con[i] = -2;
	for (int i=0; i<K+K+1; i++) lst[i] = -2;
	lst[K] = -1;
	for (int i=0; i<K; i++){
		if (X[i].second == 1){
			cur++;
			S[i] = X[i].first;
		}
		else{
			cur--;
			S[i] = -X[i].first;
		}
		if (i > 0) S[i] += S[i-1];
		if (lst[cur+K] >= -1) con[i] = lst[cur+K];
		lst[cur+K] = i;
	}
	for (int i=0; i<K; i++){
		D[i] = D[(i+K)%(K+1)] + Y[i].first;
		if (con[i] >= -1){
			int j = con[i];
			D[i] = min(D[i], D[((j+K+1) % (K+1))] + abs(S[i]-S[j]));
		}
	}
	return D[K-1];
}

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