oj.uz

Submission #1063984

# Submission time Handle Problem Language Result Execution time Memory
1063984 2024-08-18T07:24:41 Z _8_8_ Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 34 ms 6236 KB 
#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
const int  N = 1e6 + 12, MOD = (int)1e9 + 7;
#define int ll
int n;
int c[N][3],a[N];
int dist(int x,int y,int x1,int y1) {
    return abs(x - x1) + abs(y - y1);
}
ll ans = 0;
void test() {
    cin >> n;
    for(int i = 1;i <= n + n;i++) {
        int a,b;
        cin >> a >> b;
        int x = 1,y = 1;
        auto upd = [&](int x1,int y1) {
            if(dist(x1,y1,a,b) < dist(x,y,a,b)) {
                x = x1;
                y = y1;
            }
        };
        upd(1,2);
        upd(n,1);
        upd(n,2);
        if(a >= 1 && a <= n) {
            upd(a,1);
            upd(a,2);
        }
        if(b >= 1 && b <= 2) {
            upd(1,b);
            upd(n,b);
        }
        c[x][y]++;
        ans += dist(x,y,a,b);
    }
    int x = 0,y = 0;
    for(int i = 1;i <= n;i++) { 
        x += (c[i][1] - 1);
        y += (c[i][2] - 1);
        if(x < 0 && y > 0) {
            int c = min(abs(x),abs(y));
            ans += c;
            x += c;
            y -=c ;
        } else if(x > 0 && y < 0) {
            int c = min(abs(x),abs(y));
            ans += c;
            x -= c;
            y +=c ;
        }
        ans += abs(x);
        ans += abs(y);
    }
    cout << ans;
}
signed main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--) {
        test();
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 468 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 1 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 468 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 432 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 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 1 ms 352 KB Output is correct
33 Correct 0 ms 344 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 468 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 1 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 468 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 432 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 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 1 ms 352 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 484 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 356 KB Output is correct
59 Correct 0 ms 360 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 1 ms 352 KB Output is correct
64 Correct 1 ms 360 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 468 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 1 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 468 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 432 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 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 1 ms 352 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 484 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 356 KB Output is correct
59 Correct 0 ms 360 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 1 ms 352 KB Output is correct
64 Correct 1 ms 360 KB Output is correct
65 Correct 21 ms 4184 KB Output is correct
66 Correct 29 ms 4948 KB Output is correct
67 Correct 29 ms 5972 KB Output is correct
68 Correct 27 ms 5980 KB Output is correct
69 Correct 29 ms 5972 KB Output is correct
70 Correct 28 ms 5856 KB Output is correct
71 Correct 29 ms 5972 KB Output is correct
72 Correct 25 ms 3664 KB Output is correct
73 Correct 26 ms 3676 KB Output is correct
74 Correct 25 ms 3668 KB Output is correct
75 Correct 25 ms 3420 KB Output is correct
76 Correct 28 ms 3676 KB Output is correct
77 Correct 26 ms 3412 KB Output is correct
78 Correct 25 ms 3532 KB Output is correct
79 Correct 31 ms 3652 KB Output is correct
80 Correct 30 ms 3676 KB Output is correct
81 Correct 27 ms 3616 KB Output is correct
82 Correct 29 ms 3676 KB Output is correct
83 Correct 26 ms 3704 KB Output is correct
84 Correct 26 ms 3932 KB Output is correct
85 Correct 26 ms 3760 KB Output is correct
86 Correct 26 ms 5468 KB Output is correct
87 Correct 28 ms 5512 KB Output is correct
88 Correct 28 ms 6224 KB Output is correct
89 Correct 30 ms 5980 KB Output is correct
90 Correct 29 ms 5980 KB Output is correct
91 Correct 28 ms 5736 KB Output is correct
92 Correct 30 ms 6236 KB Output is correct
93 Correct 27 ms 6028 KB Output is correct
94 Correct 27 ms 5716 KB Output is correct
95 Correct 26 ms 5724 KB Output is correct
96 Correct 34 ms 5144 KB Output is correct
97 Correct 26 ms 5208 KB Output is correct
98 Correct 27 ms 5032 KB Output is correct
99 Correct 27 ms 4696 KB Output is correct
100 Correct 28 ms 4772 KB Output is correct
101 Correct 29 ms 4980 KB Output is correct
102 Correct 26 ms 4692 KB Output is correct
103 Correct 26 ms 4688 KB Output is correct