oj.uz

답안 #202572

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
202572 2020-02-17T02:53:35 Z dndhk Coin Collecting (JOI19_ho_t4) C++14
0 / 100
 6 ms 376 KB 
#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 idx = 1;
	for(int i=1; i<=N; i++){
		for(int j=1; j<=2; j++){
			if(cnt[i][j]==-1){
				cnt[i][j] = 0;
				while(1){
					//cout<<i<<" "<<j<<" "<<idx<<endl;
					if(cnt[idx][j]>0){
						cnt[idx][j]--;
						ans+=(ll)((idx-i)>0?idx-i:i-idx);
						break;
					}else if(cnt[idx][3-j]>0){
						cnt[idx][3-j]--;
						ans+=(ll)((idx-i)>0?idx-i:i-idx);
						ans+=1LL;
						break;
					}
					idx++;
				}
			}
		}
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:19: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:21: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
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 248 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Incorrect 5 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 248 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Incorrect 5 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 248 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Incorrect 5 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -