제출 #430343

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
430343		Drew_	Coin Collecting (JOI19_ho_t4)	C++17	0 / 100	1 ms	204 KiB

joi2019_ho_t4

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

#define ll long long
#define ii pair<int, int>
#define pl pair<ll, ll>
#define f1 first
#define s2 second

int main()
{
	ios :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int n;
	cin >> n;

	vector<pl> v(2*n);
	for (auto &[x, y] : v)
		cin >> x >> y;

	sort(v.begin(), v.end());

	ll ans = 0;
	for (int i = 0; i < 2*n; i += 2)
	{
		ans += abs(v[i].f1 - (i/2 + 1)) + abs(v[i+1].f1 - (i/2 + 1)) + min(abs(v[i].s2 - 1) + abs(v[i+1].s2 - 2), abs(v[i].s2 - 2) + abs(v[i+1].s2 - 1));
	}
	cout << ans << '\n';

	return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 63