oj.uz

Submission #332809

# Submission time Handle Problem Language Result Execution time Memory
332809 2020-12-03T12:40:45 Z ace_in_the_hole Coin Collecting (JOI19_ho_t4) C++14
0 / 100
 1 ms 364 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long Int;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n;
	cin >> n;
	vector<Int> x(n + n), y(n + n);
	for (int i = 0; i < n + n; i++) cin >> x[i] >> y[i];
	sort(x.begin(), x.end());
	sort(y.begin(), y.end());
	Int answer = 0;
	for (int i = 0; i < n + n; i++) {
		answer += abs(x[i] - (Int) (i / 2) - 1LL);
		answer += abs(y[i] - (Int) (i / n) - 1LL);
//		cerr << "x : " << x[i] << " to " << (i / 2) + 1 << '\n';
//		cerr << "y : " << y[i] << " to " << (i / n) + 1 << '\n';
	}
	cout << answer;
}

Subtask #1
0 / 8.0

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