oj.uz

Submission #439711

# Submission time Handle Problem Language Result Execution time Memory
439711 2021-06-30T16:00:57 Z idontreallyknow Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 72 ms 5700 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define fi first
#define se second
#define SZ(x) ((int)((x).size()))
#define debug(x) cerr << #x << " = " << x << '\n'
const int mx = 1e5+5;
int ct[mx][2], tot[2];
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n;
    cin >> n;
    ll ans = 0;
    for (int q = 0; q < 2*n; q++) {
        int a,b;
        cin >> a >> b;
        int x = a, y = b;
        if (a < 1) ans += 1-a, x = 1;
        if (a > n) ans += a-n, x = n;
        if (b < 1) ans += 1-b, y = 1;
        if (b > 2) ans += b-2, y = 2;
        y--;
        ct[x][y]++;
    }
    for (int q = 1; q <= n; q++) for (int w = 0; w <= 1; w++) ct[q][w]--;
    int t = 0; //0 = coin, 1 = blank
    for (int q = 1; q <= n; q++) {
        ans += tot[0]+tot[1];
        if (t == 0) {
            if (ct[q][0] > 0) tot[0] += ct[q][0], ct[q][0] = 0;
            if (ct[q][1] > 0) tot[1] += ct[q][1], ct[q][1] = 0;
            if (ct[q][0] < 0 && tot[0] > 0) tot[0]--, ct[q][0] = 0;
            if (ct[q][1] < 0 && tot[1] > 0) tot[1]--, ct[q][1] = 0;
            if (ct[q][0] == -1 && tot[1] > 0) ans++, ct[q][0] = 0, tot[1]--;
            if (ct[q][1] == -1 && tot[0] > 0) ans++, ct[q][1] = 0, tot[0]--;
            if (ct[q][0] == -1 || ct[q][1] == -1) t = 1, tot[0] = -ct[q][0], tot[1] = -ct[q][1];
        } else {
            if (ct[q][0] < 0) tot[0]++, ct[q][0] = 0;
            if (ct[q][1] < 0) tot[1]++, ct[q][1] = 0;
            if (ct[q][0] > 0 && tot[0] > 0) {
                int x = min(ct[q][0], tot[0]);
                ct[q][0] -= x;
                tot[0] -= x;
            }
            if (ct[q][1] > 0 && tot[1] > 0) {
                int x = min(ct[q][1], tot[1]);
                ct[q][1] -= x;
                tot[1] -= x;
            }
            if (ct[q][1] > 0 && tot[0] > 0) {
                int x = min(ct[q][1], tot[0]);
                ct[q][1] -= x;
                tot[0] -= x;
                ans += x;
            }
            if (ct[q][0] > 0 && tot[1] > 0) {
                int x = min(ct[q][0], tot[1]);
                ct[q][0] -= x;
                tot[1] -= x;
                ans += x;
            }
            if (ct[q][0] > 0 || ct[q][1] > 0) t = 0, tot[0] = ct[q][0], tot[1] = ct[q][1];
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 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 1 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 1 ms 204 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 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 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 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 1 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 1 ms 204 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 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 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 360 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 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 336 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 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 356 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 336 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 332 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 332 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 2 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 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 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 1 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 1 ms 204 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 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 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 360 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 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 336 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 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 356 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 336 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 332 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 332 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 2 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 37 ms 2612 KB Output is correct
66 Correct 72 ms 5700 KB Output is correct
67 Correct 54 ms 4164 KB Output is correct
68 Correct 53 ms 4152 KB Output is correct
69 Correct 53 ms 4164 KB Output is correct
70 Correct 53 ms 4164 KB Output is correct
71 Correct 57 ms 4284 KB Output is correct
72 Correct 50 ms 4264 KB Output is correct
73 Correct 52 ms 4276 KB Output is correct
74 Correct 69 ms 4280 KB Output is correct
75 Correct 52 ms 4188 KB Output is correct
76 Correct 50 ms 4288 KB Output is correct
77 Correct 54 ms 4144 KB Output is correct
78 Correct 51 ms 4288 KB Output is correct
79 Correct 53 ms 4276 KB Output is correct
80 Correct 50 ms 4288 KB Output is correct
81 Correct 52 ms 4292 KB Output is correct
82 Correct 51 ms 4180 KB Output is correct
83 Correct 55 ms 4176 KB Output is correct
84 Correct 53 ms 4164 KB Output is correct
85 Correct 51 ms 4212 KB Output is correct
86 Correct 53 ms 4148 KB Output is correct
87 Correct 52 ms 4160 KB Output is correct
88 Correct 52 ms 4164 KB Output is correct
89 Correct 54 ms 4148 KB Output is correct
90 Correct 54 ms 4148 KB Output is correct
91 Correct 56 ms 4164 KB Output is correct
92 Correct 51 ms 4292 KB Output is correct
93 Correct 52 ms 4276 KB Output is correct
94 Correct 55 ms 4144 KB Output is correct
95 Correct 52 ms 4156 KB Output is correct
96 Correct 53 ms 4292 KB Output is correct
97 Correct 55 ms 4276 KB Output is correct
98 Correct 51 ms 4212 KB Output is correct
99 Correct 55 ms 4292 KB Output is correct
100 Correct 51 ms 4260 KB Output is correct
101 Correct 54 ms 4236 KB Output is correct
102 Correct 54 ms 4292 KB Output is correct
103 Correct 50 ms 4292 KB Output is correct