Submission #765616

# Submission time Handle Problem Language Result Execution time Memory
765616 2023-06-24T22:45:54 Z NK_ Coin Collecting (JOI19_ho_t4) C++17
100 / 100
42 ms 7368 KB
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define sz(x) int(x.size())

using ll = long long;
template<class T> using V = vector<T>;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N; cin >> N;
	V<V<int>> A(2, V<int>(N, 0));

	ll ans = 0;
	for(int t = 0; t < 2*N; t++) {
		int x, y; cin >> x >> y;

		int r = (y >= 2 ? 1 : 0);
		int c = min(max(1, x), N) - 1;

		ans += abs((r + 1) - y);
		ans += abs((c + 1) - x);

		// cout << abs((r + 1) - y) + abs((c + 1) - x) << " " << r << " " << c << endl;

		A[r][c]++;
	}

	// for(int r = 0; r < 2; r++) {
	// 	for(int c = 0; c < N; c++) cout << A[r][c] << " ";
	// 	cout << nl;
	// }

	// cout << ans << nl;

	V<queue<array<int, 2>>> E(2), F(2); // EMPTY or FILLED
	for(int i = 0; i < N; i++) {
		for(int r = 0; r < 2; r++) {
			if (A[r][i] > 1) while(A[r][i] > 1 && sz(E[r])) {
				auto [pr, pc] = E[r].front(); E[r].pop();
				// cout << pr << ", " << pc << " <->  " << r << ", " << i << endl;
				ans += abs(r - pr) + abs(pc - i);
				--A[r][i];
			}

			if (A[r][i] < 1) while(A[r][i] < 1 && sz(F[r])) {
				auto [pr, pc] = F[r].front(); F[r].pop();
				// cout << pr << ", " << pc << " <->  " << r << ", " << i << endl;
				ans += abs(r - pr) + abs(pc - i);
				A[r][i]++;
			}
		}

		for(int r = 0; r < 2; r++) {
			if (A[r][i] > 1) while(A[r][i] > 1 && sz(E[r^1])) {
				auto [pr, pc] = E[r^1].front(); E[r^1].pop();
				// cout << pr << ", " << pc << " <->  " << r << ", " << i << endl;
				ans += abs(r - pr) + abs(pc - i);
				--A[r][i];
			}
			
			if (A[r][i] < 1) while(A[r][i] < 1 && sz(F[r^1])) {
				auto [pr, pc] = F[r^1].front(); F[r^1].pop();
				// cout << pr << ", " << pc << " <->  " << r << ", " << i << endl;
				ans += abs(r - pr) + abs(pc - i);
				A[r][i]++;
			}

			for(int t = 0; t < abs(1 - A[r][i]); t++) {
				if (A[r][i] < 1) E[r].push({r, i});
				else F[r].push({r, i});
			}
		}
	}

	cout << ans << nl;
    return 0;
}


# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 324 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 0 ms 320 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 324 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 0 ms 320 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 328 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 288 KB Output is correct
48 Correct 1 ms 352 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 324 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 0 ms 320 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 328 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 288 KB Output is correct
48 Correct 1 ms 352 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 21 ms 2624 KB Output is correct
66 Correct 38 ms 7368 KB Output is correct
67 Correct 41 ms 4168 KB Output is correct
68 Correct 42 ms 4284 KB Output is correct
69 Correct 33 ms 4168 KB Output is correct
70 Correct 35 ms 4284 KB Output is correct
71 Correct 34 ms 4324 KB Output is correct
72 Correct 32 ms 5328 KB Output is correct
73 Correct 32 ms 5816 KB Output is correct
74 Correct 40 ms 5200 KB Output is correct
75 Correct 33 ms 4944 KB Output is correct
76 Correct 32 ms 4936 KB Output is correct
77 Correct 32 ms 4936 KB Output is correct
78 Correct 32 ms 4928 KB Output is correct
79 Correct 32 ms 4800 KB Output is correct
80 Correct 37 ms 5188 KB Output is correct
81 Correct 32 ms 5052 KB Output is correct
82 Correct 33 ms 4416 KB Output is correct
83 Correct 32 ms 4540 KB Output is correct
84 Correct 32 ms 4540 KB Output is correct
85 Correct 37 ms 4296 KB Output is correct
86 Correct 32 ms 4292 KB Output is correct
87 Correct 33 ms 4304 KB Output is correct
88 Correct 32 ms 4288 KB Output is correct
89 Correct 33 ms 4284 KB Output is correct
90 Correct 35 ms 4168 KB Output is correct
91 Correct 34 ms 4172 KB Output is correct
92 Correct 32 ms 4296 KB Output is correct
93 Correct 32 ms 4296 KB Output is correct
94 Correct 34 ms 4164 KB Output is correct
95 Correct 33 ms 4168 KB Output is correct
96 Correct 38 ms 5312 KB Output is correct
97 Correct 32 ms 5316 KB Output is correct
98 Correct 31 ms 5068 KB Output is correct
99 Correct 32 ms 5060 KB Output is correct
100 Correct 33 ms 4792 KB Output is correct
101 Correct 32 ms 5056 KB Output is correct
102 Correct 33 ms 4932 KB Output is correct
103 Correct 32 ms 5188 KB Output is correct