oj.uz

Submission #532041

# Submission time Handle Problem Language Result Execution time Memory
532041 2022-03-02T04:21:05 Z syl123456 Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 91 ms 10384 KB 
#include <bits/stdc++.h>
#define all(i) (i).begin(), (i).end()
using namespace std;
template<typename T1, typename ...T2>
void debug(bool _split, T1 i, T2 ...j) {
    if (_split)
        cerr << ", ";
    cerr << i;
    debug(true, j...);
}
#define debug(args...) cout << "Line" << __LINE__ << " : [" << #args << << "] is [" << debug(false, args) << "]" << endl;

typedef pair<int, int> pi;
typedef long long ll;

const int inf = 0x3f3f3f3f, lg = 20;
const ll mod = 1e9 + 7, INF = 0x3f3f3f3f;

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    ll ans = 0;
    vector<vector<int>> a(n + 1, vector<int>(2, -1));
    for (int i = 0; i < 2 * n; ++i) {
        int 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;
        --x, --y;
        ++a[x][y];
    }
    for (int i = 0; i < n; ++i) {
        if (a[i][0] > 0 && a[i][1] < 0) {
            int x = min(a[i][0], -a[i][1]);
            a[i][0] -= x, a[i][1] += x;
            ans += x;
        }
        else if (a[i][0] < 0 && a[i][1] > 0) {
            int x = min(-a[i][0], a[i][1]);
            a[i][0] += x, a[i][1] -= x;
            ans += x;
        }
        a[i + 1][0] += a[i][0], a[i + 1][1] += a[i][1];
        ans += abs(a[i][0]) + abs(a[i][1]);
    }
    cout << ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 308 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 308 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 312 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 308 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 308 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 312 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 420 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 396 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 2 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 324 KB Output is correct
50 Correct 1 ms 320 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 320 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 328 KB Output is correct
60 Correct 1 ms 320 KB Output is correct
61 Correct 1 ms 404 KB Output is correct
62 Correct 1 ms 460 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 308 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 308 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 312 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 420 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 396 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 2 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 324 KB Output is correct
50 Correct 1 ms 320 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 320 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 328 KB Output is correct
60 Correct 1 ms 320 KB Output is correct
61 Correct 1 ms 404 KB Output is correct
62 Correct 1 ms 460 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 44 ms 7228 KB Output is correct
66 Correct 62 ms 10384 KB Output is correct
67 Correct 69 ms 8896 KB Output is correct
68 Correct 62 ms 8848 KB Output is correct
69 Correct 72 ms 8844 KB Output is correct
70 Correct 56 ms 8832 KB Output is correct
71 Correct 91 ms 8836 KB Output is correct
72 Correct 43 ms 9028 KB Output is correct
73 Correct 47 ms 8968 KB Output is correct
74 Correct 72 ms 8972 KB Output is correct
75 Correct 59 ms 8772 KB Output is correct
76 Correct 56 ms 8972 KB Output is correct
77 Correct 59 ms 8840 KB Output is correct
78 Correct 46 ms 8916 KB Output is correct
79 Correct 48 ms 8888 KB Output is correct
80 Correct 44 ms 8964 KB Output is correct
81 Correct 51 ms 8968 KB Output is correct
82 Correct 45 ms 8844 KB Output is correct
83 Correct 46 ms 8900 KB Output is correct
84 Correct 54 ms 8852 KB Output is correct
85 Correct 48 ms 8832 KB Output is correct
86 Correct 65 ms 8900 KB Output is correct
87 Correct 51 ms 8836 KB Output is correct
88 Correct 55 ms 8880 KB Output is correct
89 Correct 50 ms 8844 KB Output is correct
90 Correct 56 ms 8836 KB Output is correct
91 Correct 70 ms 8840 KB Output is correct
92 Correct 75 ms 8968 KB Output is correct
93 Correct 65 ms 8964 KB Output is correct
94 Correct 82 ms 8836 KB Output is correct
95 Correct 77 ms 8848 KB Output is correct
96 Correct 57 ms 8960 KB Output is correct
97 Correct 50 ms 8968 KB Output is correct
98 Correct 57 ms 8972 KB Output is correct
99 Correct 56 ms 8860 KB Output is correct
100 Correct 51 ms 8896 KB Output is correct
101 Correct 67 ms 8836 KB Output is correct
102 Correct 65 ms 8968 KB Output is correct
103 Correct 69 ms 9032 KB Output is correct