oj.uz

Submission #430343

# Submission time Handle Problem Language Result Execution time Memory
430343 2021-06-16T13:03:05 Z Drew_ Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 1 ms 204 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;

#define ll long long
#define ii pair<int, int>
#define pl pair<ll, ll>
#define f1 first
#define s2 second

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

	int n;
	cin >> n;

	vector<pl> v(2*n);
	for (auto &[x, y] : v)
		cin >> x >> y;

	sort(v.begin(), v.end());

	ll ans = 0;
	for (int i = 0; i < 2*n; i += 2)
	{
		ans += abs(v[i].f1 - (i/2 + 1)) + abs(v[i+1].f1 - (i/2 + 1)) + min(abs(v[i].s2 - 1) + abs(v[i+1].s2 - 2), abs(v[i].s2 - 2) + abs(v[i+1].s2 - 1));
	}
	cout << ans << '\n';

	return 0;
}

Subtask #1
0 / 8.0

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