oj.uz

Submission #104318

# Submission time Handle Problem Language Result Execution time Memory
104318 2019-04-05T05:34:19 Z ihdignite Coin Collecting (JOI19_ho_t4) C++14
0 / 100
 3 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int mxN=1e5;
int n, c[mxN][2];
ll a1;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n;
	for(int i=0, x, y; i<2*n; ++i) {
		cin >> x >> y;
		if(x<1) {
			a1+=1-x;
			x=1;
		}
		if(x>n) {
			a1+=x-n;
			x=n;
		}
		if(y<1) {
			a1+=1-y;
			y=1;
		}
		if(y>2) {
			a1+=y-2;
			y=2;
		}
		++c[x-1][y-1];
	}
	for(int i1=0, i2=0, j=0; i1<n||i2<n; ) {
		while(!c[j][0]&&!c[j][1])
			++j;
		if(c[j][0]&&c[j][1]) {
			a1+=abs(i1-j)+abs(i2-j);
			--c[j][0], --c[j][1];
			++i1, ++i2;
		} else if(c[j][0]) {
			if(i1<=i2) {
				a1+=abs(i1-j);
				++i1;
			} else {
				a1+=abs(i2-j)+1;
				++i2;
			}
			--c[j][0];
		} else {
			if(i2<=i1) {
				a1+=abs(i2-j);
				++i2;
			} else {
				a1+=abs(i1-j)+1;
				++i1;
			}
			--c[j][1];
		}
	}
	cout << a1;
}

Subtask #1
0 / 8.0

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