제출 #605607

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
605607		FEDIKUS	전선 연결 (IOI17_wiring)	C++17	42 / 100	63 ms	7468 KiB

wiring

#include "wiring.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cassert>
 
using namespace std;
 
typedef pair<int,bool> pie;
 
const bool BLUE = true, RED = false;
const int max_n = 200 * 1000; // TO BE DETERMINED
 
const int TOF = 2;
 
vector<pie> points;
long long d[max_n + 1], ps[max_n + 1];
int head[max_n];
 
long long val(int l, int r) {
	int m = head[r], x = r+1 - m, y = m - l;
  	long long res=-min(x,y)*(points[m].first-points[m-1].first);
  	res+=(ps[r+1]-ps[m]-(long long)(x)*points[m-1].first)+(long long)(y)*points[m].first-(ps[m]-ps[l]);
  	
	return res;
}
 
long long min_total_length (vector <int> red, vector <int> blue) {
	int n = blue.size(), m = red.size();
	for (int i = 0; i < n; i++) points.push_back(pie(blue[i], BLUE));
	for (int i = 0; i < m; i++) points.push_back(pie(red[i], RED));
	sort (points.begin(), points.end());
 
	n = points.size();
	for (int i = 0; i < n - 1; i++)
	 	assert(points[i].first != points[i + 1].first);
	for (int i = 1; i <= n; i++) ps[i] = ps[i-1] + points[i-1].first;
 
	long long *d = &(::d[1]);
	memset(d, 50, sizeof(long long) * n);
 
	for (int i = 1; i < n; i++) {
		head[i] = head[i-1];
		if(points[i].second!=points[i-1].second){
            head[i]=i;
          }	
      	if (head[i] > 0) {
          
			int l = head[head[i] - 1], r = head[i];
			if (l == 0)
				d[i] = val(0, i);
			else if (r - l < TOF)
				for (int j = l; j < r; j++)
					d[i] = min(d[i], min(d[j], d[j-1]) + val(j, i));
			else {
				while (r - l > 1) {
					int m = (r + l) / 2;
					if (d[m-1] + val(m, i) > d[m-2] + val(m-1, i))
						r = m;
					else
						l = m;
				}
				d[i] = d[l - 1] + val(l, i);
			}
		}
	}
	return d[n-1];
}

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