oj.uz

Submission #291653

# Submission time Handle Problem Language Result Execution time Memory
291653 2020-09-05T15:17:31 Z reymontada61 Coin Collecting (JOI19_ho_t4) C++14
0 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
int n;
const int MXN = 100005;
int x[MXN * 2], y[MXN * 2];

int at[MXN][3];
int pf[MXN][3];
int ans;

signed main() {

	cin >> n;
	
	for (int i=0; i<2*n; i++) {
		int x, y;
		cin >> x >> y;
		if (x < 1) {
			ans += (1 - x);
			x = 1;
		}
		if (x > n) {
			ans += (x - n);
			x = n;
		}
		if (y < 1) {
			ans += (1 - y);
			y = 1;
		}
		if (y > 2) {
			ans += (y - 2);
			y = 2;
		}
		at[x][y]++;
	}
	
	for (int i=1; i<=n; i++) {
		for (int j=1; j<=2; j++) {
			pf[i][j] = at[i][j] + pf[i-1][j] + pf[i][j-1] - pf[i-1][j-1];
		}
	}
	
	ans += abs(pf[n][1] - n);
	
	for (int i=1; i<=n; i++) {
		int x = pf[i][2];
		ans += abs(2 * i - x);
	}
	
	cout << ans << endl;

}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Incorrect 1 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Incorrect 1 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Incorrect 1 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -