제출 #73783

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73783		nvmdava	전선 연결 (IOI17_wiring)	C++17	0 / 100	1076 ms	11280 KiB

wiring

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

struct Node{
	long long x;
	bool col;
	Node(long long _x, bool _col){
		x = _x;
		col = _col;
	}
	bool operator<(const Node& rhs){
		if(x == rhs.x) return col < rhs.col;
		return x < rhs.x;
	}
};

vector<Node> v;
int last[200005][2];
long long ans[200005], s[200005];

inline long long sum(int l, int r, int x){
	if(l == x) return s[r] - s[l - 1] - v[l].x * (r - l + 1);
	return v[r].x * (r - l + 1) - s[r] + s[l - 1];
}

inline void find(int i){
	int r = last[i][v[i].col ^ 1];
	int l = last[r][v[i].col] + 1;
	long long d = v[r + 1].x - v[r].x;
	ans[i] = 400000000000000000;
	for(; l <= r; l++){
		ans[i] = min(ans[i], ans[l - 1] + sum(l, r, r) + sum(r + 1, i, r + 1) + d * max(r - l + 1, i - r));
	}
}

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	
	v.push_back(Node(-INF, 0));
	v.push_back(Node(-INF, 1));
	last[1][0] = 0;
	last[1][1] = 1;
	for(auto x : r){
		v.push_back(Node(x, 0));
	}
	for(auto x : b){
		v.push_back(Node(x, 1));
	}
	sort(v.begin(), v.end());
	s[0] = -INF;
	s[1] = -INF * 2;
	for(int i = 2; i < v.size(); i++){
		last[i][0] = last[i - 1][0];
		last[i][1] = last[i - 1][1];
		last[i][v[i].col] = i;
		s[i] = s[i - 1] + v[i].x;
		find(i);
	}
	return ans[v.size() - 1];
}

컴파일 시 표준 에러 (stderr) 메시지

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:53:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 2; i < v.size(); i++){
                 ~~^~~~~~~~~~

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