답안 #977963

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977963	2024-05-08T14:54:46 Z	qwerasdfzxcl	Coin Collecting (JOI19_ho_t4)	C++17	100 / 100	47 ms	5716 KB

joi2019_ho_t4

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int a[100100][2];

int main(){
	int n;
	scanf("%d", &n);

	ll ans = 0;

	for (int i=1;i<=n*2;i++){
		int x, y, nx, ny;
		scanf("%d %d", &x, &y);
		
		if (y <= 1) ny = 1;
		else ny = 2;

		if (x <= 1) nx = 1;
		else if (x <= n) nx = x;
		else nx = n;

		ans += abs(nx-x) + abs(ny-y);
		a[nx][ny-1]++;
	}

	for (int i=1;i<=n;i++){
		if (a[i][0] > 0 && a[i][1] > 0){
			ans += a[i][0] + a[i][1] - 2;
			a[i+1][0] += a[i][0] - 1;
			a[i+1][1] += a[i][1] - 1;
		}

		else if (a[i][0] > 0 && a[i][1] <= 0){
			int y = min(a[i][0]-1, 1-a[i][1]);
			a[i][0] -= y;
			a[i][1] += y;

			ans += y + (a[i][0]-1) + (1-a[i][1]);
			a[i+1][0] += a[i][0] - 1;
			a[i+1][1] += a[i][1] - 1;
		}

		else if (a[i][0] <= 0 && a[i][1] > 0){
			int y = min(a[i][1]-1, 1-a[i][0]);
			a[i][1] -= y;
			a[i][0] += y;

			ans += y + (a[i][1]-1) + (1-a[i][0]);
			a[i+1][0] += a[i][0] - 1;
			a[i+1][1] += a[i][1] - 1;
		}

		else{
			ans += (1-a[i][0]) + (1-a[i][1]);
			a[i+1][0] += a[i][0] - 1;
			a[i+1][1] += a[i][1] - 1;
		}
	}

	printf("%lld\n", ans);
}

Compilation message

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
joi2019_ho_t4.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |   scanf("%d %d", &x, &y);
      |   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 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	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	448 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	444 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 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	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	448 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	444 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	1 ms	480 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct
44	Correct	1 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	1 ms	348 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	348 KB	Output is correct
51	Correct	1 ms	348 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	1 ms	348 KB	Output is correct
54	Correct	1 ms	604 KB	Output is correct
55	Correct	1 ms	460 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	1 ms	348 KB	Output is correct
58	Correct	1 ms	348 KB	Output is correct
59	Correct	1 ms	348 KB	Output is correct
60	Correct	1 ms	344 KB	Output is correct
61	Correct	1 ms	400 KB	Output is correct
62	Correct	1 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	1 ms	348 KB	Output is correct
65	Correct	28 ms	2652 KB	Output is correct
66	Correct	45 ms	5716 KB	Output is correct
67	Correct	35 ms	4388 KB	Output is correct
68	Correct	35 ms	4180 KB	Output is correct
69	Correct	36 ms	4176 KB	Output is correct
70	Correct	35 ms	4180 KB	Output is correct
71	Correct	47 ms	4176 KB	Output is correct
72	Correct	34 ms	4264 KB	Output is correct
73	Correct	34 ms	4176 KB	Output is correct
74	Correct	34 ms	4176 KB	Output is correct
75	Correct	34 ms	4180 KB	Output is correct
76	Correct	34 ms	4180 KB	Output is correct
77	Correct	34 ms	4152 KB	Output is correct
78	Correct	39 ms	4436 KB	Output is correct
79	Correct	39 ms	4300 KB	Output is correct
80	Correct	34 ms	4372 KB	Output is correct
81	Correct	34 ms	4416 KB	Output is correct
82	Correct	34 ms	4180 KB	Output is correct
83	Correct	35 ms	4180 KB	Output is correct
84	Correct	34 ms	4204 KB	Output is correct
85	Correct	34 ms	4176 KB	Output is correct
86	Correct	34 ms	4188 KB	Output is correct
87	Correct	34 ms	4140 KB	Output is correct
88	Correct	35 ms	4144 KB	Output is correct
89	Correct	35 ms	4188 KB	Output is correct
90	Correct	37 ms	4268 KB	Output is correct
91	Correct	36 ms	4184 KB	Output is correct
92	Correct	34 ms	4696 KB	Output is correct
93	Correct	34 ms	4460 KB	Output is correct
94	Correct	34 ms	4176 KB	Output is correct
95	Correct	35 ms	4268 KB	Output is correct
96	Correct	34 ms	4432 KB	Output is correct
97	Correct	35 ms	4432 KB	Output is correct
98	Correct	35 ms	4180 KB	Output is correct
99	Correct	34 ms	4368 KB	Output is correct
100	Correct	41 ms	4372 KB	Output is correct
101	Correct	34 ms	4360 KB	Output is correct
102	Correct	34 ms	4180 KB	Output is correct
103	Correct	34 ms	4224 KB	Output is correct

답안 #977963

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