답안 #846535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
846535	2023-09-07T18:16:24 Z	42kangaroo	Coin Collecting (JOI19_ho_t4)	C++17	100 / 100	40 ms	11344 KB

joi2019_ho_t4

//
// Created by 42kangaroo on 07/09/2023.
//
#include "bits/stdc++.h"

using namespace std;

#define int long long

struct Po {
	int x, y;
};

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int n;
	cin >> n;
	vector<Po> a(2 * n);
	for (int i = 0; i < 2 * n; ++i) {
		cin >> a[i].x >> a[i].y;
		a[i].x--;
		a[i].y--;
	}
	int ans = 0;
	// move them into the box, make vector with number at each position
	vector<array<int, 2>> num(n, {0, 0});
	for (auto p: a) {
		if (p.x < 0) {
			ans += - p.x;
			p.x = 0;
		}
		if (p.x >= n) {
			ans += p.x - n + 1;
			p.x = n - 1;
		}
		if (p.y < 0) {
			ans += -p.y;
			p.y = 0;
		}
		if (p.y > 1) {
			ans += p.y - 1;
			p.y = 1;
		}
		num[p.x][p.y]++;
	}
	// At each pos, calculate how many go over boundary for up and down
	vector<array<int, 2>> dp(n + 1, {0, 0});
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < 2; ++j) {
			dp[i + 1][j] = dp[i][j] + num[i][j] - 1;
		}
		// if sum is > 0 and one is < 0, take one up
		for (int j = 0; j < 2; ++j) {
			if (dp[i + 1][j] < 0 && dp[i + 1][1 - j] > 0) {
				int mi = min(-dp[i + 1][j], dp[i + 1][1 - j]);
				ans += mi;
				dp[i + 1][j] += mi;
				dp[i + 1][1 -j] -= mi;
			}
		}
		ans += abs(dp[i + 1][0]) + abs(dp[i + 1][1]);
	}
	cout << ans << "\n";
}

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	600 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	344 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	344 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	500 KB	Output is correct

Subtask #2
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	600 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	344 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	344 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	500 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	1 ms	344 KB	Output is correct
36	Correct	1 ms	344 KB	Output is correct
37	Correct	1 ms	344 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	1 ms	344 KB	Output is correct
41	Correct	1 ms	344 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct
44	Correct	1 ms	344 KB	Output is correct
45	Correct	1 ms	344 KB	Output is correct
46	Correct	1 ms	344 KB	Output is correct
47	Correct	1 ms	344 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	1 ms	348 KB	Output is correct
50	Correct	1 ms	344 KB	Output is correct
51	Correct	1 ms	348 KB	Output is correct
52	Correct	1 ms	344 KB	Output is correct
53	Correct	1 ms	344 KB	Output is correct
54	Correct	1 ms	344 KB	Output is correct
55	Correct	1 ms	600 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	1 ms	344 KB	Output is correct
58	Correct	1 ms	344 KB	Output is correct
59	Correct	1 ms	348 KB	Output is correct
60	Correct	1 ms	464 KB	Output is correct
61	Correct	1 ms	348 KB	Output is correct
62	Correct	1 ms	344 KB	Output is correct
63	Correct	1 ms	500 KB	Output is correct
64	Correct	1 ms	344 KB	Output is correct

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	600 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	344 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	344 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	500 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	1 ms	344 KB	Output is correct
36	Correct	1 ms	344 KB	Output is correct
37	Correct	1 ms	344 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	1 ms	344 KB	Output is correct
41	Correct	1 ms	344 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct
44	Correct	1 ms	344 KB	Output is correct
45	Correct	1 ms	344 KB	Output is correct
46	Correct	1 ms	344 KB	Output is correct
47	Correct	1 ms	344 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	1 ms	348 KB	Output is correct
50	Correct	1 ms	344 KB	Output is correct
51	Correct	1 ms	348 KB	Output is correct
52	Correct	1 ms	344 KB	Output is correct
53	Correct	1 ms	344 KB	Output is correct
54	Correct	1 ms	344 KB	Output is correct
55	Correct	1 ms	600 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	1 ms	344 KB	Output is correct
58	Correct	1 ms	344 KB	Output is correct
59	Correct	1 ms	348 KB	Output is correct
60	Correct	1 ms	464 KB	Output is correct
61	Correct	1 ms	348 KB	Output is correct
62	Correct	1 ms	344 KB	Output is correct
63	Correct	1 ms	500 KB	Output is correct
64	Correct	1 ms	344 KB	Output is correct
65	Correct	22 ms	8024 KB	Output is correct
66	Correct	40 ms	11344 KB	Output is correct
67	Correct	31 ms	9812 KB	Output is correct
68	Correct	32 ms	9728 KB	Output is correct
69	Correct	34 ms	9808 KB	Output is correct
70	Correct	33 ms	9728 KB	Output is correct
71	Correct	32 ms	9808 KB	Output is correct
72	Correct	32 ms	9808 KB	Output is correct
73	Correct	31 ms	9808 KB	Output is correct
74	Correct	30 ms	9808 KB	Output is correct
75	Correct	35 ms	9812 KB	Output is correct
76	Correct	31 ms	9844 KB	Output is correct
77	Correct	33 ms	9808 KB	Output is correct
78	Correct	33 ms	9708 KB	Output is correct
79	Correct	31 ms	9812 KB	Output is correct
80	Correct	32 ms	9852 KB	Output is correct
81	Correct	32 ms	9868 KB	Output is correct
82	Correct	31 ms	9860 KB	Output is correct
83	Correct	31 ms	9808 KB	Output is correct
84	Correct	32 ms	9812 KB	Output is correct
85	Correct	32 ms	9808 KB	Output is correct
86	Correct	34 ms	9808 KB	Output is correct
87	Correct	31 ms	9808 KB	Output is correct
88	Correct	30 ms	9816 KB	Output is correct
89	Correct	31 ms	9808 KB	Output is correct
90	Correct	31 ms	9812 KB	Output is correct
91	Correct	32 ms	9808 KB	Output is correct
92	Correct	31 ms	9808 KB	Output is correct
93	Correct	33 ms	9964 KB	Output is correct
94	Correct	31 ms	9700 KB	Output is correct
95	Correct	29 ms	9584 KB	Output is correct
96	Correct	30 ms	9808 KB	Output is correct
97	Correct	32 ms	9808 KB	Output is correct
98	Correct	31 ms	9844 KB	Output is correct
99	Correct	30 ms	9816 KB	Output is correct
100	Correct	31 ms	9808 KB	Output is correct
101	Correct	30 ms	9808 KB	Output is correct
102	Correct	32 ms	9808 KB	Output is correct
103	Correct	30 ms	9712 KB	Output is correct

답안 #846535

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 29.0 / 29.0

Subtask #3 63.0 / 63.0

Subtask #1
8.0 / 8.0

Subtask #2
29.0 / 29.0

Subtask #3
63.0 / 63.0