oj.uz

답안 #106342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106342 2019-04-18T00:21:51 Z tincamatei Coin Collecting (JOI19_ho_t4) C++14
0 / 100
 3 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100000;

int coins[1+MAX_N+1][1+2];
pair<int, int> point[2*MAX_N];

int main() {
#ifdef HOME
	FILE *fin = fopen("input.in", "r");
	FILE *fout = fopen("output.out", "w");
#else
	FILE *fin = stdin;
	FILE *fout = stdout;
#endif

	int n;
	int upperP, lowerP;
	long long rez = 0LL;
	fscanf(fin, "%d", &n);
	
	for(int i = 0; i < 2 * n; ++i) {
		fscanf(fin, "%d%d", &point[i].first, &point[i].second);
		int xt = max(1, min(n, point[i].first)),
		    yt = max(1, min(2, point[i].second));
		
		rez = rez + llabs(xt - point[i].first) + llabs(yt - point[i].second);
		coins[xt][yt]++;
	}
	upperP = lowerP = 0;

	for(int i = 1; i <= n; ++i) {
		while((coins[i][1] > 0 || coins[i][2] > 0) && (lowerP < i || upperP < i)) {
			if(lowerP < upperP) {
				lowerP++;
				if(coins[i][1] > 0) {
					coins[i][1]--;
					rez = rez + i - lowerP;
				} else {
					coins[i][2]--;
					rez = rez + i - lowerP + 1;
				}
			} else if(upperP < lowerP) {
				upperP++;
				if(coins[i][2] > 0) {
					coins[i][2]--;
					rez = rez + i - upperP;
				} else {
					coins[i][1]--;
					rez = rez + i - upperP + 1;
				}
			} else if(coins[i][1] > 0) {
				++lowerP;
				coins[i][1]--;
				rez = rez + i - lowerP;
			} else {
				++upperP;
				coins[i][2]--;
				rez = rez + i - upperP;
			}
		}
		
		rez += coins[i][1] + coins[i][2]; // Shift all coins to right
		coins[i + 1][1] += coins[i][1];
		coins[i + 1][2] += coins[i][2];
	}

	fprintf(fout, "%lld", rez);

	fclose(fin);
	fclose(fout);
	return 0;
}

Compilation message

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:22:8: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fscanf(fin, "%d", &n);
  ~~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t4.cpp:25:9: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   fscanf(fin, "%d%d", &point[i].first, &point[i].second);
   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 8.0

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

Subtask #2
0 / 29.0

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

Subtask #3
0 / 63.0

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