Submission #106346

#	Time	Username	Problem	Language	Result	Execution time	Memory
106346		tincamatei	Coin Collecting (JOI19_ho_t4)	C++14	100 / 100	122 ms	7800 KiB

joi2019_ho_t4

#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("coin.in", "r");
	FILE *fout = fopen("coin.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)), // move all points in the designated rectangle
		    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(lowerP < i && coins[i][1] > 0) {
			lowerP++;
			coins[i][1]--;
			rez = rez + i - lowerP;
		}

		while(upperP < i && coins[i][2] > 0) {
			upperP++;
			coins[i][2]--;
			rez = rez + i - upperP;
		}

		while(coins[i][1] > 0 && upperP < i) {
			upperP++;
			coins[i][1]--;
			rez = rez + i - upperP + 1;
		}

		while(coins[i][2] > 0 && lowerP < i) {
			lowerP++;
			coins[i][2]--;
			rez = rez + i - lowerP + 1;
		}

		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 (stderr)

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: 8 / 8
• Subtask 2: 29 / 29
• Subtask 3: 63 / 63