제출 #291659

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
291659		reymontada61	Coin Collecting (JOI19_ho_t4)	C++14	100 / 100	405 ms	6052 KiB

joi2019_ho_t4

#include <bits/stdc++.h>
using namespace std;

#define int long long
int n;
const int MXN = 100005;
int x[MXN * 2], y[MXN * 2];

int at[MXN][3];
int pf[MXN][3];
int ans;

signed main() {

	cin >> n;
	
	for (int i=0; i<2*n; i++) {
		int x, y;
		cin >> x >> y;
		if (x < 1) {
			ans += (1 - x);
			x = 1;
		}
		if (x > n) {
			ans += (x - n);
			x = n;
		}
		if (y < 1) {
			ans += (1 - y);
			y = 1;
		}
		if (y > 2) {
			ans += (y - 2);
			y = 2;
		}
		at[x][y]++;
	}
	
	int res1 = 0;
	int res2 = 0;
	
	for (int i=1; i<=n; i++) {
		res1 += at[i][1] - 1;
		res2 += at[i][2] - 1;
		if (res1 > 0 && res2 < 0) {
			int t = min(res1, -res2);
			ans += t;
			res1 -= t;
			res2 += t;
		}
		if (res2 > 0 && res1 < 0) {
			int t = min(res2, -res1);
			ans += t;
			res2 -= t;
			res1 += t;
		}
		ans += abs(res1) + abs(res2);
	}
	
	
	cout << ans << endl;

}

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