제출 #594738

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
594738		alexz1205	Palembang Bridges (APIO15_bridge)	C++14	0 / 100	1 ms	340 KiB

bridge

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

typedef long long int lint;

int main() {
	int n, k;
	cin >> k >> n;
	lint s = 0, m = 0;
	vector<pair<lint, lint> > nums;
	for (int x = 0; x < n; x ++){
		char a, b;
		lint i, j;
		cin >> a >> i >> b >> j;
		if (a == b){
			s += abs(i - j);
		}else {
			nums.push_back(make_pair(i+j, i));
			m += i;
			m += j;
		}
	}
	if (k == 1){
		lint i = (m + nums.size()) / (nums.size()*2);
		m = 0;
		for (pair<lint, lint> x: nums){
			lint a = x.second, b = x.first-x.second;
			m += abs(a-i) + abs(b-i);
		}
	}
	m += nums.size();
	cout << m+s << endl;
	return 0;
}

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