oj.uz

답안 #878784

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
878784 2023-11-25T08:25:29 Z frostray8653 Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 39 ms 11648 KB 
#include <bits/stdc++.h>
#define int long long
#define IO ios::sync_with_stdio(0), cin.tie(0)
#define FOR(i, a, b) for (int i = a, I = b; i <= I; i++)
using namespace std;
using pii = pair<int, int>;
void dbg() {;}
template<class T, class ...U>
void dbg(T a, U ...b) { cout << a << " "; dbg(b...); }
void ent() { cout << "\n"; }

const int N = 200005;
pii a[N];

int mp[N][3];

signed main() {
    IO;

    int n;
    cin >> n;
    FOR(i, 1, 2 * n) cin >> a[i].first >> a[i].second;
    
    int ans = 0;
    FOR(i, 1, 2 * n) {
        auto [x, y] = a[i];
        int tarx, tary;
        if (x <= 1) tarx = 1;
        else if (x >= n) tarx = n;
        else tarx = x;

        if (y <= 1) tary = 1;
        else tary = 2;

        ans += abs(tarx - x) + abs(tary - y);
        mp[tarx][tary] += 1;
    }

    int U_cnt = 0;
    int D_cnt = 0;
    FOR(i, 1, n) {
        if (mp[i][1] == 0)
            D_cnt += 1;
        if (mp[i][2] == 0)
            U_cnt += 1;

        if (mp[i][1] > 1) {
            if (D_cnt > 0) {
                int dif = min(mp[i][1] - 1, D_cnt);
                D_cnt -= dif;
                mp[i][1] -= dif;
            }
        }
        if (mp[i][2] > 1) {
            if (U_cnt > 0) {
                int dif = min(mp[i][2] - 1, U_cnt);
                U_cnt -= dif;
                mp[i][2] -= dif;
            }
        }
        if (mp[i][1] > 1) {
            if (U_cnt > 0) {
                int dif = min(mp[i][1] - 1, U_cnt);
                U_cnt -= dif;
                mp[i][1] -= dif;
                ans += dif;
            }
        }
        if (mp[i][2] > 1) {
            if (D_cnt > 0) {
                int dif = min(mp[i][2] - 1, D_cnt);
                D_cnt -= dif;
                mp[i][2] -= dif;
                ans += dif;
            }
        }
        if (mp[i][1] > 1) {
            ans += mp[i][1] - 1;
            mp[i + 1][1] += mp[i][1] - 1;
            mp[i][1] = 1;
        }
        if (mp[i][2] > 1) {
            ans += mp[i][2] - 1;
            mp[i + 1][2] += mp[i][2] - 1;
            mp[i][2] = 1;
        }
        ans += U_cnt + D_cnt;
    }
    cout << ans << "\n";

    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2508 KB Output is correct
25 Correct 1 ms 2396 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 1 ms 2396 KB Output is correct
31 Correct 0 ms 2396 KB Output is correct
32 Correct 0 ms 2396 KB Output is correct
33 Correct 0 ms 2512 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2508 KB Output is correct
25 Correct 1 ms 2396 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 1 ms 2396 KB Output is correct
31 Correct 0 ms 2396 KB Output is correct
32 Correct 0 ms 2396 KB Output is correct
33 Correct 0 ms 2512 KB Output is correct
34 Correct 1 ms 2396 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 2652 KB Output is correct
38 Correct 1 ms 2396 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 2396 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 1 ms 2780 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 2396 KB Output is correct
49 Correct 1 ms 2592 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 1 ms 2392 KB Output is correct
54 Correct 1 ms 2396 KB Output is correct
55 Correct 1 ms 2396 KB Output is correct
56 Correct 1 ms 2396 KB Output is correct
57 Correct 2 ms 2396 KB Output is correct
58 Correct 1 ms 2396 KB Output is correct
59 Correct 1 ms 2396 KB Output is correct
60 Correct 1 ms 2648 KB Output is correct
61 Correct 1 ms 2396 KB Output is correct
62 Correct 1 ms 2392 KB Output is correct
63 Correct 1 ms 2648 KB Output is correct
64 Correct 1 ms 2396 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2508 KB Output is correct
25 Correct 1 ms 2396 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 1 ms 2396 KB Output is correct
31 Correct 0 ms 2396 KB Output is correct
32 Correct 0 ms 2396 KB Output is correct
33 Correct 0 ms 2512 KB Output is correct
34 Correct 1 ms 2396 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 2652 KB Output is correct
38 Correct 1 ms 2396 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 2396 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 1 ms 2780 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 2396 KB Output is correct
49 Correct 1 ms 2592 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 1 ms 2392 KB Output is correct
54 Correct 1 ms 2396 KB Output is correct
55 Correct 1 ms 2396 KB Output is correct
56 Correct 1 ms 2396 KB Output is correct
57 Correct 2 ms 2396 KB Output is correct
58 Correct 1 ms 2396 KB Output is correct
59 Correct 1 ms 2396 KB Output is correct
60 Correct 1 ms 2648 KB Output is correct
61 Correct 1 ms 2396 KB Output is correct
62 Correct 1 ms 2392 KB Output is correct
63 Correct 1 ms 2648 KB Output is correct
64 Correct 1 ms 2396 KB Output is correct
65 Correct 20 ms 9820 KB Output is correct
66 Correct 35 ms 10832 KB Output is correct
67 Correct 30 ms 11328 KB Output is correct
68 Correct 30 ms 11344 KB Output is correct
69 Correct 30 ms 11348 KB Output is correct
70 Correct 37 ms 11368 KB Output is correct
71 Correct 29 ms 11348 KB Output is correct
72 Correct 30 ms 11132 KB Output is correct
73 Correct 30 ms 11076 KB Output is correct
74 Correct 39 ms 11088 KB Output is correct
75 Correct 29 ms 11332 KB Output is correct
76 Correct 29 ms 11088 KB Output is correct
77 Correct 29 ms 11092 KB Output is correct
78 Correct 29 ms 11092 KB Output is correct
79 Correct 29 ms 11088 KB Output is correct
80 Correct 30 ms 11088 KB Output is correct
81 Correct 29 ms 11096 KB Output is correct
82 Correct 29 ms 11344 KB Output is correct
83 Correct 29 ms 11072 KB Output is correct
84 Correct 29 ms 11344 KB Output is correct
85 Correct 29 ms 11348 KB Output is correct
86 Correct 29 ms 11348 KB Output is correct
87 Correct 29 ms 11348 KB Output is correct
88 Correct 33 ms 11648 KB Output is correct
89 Correct 39 ms 11348 KB Output is correct
90 Correct 30 ms 11372 KB Output is correct
91 Correct 30 ms 11356 KB Output is correct
92 Correct 29 ms 11348 KB Output is correct
93 Correct 29 ms 11348 KB Output is correct
94 Correct 28 ms 11356 KB Output is correct
95 Correct 28 ms 11344 KB Output is correct
96 Correct 29 ms 11092 KB Output is correct
97 Correct 29 ms 11092 KB Output is correct
98 Correct 29 ms 9300 KB Output is correct
99 Correct 29 ms 9300 KB Output is correct
100 Correct 29 ms 9348 KB Output is correct
101 Correct 30 ms 9300 KB Output is correct
102 Correct 32 ms 11308 KB Output is correct
103 Correct 29 ms 9308 KB Output is correct