답안 #538591

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
538591	2022-03-17T07:39:17 Z	Haruto810198	Coin Collecting (JOI19_ho_t4)	C++17	100 / 100	62 ms	6468 KB

joi2019_ho_t4

#include <bits/stdc++.h>
 
using namespace std;
 
#define int long long
#define double long double
 
#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())
 
#define vi vector<int>
#define pii pair<int, int>
 
#define F first
#define S second
 
#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = INT_MAX;
const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;
 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

const int MAX = 100010;

int n;
int cnt[3][MAX];
int res;

signed main(){
	
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
	
	cin>>n;
	
	FOR(i, 1, 2, 1){
		FOR(j, 1, n, 1){
			cnt[i][j]--;
		}
	}

	FOR(i, 1, 2*n, 1){
		int x, y;
		cin>>x>>y;
		
		if(x < 1){
			res += 1-x;
			x = 1;
		}
		if(x > n){
			res += x-n;
			x = n;
		}

		if(y < 1){
			res += 1-y;
			y = 1;
		}
		if(y > 2){
			res += y-2;
			y = 2;
		}

		cnt[y][x]++;
	}

	FOR(i, 1, n, 1){
		
		int d;
		if(cnt[1][i] > 0 and cnt[2][i] < 0){
			d = min(cnt[1][i], -cnt[2][i]);
			cnt[1][i] -= d;
			cnt[2][i] += d;
			res += d;
		}

		if(cnt[1][i] < 0 and cnt[2][i] > 0){
			d = min(-cnt[1][i], cnt[2][i]);
			cnt[1][i] += d;
			cnt[2][i] -= d;
			res += d;
		}
		
		cnt[1][i+1] += cnt[1][i];
		cnt[2][i+1] += cnt[2][i];
		res += abs(cnt[1][i]) + abs(cnt[2][i]);
		cnt[1][i] = 0;
		cnt[2][i] = 0;
		
	}

	cout<<res<<'\n';
	
	return 0;
	
}

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	0 ms	340 KB	Output is correct
34	Correct	1 ms	328 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	336 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	1 ms	340 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	340 KB	Output is correct
46	Correct	1 ms	380 KB	Output is correct
47	Correct	2 ms	340 KB	Output is correct
48	Correct	1 ms	344 KB	Output is correct
49	Correct	1 ms	340 KB	Output is correct
50	Correct	2 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	340 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	1 ms	344 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	384 KB	Output is correct
60	Correct	1 ms	340 KB	Output is correct
61	Correct	1 ms	376 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

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	0 ms	340 KB	Output is correct
34	Correct	1 ms	328 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	336 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	1 ms	340 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	340 KB	Output is correct
46	Correct	1 ms	380 KB	Output is correct
47	Correct	2 ms	340 KB	Output is correct
48	Correct	1 ms	344 KB	Output is correct
49	Correct	1 ms	340 KB	Output is correct
50	Correct	2 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	340 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	1 ms	344 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	384 KB	Output is correct
60	Correct	1 ms	340 KB	Output is correct
61	Correct	1 ms	376 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	29 ms	3404 KB	Output is correct
66	Correct	55 ms	6468 KB	Output is correct
67	Correct	42 ms	4940 KB	Output is correct
68	Correct	45 ms	4940 KB	Output is correct
69	Correct	60 ms	5064 KB	Output is correct
70	Correct	43 ms	5060 KB	Output is correct
71	Correct	38 ms	4944 KB	Output is correct
72	Correct	39 ms	5056 KB	Output is correct
73	Correct	41 ms	5072 KB	Output is correct
74	Correct	40 ms	5056 KB	Output is correct
75	Correct	47 ms	4936 KB	Output is correct
76	Correct	41 ms	5064 KB	Output is correct
77	Correct	43 ms	4936 KB	Output is correct
78	Correct	47 ms	5056 KB	Output is correct
79	Correct	47 ms	5060 KB	Output is correct
80	Correct	54 ms	5056 KB	Output is correct
81	Correct	40 ms	5064 KB	Output is correct
82	Correct	39 ms	5056 KB	Output is correct
83	Correct	42 ms	5072 KB	Output is correct
84	Correct	43 ms	5060 KB	Output is correct
85	Correct	52 ms	4928 KB	Output is correct
86	Correct	40 ms	5068 KB	Output is correct
87	Correct	39 ms	4936 KB	Output is correct
88	Correct	42 ms	5056 KB	Output is correct
89	Correct	39 ms	4936 KB	Output is correct
90	Correct	44 ms	4936 KB	Output is correct
91	Correct	51 ms	4932 KB	Output is correct
92	Correct	48 ms	5068 KB	Output is correct
93	Correct	62 ms	5072 KB	Output is correct
94	Correct	40 ms	4940 KB	Output is correct
95	Correct	38 ms	4932 KB	Output is correct
96	Correct	40 ms	5064 KB	Output is correct
97	Correct	44 ms	5064 KB	Output is correct
98	Correct	49 ms	5072 KB	Output is correct
99	Correct	48 ms	5056 KB	Output is correct
100	Correct	40 ms	5068 KB	Output is correct
101	Correct	38 ms	4940 KB	Output is correct
102	Correct	44 ms	5060 KB	Output is correct
103	Correct	42 ms	5056 KB	Output is correct

답안 #538591

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