oj.uz

답안 #1006584

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1006584 2024-06-24T04:11:15 Z _callmelucian Coin Collecting (JOI19_ho_t4) C++14
100 / 100
 35 ms 5716 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tt;

#define all(a) a.begin(), a.end()
#define filter(a) a.erase(unique(all(a)), a.end())

const int mn = 1e5 + 5;
int cnt[3][mn];

ll dist (ll x1, ll y1, ll x2, ll y2) {
    return abs(x1 - x2) + abs(y1 - y2);
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n; ll ans = 0; cin >> n;
    for (int i = 1; i <= 2 * n; i++) {
        int x, y; cin >> x >> y;
        int r = (y >= 2 ? 2 : 1), c = (x <= 1 ? 1 : (x >= n ? n : x));
        cnt[r][c]++, ans += dist(y, x, r, c);
    }
    for (int i = 1; i <= n; i++) cnt[1][i]--, cnt[2][i]--;

    for (int i = 1; i <= n; i++) {
        if (cnt[1][i] > 0 && cnt[2][i] < 0) {
            // pass from row 1 to 2
            int pass = min(cnt[1][i], -cnt[2][i]);
            cnt[1][i] -= pass, cnt[2][i] += pass, ans += pass;
        }
        if (cnt[1][i] < 0 && cnt[2][i] > 0) {
            // pass from row 2 to 1
            int pass = min(-cnt[1][i], cnt[2][i]);
            cnt[1][i] += pass, cnt[2][i] -= pass, ans += pass;
        }
        if (i < n) {
            // pass from column i to i + 1 (also pass "debt")
            cnt[1][i + 1] += cnt[1][i], cnt[2][i + 1] += cnt[2][i];
            ans += abs(cnt[1][i]) + abs(cnt[2][i]);
        }
    }

    cout << ans;

    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 652 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 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 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 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 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 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 0 ms 348 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 652 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 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 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 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 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 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 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 516 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 508 KB Output is correct
42 Correct 1 ms 500 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 416 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 0 ms 348 KB Output is correct
51 Correct 0 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 348 KB Output is correct
55 Correct 1 ms 496 KB Output is correct
56 Correct 0 ms 504 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 348 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 348 KB Output is correct
2 Correct 0 ms 652 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 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 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 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 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 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 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 516 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 508 KB Output is correct
42 Correct 1 ms 500 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 416 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 0 ms 348 KB Output is correct
51 Correct 0 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 348 KB Output is correct
55 Correct 1 ms 496 KB Output is correct
56 Correct 0 ms 504 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 348 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 18 ms 2760 KB Output is correct
66 Correct 30 ms 5716 KB Output is correct
67 Correct 33 ms 4180 KB Output is correct
68 Correct 28 ms 4184 KB Output is correct
69 Correct 27 ms 4172 KB Output is correct
70 Correct 27 ms 4188 KB Output is correct
71 Correct 28 ms 4184 KB Output is correct
72 Correct 26 ms 4180 KB Output is correct
73 Correct 26 ms 4184 KB Output is correct
74 Correct 25 ms 4180 KB Output is correct
75 Correct 25 ms 4188 KB Output is correct
76 Correct 27 ms 4184 KB Output is correct
77 Correct 25 ms 4180 KB Output is correct
78 Correct 25 ms 4184 KB Output is correct
79 Correct 25 ms 4180 KB Output is correct
80 Correct 30 ms 4436 KB Output is correct
81 Correct 26 ms 4192 KB Output is correct
82 Correct 26 ms 4236 KB Output is correct
83 Correct 26 ms 4180 KB Output is correct
84 Correct 26 ms 4180 KB Output is correct
85 Correct 26 ms 4180 KB Output is correct
86 Correct 35 ms 4180 KB Output is correct
87 Correct 26 ms 4308 KB Output is correct
88 Correct 27 ms 4180 KB Output is correct
89 Correct 28 ms 4180 KB Output is correct
90 Correct 28 ms 4180 KB Output is correct
91 Correct 27 ms 4180 KB Output is correct
92 Correct 26 ms 4440 KB Output is correct
93 Correct 27 ms 4284 KB Output is correct
94 Correct 26 ms 4176 KB Output is correct
95 Correct 25 ms 4180 KB Output is correct
96 Correct 26 ms 4436 KB Output is correct
97 Correct 26 ms 4288 KB Output is correct
98 Correct 27 ms 4364 KB Output is correct
99 Correct 28 ms 4180 KB Output is correct
100 Correct 27 ms 4444 KB Output is correct
101 Correct 26 ms 4284 KB Output is correct
102 Correct 29 ms 4420 KB Output is correct
103 Correct 26 ms 4444 KB Output is correct