제출 #248404

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
248404		sahil_k	Palembang Bridges (APIO15_bridge)	C++14	22 / 100	165 ms	2176 KiB

bridge

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main () {
	int k, n;
	cin >> k >> n;
	char ai, ci;
	int bi, di;
	long long o = 0;
	vector< pair<int, int> > pts;
	vector<int> vals;
	for (int i=0; i<n; i++) {
		cin >> ai >> bi >> ci >> di;
		if (ai != ci) {
			vals.push_back(bi);
			vals.push_back(di);
			pts.push_back(make_pair(min(bi, di), max(bi, di)));
		} else {
			o += abs(bi-di);
		}
	}
	o += pts.size();
	sort(vals.begin(), vals.end());
	if (k == 1) {
		int mid = vals[vals.size()/2];
		for (auto i: vals) {
			o += abs(mid-i);
		}
		cout << o << endl;
		return 0;
	}
	vals.resize(unique(vals.begin(), vals.end())-vals.begin());
	long long best = 1e15;
	long long score = 0;
	for (auto i: vals) {
		for (auto j: vals) {
			score = 0;
			for (auto k: pts) {
				score += min(abs(k.first-i)+abs(k.second-i), abs(k.first-j)+abs(k.second-j));
			}
			best = min(best, score);
		}
	}
	o += best;
	cout << o << endl;
	return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 14 / 14
• Subtask 3: 0 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37