제출 #202575

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
202575		dndhk	Coin Collecting (JOI19_ho_t4)	C++14	100 / 100	92 ms	6144 KiB

joi2019_ho_t4

#include <bits/stdc++.h>

#define pb push_back

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;

const int MAX_N = 100000;

int cnt[MAX_N+1][3];

int N;
ll ans = 0;


int main(){
	scanf("%d", &N);
	for(int i=1; i<=2*N; i++){
		int x, y; scanf("%d%d", &x, &y);
		if(x<=1 && y<=1){
			cnt[1][1]++;
			ans+=(ll)(1-x+1-y);
		}else if(x<=1 && y>=2){
			cnt[1][2]++;
			ans+=(ll)(1-x+y-2);
		}else if(x>=N && y<=1){
			cnt[N][1]++;
			ans+=(ll)(x-N+1-y);
		}else if(x>=N && y>=2){
			cnt[N][2]++;
			ans+=(ll)(x-N+y-2);
		}else if(y<=1){
			cnt[x][1]++;
			ans+=(ll)(1-y);
		}else{
			cnt[x][2]++;
			ans+=(ll)(y-2);
		}
	}
	for(int i=1; i<=N; i++){
		for(int j=1; j<=2; j++)	{
			cnt[i][j]--;
		}
	}
	int cnt2[3];
	cnt2[1] = cnt2[2] = 0;
	for(int i=1; i<=N; i++){
		for(int j=1; j<=2; j++){
			while(cnt[i][j]>0 && cnt2[j]<0){
				cnt[i][j]--;
				cnt2[j]++;
			}
			while(cnt[i][j]<0 && cnt2[j]>0){
				cnt[i][j]++;
				cnt2[j]--;
			}
		}
		for(int j=1; j<=2; j++){
			while(cnt[i][j]>0){
				cnt[i][j]--;
				if(cnt2[j]<0){
					cnt2[j]++;
				}else if(cnt2[3-j]<0){
					cnt2[3-j]++;
					ans+=1LL;
				}else{
					cnt2[j]++;
				}
			}
			if(cnt[i][j]<0){
				cnt[i][j]++;
				if(cnt2[j]>0){
					cnt2[j]--;
				}else if(cnt2[3-j]>0){
					cnt2[3-j]--;
					ans+=1LL;
				}else{
					cnt2[j]--;
				}
			}
		}
		ans+=(ll)(cnt2[1]>0?cnt2[1]:-cnt2[1]);
		ans+=(ll)(cnt2[2]>0?cnt2[2]:-cnt2[2]);
	}
	printf("%lld\n", ans);
	return 0;
}

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

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

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