답안 #376344

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
376344	2021-03-11T09:44:59 Z	Nima_Naderi	Coin Collecting (JOI19_ho_t4)	C++14	100 / 100	80 ms	5248 KB

joi2019_ho_t4

///In the name of GOD
//#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll MXN = 1e5 + 10;
ll n, ans, mini;
ll cnt[MXN][2];
int main(){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    cin >> n;
    for(int i = 1; i <= 2 * n; i ++){
        ll x, y; cin >> 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;
        cnt[x][y] ++;
    }
    ll t0 = 0, t1 = 0;
    ll n0 = 0, n1 = 0;
    for(int i = 1; i <= n; i ++){
        t0 += cnt[i][1], t1 += cnt[i][2];
        n0 ++, n1 ++;
        if(t0 >= n0 && t1 >= n1){
            t0 -= n0; t1 -= n1;
            n0 = n1 = 0;
            ans += t0 + t1;
            continue;
        }
        if(t0 >= n0 + (n1 - t1) && t1 < n1){
            ans += (n1 - t1);
            t0 -= (n1 - t1), t1 += (n1 - t1);
            t0 -= n0; t1 -= n1;
            n0 = n1 = 0;
            ans += t0;
            continue;
        }
        if(t0 < n0 && t1 >= n1 + (n0 - t0)){
            ans += (n0 - t0);
            t1 -= (n0 - t0), t0 += (n0 - t0);
            t0 -= n0; t1 -= n1;
            n0 = n1 = 0;
            ans += t1;
            continue;
        }
        if(t0 > n0){
            ans += (t0 - n0);
            t1 += (t0 - n0), t0 -= (t0 - n0);
        }
        if(t1 > n1){
            ans += (t1 - n1);
            t0 += (t1 - n1), t1 -= (t1 - n1);
        }
        mini = min(n0, t0);
        n0 -= mini, t0 -= mini;
        mini = min(n1, t1);
        n1 -= mini, t1 -= mini;
        ans += n0 + n1;
        ans += t0 + t1;
    }
    assert(!n0 && !n1 && !t0 && !t1);
    cout << ans << '\n';
    return 0;
}
/*!
    HE'S AN INSTIGATOR,
    ENEMY ELIMINATOR,
    AND WHEN HE KNOCKS YOU BETTER
    YOU BETTER LET HIM IN.
*/
//! N.N

Compilation message

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:24:40: warning: array subscript 2 is above array bounds of 'll [2]' {aka 'long long int [2]'} [-Warray-bounds]
   24 |         t0 += cnt[i][1], t1 += cnt[i][2];
      |                                ~~~~~~~~^

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	512 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	2 ms	364 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	2 ms	364 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct
42	Correct	1 ms	364 KB	Output is correct
43	Correct	1 ms	364 KB	Output is correct
44	Correct	1 ms	364 KB	Output is correct
45	Correct	1 ms	364 KB	Output is correct
46	Correct	1 ms	364 KB	Output is correct
47	Correct	1 ms	364 KB	Output is correct
48	Correct	1 ms	508 KB	Output is correct
49	Correct	1 ms	384 KB	Output is correct
50	Correct	1 ms	364 KB	Output is correct
51	Correct	2 ms	364 KB	Output is correct
52	Correct	1 ms	364 KB	Output is correct
53	Correct	1 ms	364 KB	Output is correct
54	Correct	1 ms	364 KB	Output is correct
55	Correct	1 ms	364 KB	Output is correct
56	Correct	1 ms	364 KB	Output is correct
57	Correct	1 ms	364 KB	Output is correct
58	Correct	1 ms	364 KB	Output is correct
59	Correct	1 ms	364 KB	Output is correct
60	Correct	1 ms	364 KB	Output is correct
61	Correct	1 ms	364 KB	Output is correct
62	Correct	1 ms	364 KB	Output is correct
63	Correct	2 ms	364 KB	Output is correct
64	Correct	2 ms	364 KB	Output is correct
65	Correct	40 ms	3436 KB	Output is correct
66	Correct	80 ms	5124 KB	Output is correct
67	Correct	54 ms	5100 KB	Output is correct
68	Correct	66 ms	5120 KB	Output is correct
69	Correct	51 ms	5228 KB	Output is correct
70	Correct	57 ms	5248 KB	Output is correct
71	Correct	72 ms	5100 KB	Output is correct
72	Correct	46 ms	3564 KB	Output is correct
73	Correct	45 ms	3564 KB	Output is correct
74	Correct	46 ms	3564 KB	Output is correct
75	Correct	48 ms	3436 KB	Output is correct
76	Correct	48 ms	3564 KB	Output is correct
77	Correct	48 ms	3564 KB	Output is correct
78	Correct	49 ms	3564 KB	Output is correct
79	Correct	45 ms	3564 KB	Output is correct
80	Correct	49 ms	3692 KB	Output is correct
81	Correct	45 ms	3564 KB	Output is correct
82	Correct	46 ms	3564 KB	Output is correct
83	Correct	46 ms	3564 KB	Output is correct
84	Correct	46 ms	3948 KB	Output is correct
85	Correct	45 ms	3948 KB	Output is correct
86	Correct	49 ms	5100 KB	Output is correct
87	Correct	46 ms	5100 KB	Output is correct
88	Correct	58 ms	5160 KB	Output is correct
89	Correct	70 ms	5100 KB	Output is correct
90	Correct	57 ms	5100 KB	Output is correct
91	Correct	51 ms	5100 KB	Output is correct
92	Correct	53 ms	5228 KB	Output is correct
93	Correct	55 ms	5228 KB	Output is correct
94	Correct	49 ms	5100 KB	Output is correct
95	Correct	50 ms	4972 KB	Output is correct
96	Correct	46 ms	4716 KB	Output is correct
97	Correct	49 ms	4588 KB	Output is correct
98	Correct	59 ms	4460 KB	Output is correct
99	Correct	64 ms	4332 KB	Output is correct
100	Correct	49 ms	4460 KB	Output is correct
101	Correct	48 ms	4588 KB	Output is correct
102	Correct	47 ms	4332 KB	Output is correct
103	Correct	47 ms	4332 KB	Output is correct

답안 #376344

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