답안 #873122

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
873122	2023-11-14T13:37:07 Z	hct_2so1	Coin Collecting (JOI19_ho_t4)	C++17	100 / 100	40 ms	7760 KB

joi2019_ho_t4

#include <bits/stdc++.h>
 
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define uni(v) sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define F first
#define S second
#define pii(x, y) make_pair(x, y)
#define __builtin_popcount __builtin_popcountll
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define lg(x) (63 - __builtin_clz(x))
 
template <class X, class Y>
    bool minimize(X &x, const Y &y)
    {
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }
 
template <class X, class Y>
    bool maximize(X &x, const Y &y)
    {
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
 
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
const int M = 6e5;
const int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const ll oo = 2e18;
const double eps = 1e-1;
 
int n, c[3][N];
pair<int, int> a[2 * N];
 
void Input(void)
{
    cin >> n;
    for (int i = 1; i <= 2 * n; i ++) cin >> a[i].S >> a[i].F;
}
 
void solve(void)
{
    ll ans = 0;
    for (int i = 1; i <= 2 * n; i ++)
    {
        if (a[i].F < 1) ans += 1 - a[i].F, a[i].F = 1;
        if (a[i].F > 2) ans += a[i].F - 2, a[i].F = 2;
        if (a[i].S < 1) ans += 1 - a[i].S, a[i].S = 1;
        if (a[i].S > n) ans += a[i].S - n, a[i].S = n;
        c[a[i].F][a[i].S] ++;
    }
    int row[] = {0, 0, 0};
    for (int i = 1; i <= n; i ++)
    {
        c[1][i] --, c[2][i] --;
        row[1] += c[1][i];
        row[2] += c[2][i];
        if (row[1] < 0 && row[2] > 0)
        {
            int k = min(-row[1], row[2]);
            ans += k;
            row[1] += k;
            row[2] -= k;
        }
        else
            if (row[1] > 0 && row[2] < 0)
            {
                int k = min(row[1], -row[2]);
                ans += k;
                row[1] -= k;
                row[2] += k;
            }
        ans += abs(row[1]) + abs(row[2]);
    }
    cout << ans;
}
 
int main()
{
    std::ios_base::sync_with_stdio(0); cin.tie(0);
//    freopen("CLASSROOM.inp", "r", stdin);
//    freopen("CLASSROOM.out", "w", stdout);
    int test = 1;
    //cin >> test;
    while (test --)
    {
        Input();
        solve();
    }
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	0 ms	2396 KB	Output is correct
20	Correct	0 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	2396 KB	Output is correct
27	Correct	0 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	0 ms	2396 KB	Output is correct
30	Correct	0 ms	2396 KB	Output is correct
31	Correct	1 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2392 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	1 ms	2396 KB	Output is correct
38	Correct	1 ms	2392 KB	Output is correct
39	Correct	1 ms	2396 KB	Output is correct
40	Correct	1 ms	2396 KB	Output is correct
41	Correct	1 ms	2392 KB	Output is correct
42	Correct	1 ms	2392 KB	Output is correct
43	Correct	1 ms	2396 KB	Output is correct
44	Correct	1 ms	2396 KB	Output is correct
45	Correct	1 ms	2396 KB	Output is correct
46	Correct	1 ms	2396 KB	Output is correct
47	Correct	1 ms	2396 KB	Output is correct
48	Correct	1 ms	2648 KB	Output is correct
49	Correct	1 ms	2396 KB	Output is correct
50	Correct	1 ms	2392 KB	Output is correct
51	Correct	1 ms	2396 KB	Output is correct
52	Correct	1 ms	2580 KB	Output is correct
53	Correct	1 ms	2396 KB	Output is correct
54	Correct	1 ms	2392 KB	Output is correct
55	Correct	1 ms	2548 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	1 ms	2396 KB	Output is correct
58	Correct	1 ms	2396 KB	Output is correct
59	Correct	1 ms	2392 KB	Output is correct
60	Correct	1 ms	2396 KB	Output is correct
61	Correct	1 ms	2396 KB	Output is correct
62	Correct	1 ms	2396 KB	Output is correct
63	Correct	1 ms	2396 KB	Output is correct
64	Correct	1 ms	2396 KB	Output is correct
65	Correct	19 ms	3164 KB	Output is correct
66	Correct	35 ms	7760 KB	Output is correct
67	Correct	31 ms	6260 KB	Output is correct
68	Correct	30 ms	6248 KB	Output is correct
69	Correct	30 ms	6224 KB	Output is correct
70	Correct	29 ms	6224 KB	Output is correct
71	Correct	30 ms	6248 KB	Output is correct
72	Correct	30 ms	6228 KB	Output is correct
73	Correct	29 ms	6224 KB	Output is correct
74	Correct	31 ms	6228 KB	Output is correct
75	Correct	30 ms	6228 KB	Output is correct
76	Correct	34 ms	6228 KB	Output is correct
77	Correct	37 ms	6228 KB	Output is correct
78	Correct	29 ms	6176 KB	Output is correct
79	Correct	29 ms	6228 KB	Output is correct
80	Correct	30 ms	6132 KB	Output is correct
81	Correct	30 ms	6228 KB	Output is correct
82	Correct	31 ms	6128 KB	Output is correct
83	Correct	29 ms	6372 KB	Output is correct
84	Correct	38 ms	6228 KB	Output is correct
85	Correct	29 ms	6228 KB	Output is correct
86	Correct	30 ms	6260 KB	Output is correct
87	Correct	29 ms	6224 KB	Output is correct
88	Correct	38 ms	6236 KB	Output is correct
89	Correct	36 ms	6232 KB	Output is correct
90	Correct	35 ms	6128 KB	Output is correct
91	Correct	30 ms	6260 KB	Output is correct
92	Correct	28 ms	6224 KB	Output is correct
93	Correct	40 ms	6244 KB	Output is correct
94	Correct	29 ms	6244 KB	Output is correct
95	Correct	27 ms	6244 KB	Output is correct
96	Correct	29 ms	6392 KB	Output is correct
97	Correct	29 ms	6228 KB	Output is correct
98	Correct	29 ms	6292 KB	Output is correct
99	Correct	29 ms	6132 KB	Output is correct
100	Correct	29 ms	6232 KB	Output is correct
101	Correct	31 ms	6256 KB	Output is correct
102	Correct	33 ms	6400 KB	Output is correct
103	Correct	30 ms	6228 KB	Output is correct

답안 #873122

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