답안 #153822

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
153822	2019-09-16T14:56:26 Z	arnold518	Coin Collecting (JOI19_ho_t4)	C++14	100 / 100	71 ms	5816 KB

joi2019_ho_t4

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;

int N;
int A[3][MAXN+10];
ll ans;

int main()
{
    int i, j;

    scanf("%d", &N);
    for(i=1; i<=2*N; i++)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        if(x<1) ans+=1-x, x=1;
        if(x>N) ans+=x-N, x=N;
        if(y<1) ans+=1-y, y=1;
        if(y>2) ans+=y-2, y=2;
        A[y][x]++;
    }

    for(i=1; i<N; i++)
    {
        if(A[1][i]<1 && A[2][i]>=1)
        {
            if(A[1][i]+A[2][i]>=2)
            {
                ans+=1-A[1][i];
                A[2][i]-=1-A[1][i];
                A[1][i]=1;
            }
            else
            {
                ans+=A[2][i]-1;
                A[1][i]+=A[2][i]-1;
                A[2][i]=1;
            }
        }
        if(A[2][i]<1 && A[1][i]>=1)
        {
            if(A[1][i]+A[2][i]>=2)
            {
                ans+=1-A[2][i];
                A[1][i]-=1-A[2][i];
                A[2][i]=1;
            }
            else
            {
                ans+=A[1][i]-1;
                A[2][i]+=A[1][i]-1;
                A[1][i]=1;
            }
        }

        if(A[1][i]>=1)
        {
            ans+=A[1][i]-1;
            A[1][i+1]+=A[1][i]-1; A[1][i]=1;
        }
        else
        {
            ans+=1-A[1][i];
            A[1][i+1]+=A[1][i]-1; A[1][i]=1;
        }

        if(A[2][i]>=1)
        {
            ans+=A[2][i]-1;
            A[2][i+1]+=A[2][i]-1; A[2][i]=1;
        }
        else
        {
            ans+=1-A[2][i];
            A[2][i+1]+=A[2][i]-1; A[2][i]=1;
        }
    }
    ans+=abs(A[1][N]-1);
    printf("%lld", ans);
}

Compilation message

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:16:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
joi2019_ho_t4.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
     ~~~~~^~~~~~~~~~
joi2019_ho_t4.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &x, &y);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 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	368 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	504 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	380 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	504 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	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	364 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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 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	368 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	504 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	380 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	504 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	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	364 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	380 KB	Output is correct
35	Correct	3 ms	376 KB	Output is correct
36	Correct	3 ms	376 KB	Output is correct
37	Correct	3 ms	376 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	376 KB	Output is correct
41	Correct	3 ms	376 KB	Output is correct
42	Correct	3 ms	376 KB	Output is correct
43	Correct	3 ms	348 KB	Output is correct
44	Correct	3 ms	504 KB	Output is correct
45	Correct	3 ms	376 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	376 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	376 KB	Output is correct
53	Correct	3 ms	380 KB	Output is correct
54	Correct	3 ms	348 KB	Output is correct
55	Correct	3 ms	380 KB	Output is correct
56	Correct	3 ms	416 KB	Output is correct
57	Correct	3 ms	376 KB	Output is correct
58	Correct	3 ms	376 KB	Output is correct
59	Correct	3 ms	376 KB	Output is correct
60	Correct	3 ms	376 KB	Output is correct
61	Correct	3 ms	376 KB	Output is correct
62	Correct	2 ms	376 KB	Output is correct
63	Correct	3 ms	380 KB	Output is correct
64	Correct	3 ms	376 KB	Output is correct

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 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	368 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	504 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	380 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	504 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	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	364 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	380 KB	Output is correct
35	Correct	3 ms	376 KB	Output is correct
36	Correct	3 ms	376 KB	Output is correct
37	Correct	3 ms	376 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	376 KB	Output is correct
41	Correct	3 ms	376 KB	Output is correct
42	Correct	3 ms	376 KB	Output is correct
43	Correct	3 ms	348 KB	Output is correct
44	Correct	3 ms	504 KB	Output is correct
45	Correct	3 ms	376 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	376 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	376 KB	Output is correct
53	Correct	3 ms	380 KB	Output is correct
54	Correct	3 ms	348 KB	Output is correct
55	Correct	3 ms	380 KB	Output is correct
56	Correct	3 ms	416 KB	Output is correct
57	Correct	3 ms	376 KB	Output is correct
58	Correct	3 ms	376 KB	Output is correct
59	Correct	3 ms	376 KB	Output is correct
60	Correct	3 ms	376 KB	Output is correct
61	Correct	3 ms	376 KB	Output is correct
62	Correct	2 ms	376 KB	Output is correct
63	Correct	3 ms	380 KB	Output is correct
64	Correct	3 ms	376 KB	Output is correct
65	Correct	55 ms	2700 KB	Output is correct
66	Correct	61 ms	5816 KB	Output is correct
67	Correct	69 ms	4344 KB	Output is correct
68	Correct	68 ms	4216 KB	Output is correct
69	Correct	70 ms	4348 KB	Output is correct
70	Correct	68 ms	4344 KB	Output is correct
71	Correct	66 ms	4216 KB	Output is correct
72	Correct	59 ms	4328 KB	Output is correct
73	Correct	58 ms	4344 KB	Output is correct
74	Correct	61 ms	4372 KB	Output is correct
75	Correct	61 ms	4216 KB	Output is correct
76	Correct	62 ms	4376 KB	Output is correct
77	Correct	61 ms	4212 KB	Output is correct
78	Correct	67 ms	4472 KB	Output is correct
79	Correct	66 ms	4380 KB	Output is correct
80	Correct	71 ms	4320 KB	Output is correct
81	Correct	60 ms	4344 KB	Output is correct
82	Correct	64 ms	4268 KB	Output is correct
83	Correct	63 ms	4344 KB	Output is correct
84	Correct	64 ms	4216 KB	Output is correct
85	Correct	63 ms	4344 KB	Output is correct
86	Correct	63 ms	4216 KB	Output is correct
87	Correct	64 ms	4472 KB	Output is correct
88	Correct	68 ms	4344 KB	Output is correct
89	Correct	68 ms	4216 KB	Output is correct
90	Correct	68 ms	4344 KB	Output is correct
91	Correct	68 ms	4360 KB	Output is correct
92	Correct	66 ms	4344 KB	Output is correct
93	Correct	68 ms	4316 KB	Output is correct
94	Correct	66 ms	4188 KB	Output is correct
95	Correct	63 ms	4192 KB	Output is correct
96	Correct	62 ms	4344 KB	Output is correct
97	Correct	65 ms	4324 KB	Output is correct
98	Correct	65 ms	4268 KB	Output is correct
99	Correct	63 ms	4388 KB	Output is correct
100	Correct	62 ms	4344 KB	Output is correct
101	Correct	61 ms	4216 KB	Output is correct
102	Correct	67 ms	4472 KB	Output is correct
103	Correct	65 ms	4344 KB	Output is correct

답안 #153822

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