제출 #977963

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977963		qwerasdfzxcl	Coin Collecting (JOI19_ho_t4)	C++17	100 / 100	47 ms	5716 KiB

joi2019_ho_t4

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int a[100100][2];

int main(){
	int n;
	scanf("%d", &n);

	ll ans = 0;

	for (int i=1;i<=n*2;i++){
		int x, y, nx, ny;
		scanf("%d %d", &x, &y);
		
		if (y <= 1) ny = 1;
		else ny = 2;

		if (x <= 1) nx = 1;
		else if (x <= n) nx = x;
		else nx = n;

		ans += abs(nx-x) + abs(ny-y);
		a[nx][ny-1]++;
	}

	for (int i=1;i<=n;i++){
		if (a[i][0] > 0 && a[i][1] > 0){
			ans += a[i][0] + a[i][1] - 2;
			a[i+1][0] += a[i][0] - 1;
			a[i+1][1] += a[i][1] - 1;
		}

		else if (a[i][0] > 0 && a[i][1] <= 0){
			int y = min(a[i][0]-1, 1-a[i][1]);
			a[i][0] -= y;
			a[i][1] += y;

			ans += y + (a[i][0]-1) + (1-a[i][1]);
			a[i+1][0] += a[i][0] - 1;
			a[i+1][1] += a[i][1] - 1;
		}

		else if (a[i][0] <= 0 && a[i][1] > 0){
			int y = min(a[i][1]-1, 1-a[i][0]);
			a[i][1] -= y;
			a[i][0] += y;

			ans += y + (a[i][1]-1) + (1-a[i][0]);
			a[i+1][0] += a[i][0] - 1;
			a[i+1][1] += a[i][1] - 1;
		}

		else{
			ans += (1-a[i][0]) + (1-a[i][1]);
			a[i+1][0] += a[i][0] - 1;
			a[i+1][1] += a[i][1] - 1;
		}
	}

	printf("%lld\n", ans);
}

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

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
joi2019_ho_t4.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |   scanf("%d %d", &x, &y);
      |   ~~~~~^~~~~~~~~~~~~~~~~

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