Submission #142793

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
142793	2019-08-11T04:34:16 Z	DrumpfTheGodEmperor	Coin Collecting (JOI19_ho_t4)	C++14	100 / 100	68 ms	9208 KB

joi2019_ho_t4

#include <bits/stdc++.h>
#define int long long
#define bp __builtin_popcountll
#define pb push_back
#define in(s) freopen(s, "r", stdin);
#define out(s) freopen(s, "w", stdout);
#define inout(s, end1, end2) freopen((string(s) + "." + end1).c_str(), "r", stdin),\
		freopen((string(s) + "." + end2).c_str(), "w", stdout);
#define fi first
#define se second
#define bw(i, r, l) for (int i = r - 1; i >= l; i--)
#define fw(i, l, r) for (int i = l; i < r; i++)
#define fa(i, x) for (auto i: x)
using namespace std;
const int mod = 1e9 + 7, inf = 1061109567;
const long long infll = 4557430888798830399;
const int N = 2e5 + 5;
int n, x[N], y[N], ans = 0, cnt[N][3];
signed main() {
	#ifdef BLU
	in("blu.inp");
//	out("ans1.out");
	#endif
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n;
	fw (i, 0, n * 2) cin >> x[i] >> y[i];
	//x and y are NOT independent (same y same x case)
	fw (i, 0, n * 2) {
		if (x[i] < 1) {
			ans += (1 - x[i]);
			x[i] = 1;
		} else if (x[i] > n) {
			ans += (x[i] - n);
			x[i] = n;
		}
		if (y[i] < 1) {
			ans += (1 - y[i]);
			y[i] = 1;
		} else if (y[i] > 2) {
			ans += (y[i] - 2);
			y[i] = 2;
		}
		cnt[x[i]][y[i]]++;
//		cout << "cnt[" << x[i] << "][" << y[i] << "] = " << cnt[x[i]][y[i]] << "\n";
	}
	int prf[3];
	prf[1] = prf[2] = 0;
	fw (i, 1, n + 1) {
		fw (j, 1, 3) {
			prf[j] += cnt[i][j] - 1; //Leave 1 coin at current position.
			//If there are no coins to be placed prf[j] is negative.
		}
		fw (j, 1, 3) {
			int other = 2;
			if (j == 2) other = 1;
			if (prf[j] > 0 && prf[other] < 0) {
				//Transfer across columns
				int transferred = min(prf[j], -prf[other]);
				prf[j] -= transferred;
				prf[other] += transferred;
				ans += transferred;
			}
		}
		fw (j, 1, 3) {
			//If prf is negative it needs to be transferred from the right. Add by abs
			ans += abs(prf[j]);
		}
	}
	cout << ans;
	return 0;
}

Subtask #1
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	248 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	380 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	424 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct

Subtask #2
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	248 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	380 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	424 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	3 ms	504 KB	Output is correct
35	Correct	3 ms	376 KB	Output is correct
36	Correct	3 ms	504 KB	Output is correct
37	Correct	3 ms	504 KB	Output is correct
38	Correct	3 ms	376 KB	Output is correct
39	Correct	3 ms	376 KB	Output is correct
40	Correct	3 ms	504 KB	Output is correct
41	Correct	4 ms	376 KB	Output is correct
42	Correct	3 ms	376 KB	Output is correct
43	Correct	3 ms	376 KB	Output is correct
44	Correct	3 ms	348 KB	Output is correct
45	Correct	3 ms	504 KB	Output is correct
46	Correct	3 ms	376 KB	Output is correct
47	Correct	3 ms	376 KB	Output is correct
48	Correct	3 ms	504 KB	Output is correct
49	Correct	3 ms	376 KB	Output is correct
50	Correct	3 ms	376 KB	Output is correct
51	Correct	3 ms	376 KB	Output is correct
52	Correct	3 ms	504 KB	Output is correct
53	Correct	3 ms	504 KB	Output is correct
54	Correct	3 ms	504 KB	Output is correct
55	Correct	3 ms	504 KB	Output is correct
56	Correct	3 ms	504 KB	Output is correct
57	Correct	3 ms	476 KB	Output is correct
58	Correct	3 ms	504 KB	Output is correct
59	Correct	3 ms	504 KB	Output is correct
60	Correct	3 ms	504 KB	Output is correct
61	Correct	3 ms	504 KB	Output is correct
62	Correct	3 ms	376 KB	Output is correct
63	Correct	3 ms	504 KB	Output is correct
64	Correct	3 ms	504 KB	Output is correct

Subtask #3
63.0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	248 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	380 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	424 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	3 ms	504 KB	Output is correct
35	Correct	3 ms	376 KB	Output is correct
36	Correct	3 ms	504 KB	Output is correct
37	Correct	3 ms	504 KB	Output is correct
38	Correct	3 ms	376 KB	Output is correct
39	Correct	3 ms	376 KB	Output is correct
40	Correct	3 ms	504 KB	Output is correct
41	Correct	4 ms	376 KB	Output is correct
42	Correct	3 ms	376 KB	Output is correct
43	Correct	3 ms	376 KB	Output is correct
44	Correct	3 ms	348 KB	Output is correct
45	Correct	3 ms	504 KB	Output is correct
46	Correct	3 ms	376 KB	Output is correct
47	Correct	3 ms	376 KB	Output is correct
48	Correct	3 ms	504 KB	Output is correct
49	Correct	3 ms	376 KB	Output is correct
50	Correct	3 ms	376 KB	Output is correct
51	Correct	3 ms	376 KB	Output is correct
52	Correct	3 ms	504 KB	Output is correct
53	Correct	3 ms	504 KB	Output is correct
54	Correct	3 ms	504 KB	Output is correct
55	Correct	3 ms	504 KB	Output is correct
56	Correct	3 ms	504 KB	Output is correct
57	Correct	3 ms	476 KB	Output is correct
58	Correct	3 ms	504 KB	Output is correct
59	Correct	3 ms	504 KB	Output is correct
60	Correct	3 ms	504 KB	Output is correct
61	Correct	3 ms	504 KB	Output is correct
62	Correct	3 ms	376 KB	Output is correct
63	Correct	3 ms	504 KB	Output is correct
64	Correct	3 ms	504 KB	Output is correct
65	Correct	42 ms	7408 KB	Output is correct
66	Correct	68 ms	8120 KB	Output is correct
67	Correct	60 ms	8956 KB	Output is correct
68	Correct	59 ms	8944 KB	Output is correct
69	Correct	62 ms	8952 KB	Output is correct
70	Correct	59 ms	8952 KB	Output is correct
71	Correct	59 ms	8952 KB	Output is correct
72	Correct	58 ms	6668 KB	Output is correct
73	Correct	58 ms	6644 KB	Output is correct
74	Correct	57 ms	6648 KB	Output is correct
75	Correct	60 ms	6648 KB	Output is correct
76	Correct	58 ms	6776 KB	Output is correct
77	Correct	59 ms	6560 KB	Output is correct
78	Correct	57 ms	6648 KB	Output is correct
79	Correct	60 ms	6776 KB	Output is correct
80	Correct	58 ms	6776 KB	Output is correct
81	Correct	57 ms	6748 KB	Output is correct
82	Correct	58 ms	6648 KB	Output is correct
83	Correct	58 ms	6704 KB	Output is correct
84	Correct	57 ms	7032 KB	Output is correct
85	Correct	58 ms	7016 KB	Output is correct
86	Correct	59 ms	8676 KB	Output is correct
87	Correct	59 ms	8696 KB	Output is correct
88	Correct	59 ms	8952 KB	Output is correct
89	Correct	59 ms	8956 KB	Output is correct
90	Correct	59 ms	8956 KB	Output is correct
91	Correct	59 ms	9080 KB	Output is correct
92	Correct	58 ms	9208 KB	Output is correct
93	Correct	58 ms	9080 KB	Output is correct
94	Correct	57 ms	8952 KB	Output is correct
95	Correct	61 ms	8944 KB	Output is correct
96	Correct	59 ms	8312 KB	Output is correct
97	Correct	59 ms	8184 KB	Output is correct
98	Correct	58 ms	8056 KB	Output is correct
99	Correct	63 ms	7772 KB	Output is correct
100	Correct	59 ms	7928 KB	Output is correct
101	Correct	58 ms	8184 KB	Output is correct
102	Correct	60 ms	7928 KB	Output is correct
103	Correct	58 ms	7696 KB	Output is correct

Submission #142793

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