oj.uz

Submission #532050

# Submission time Handle Problem Language Result Execution time Memory
532050 2022-03-02T04:29:47 Z abc864197532 Coin Collecting (JOI19_ho_t4) C++17
8 / 100
 1000 ms 416 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pii pair<int,int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T i, U ...j) {
	cout << i << ' ', abc(j...);
}
template <typename T> void printv(T l, T r) {
	for (; l != r; ++l)
		cout << *l << " \n"[l + 1 == r];
}
#ifdef Doludu
#define test(x...) abc("[" + string(#x) + "]", x)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(x...) void(0)
#define owo ios::sync_with_stdio(false), cin.tie(0)
#endif

int main () {
	owo;
	srand(time(NULL));
	int n;
	cin >> n;
	vector <vector <int>> cnt(n, vector <int> (2, -1));
	lli ans = 0;
	for (int i = 0, x, y; i < n * 2; ++i) {
		cin >> x >> y, --x, --y;
		if (x < 0) {
			if (y <= 0)
				ans += -x - y, cnt[0][0]++;
			else
				ans += -x + y - 1, cnt[0][1]++;
		} else if (x >= n) {
			if (y <= 0)
				ans += x - n + 1 - y, cnt[n - 1][0]++;
			else
				ans += x - n + 1 + y - 1, cnt[n - 1][1]++;
		} else {
			if (y <= 0)
				ans += -y, cnt[x][0]++;
			else
				ans += y - 1, cnt[x][1]++;

		}
	}
	lli res = 1ll << 60;
	for (int t = 0; t < 100000; ++t) {
		vector <pii> source, sink;
		for (int i = 0; i < n; ++i) for (int j = 0; j < 2; ++j) {
			if (cnt[i][j] < 0)
				sink.eb(i, j);
			else {
				for (int k = 0; k < cnt[i][j]; ++k)
					source.eb(i, j);
			}
		}
		int m = source.size();
		if (!m) {
			res = 0;
			break;
		}
		if (t) {
			if (t & 1) {
				for (int i = 0; i < 10; ++i) {
					int x = rand() % m, y = rand() % m;
					if (rand() & 1)
						swap(source[x], source[y]);
					else
						swap(sink[x], sink[y]);
				}
			} else {
				random_shuffle(all(source));
				random_shuffle(all(sink));
			}
		}
		lli tmp = 0;
		for (int i = 0; i < m; ++i)
			tmp += abs(source[i].X - sink[i].X) + abs(source[i].Y - sink[i].Y);
		res = min(res, tmp);
	}
	cout << ans + res << endl;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 29 ms 288 KB Output is correct
3 Correct 27 ms 284 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 97 ms 300 KB Output is correct
6 Correct 75 ms 284 KB Output is correct
7 Correct 84 ms 296 KB Output is correct
8 Correct 65 ms 204 KB Output is correct
9 Correct 56 ms 204 KB Output is correct
10 Correct 95 ms 288 KB Output is correct
11 Correct 104 ms 204 KB Output is correct
12 Correct 107 ms 204 KB Output is correct
13 Correct 90 ms 288 KB Output is correct
14 Correct 82 ms 204 KB Output is correct
15 Correct 79 ms 288 KB Output is correct
16 Correct 82 ms 204 KB Output is correct
17 Correct 94 ms 204 KB Output is correct
18 Correct 94 ms 296 KB Output is correct
19 Correct 80 ms 204 KB Output is correct
20 Correct 74 ms 204 KB Output is correct
21 Correct 77 ms 204 KB Output is correct
22 Correct 93 ms 204 KB Output is correct
23 Correct 91 ms 204 KB Output is correct
24 Correct 77 ms 292 KB Output is correct
25 Correct 77 ms 204 KB Output is correct
26 Correct 85 ms 204 KB Output is correct
27 Correct 88 ms 204 KB Output is correct
28 Correct 75 ms 204 KB Output is correct
29 Correct 86 ms 296 KB Output is correct
30 Correct 80 ms 204 KB Output is correct
31 Correct 84 ms 204 KB Output is correct
32 Correct 76 ms 204 KB Output is correct
33 Correct 81 ms 204 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 29 ms 288 KB Output is correct
3 Correct 27 ms 284 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 97 ms 300 KB Output is correct
6 Correct 75 ms 284 KB Output is correct
7 Correct 84 ms 296 KB Output is correct
8 Correct 65 ms 204 KB Output is correct
9 Correct 56 ms 204 KB Output is correct
10 Correct 95 ms 288 KB Output is correct
11 Correct 104 ms 204 KB Output is correct
12 Correct 107 ms 204 KB Output is correct
13 Correct 90 ms 288 KB Output is correct
14 Correct 82 ms 204 KB Output is correct
15 Correct 79 ms 288 KB Output is correct
16 Correct 82 ms 204 KB Output is correct
17 Correct 94 ms 204 KB Output is correct
18 Correct 94 ms 296 KB Output is correct
19 Correct 80 ms 204 KB Output is correct
20 Correct 74 ms 204 KB Output is correct
21 Correct 77 ms 204 KB Output is correct
22 Correct 93 ms 204 KB Output is correct
23 Correct 91 ms 204 KB Output is correct
24 Correct 77 ms 292 KB Output is correct
25 Correct 77 ms 204 KB Output is correct
26 Correct 85 ms 204 KB Output is correct
27 Correct 88 ms 204 KB Output is correct
28 Correct 75 ms 204 KB Output is correct
29 Correct 86 ms 296 KB Output is correct
30 Correct 80 ms 204 KB Output is correct
31 Correct 84 ms 204 KB Output is correct
32 Correct 76 ms 204 KB Output is correct
33 Correct 81 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Execution timed out 1090 ms 416 KB Time limit exceeded
36 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 29 ms 288 KB Output is correct
3 Correct 27 ms 284 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 97 ms 300 KB Output is correct
6 Correct 75 ms 284 KB Output is correct
7 Correct 84 ms 296 KB Output is correct
8 Correct 65 ms 204 KB Output is correct
9 Correct 56 ms 204 KB Output is correct
10 Correct 95 ms 288 KB Output is correct
11 Correct 104 ms 204 KB Output is correct
12 Correct 107 ms 204 KB Output is correct
13 Correct 90 ms 288 KB Output is correct
14 Correct 82 ms 204 KB Output is correct
15 Correct 79 ms 288 KB Output is correct
16 Correct 82 ms 204 KB Output is correct
17 Correct 94 ms 204 KB Output is correct
18 Correct 94 ms 296 KB Output is correct
19 Correct 80 ms 204 KB Output is correct
20 Correct 74 ms 204 KB Output is correct
21 Correct 77 ms 204 KB Output is correct
22 Correct 93 ms 204 KB Output is correct
23 Correct 91 ms 204 KB Output is correct
24 Correct 77 ms 292 KB Output is correct
25 Correct 77 ms 204 KB Output is correct
26 Correct 85 ms 204 KB Output is correct
27 Correct 88 ms 204 KB Output is correct
28 Correct 75 ms 204 KB Output is correct
29 Correct 86 ms 296 KB Output is correct
30 Correct 80 ms 204 KB Output is correct
31 Correct 84 ms 204 KB Output is correct
32 Correct 76 ms 204 KB Output is correct
33 Correct 81 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Execution timed out 1090 ms 416 KB Time limit exceeded
36 Halted 0 ms 0 KB -