oj.uz

답안 #1089500

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089500 2024-09-16T15:30:23 Z ivan_alexeev Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 35 ms 4948 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;

#ifdef lisie_bimbi
#else
#define endl '\n'
#endif
typedef long long ll;

const int inf = 1000000000;

using namespace std;

#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,bmi2,fma,popcnt")


//#define int long long

int c[100000][2]{};

void solve(){
    int n;
    cin >> n;
    ll ans = 0;
    for(int i = 0; i < 2 * n; i++){
        int x, y;
        cin >> x >> y;
        int x1 = x, y1 = y;
        if(x <= 0){
            x = 1;
        }else if(x > n){
            x = n;
        }
        if(y <= 0){
            y = 1;
        }else if(y > 2){
            y = 2;
        }
        ans += abs(x1 - x) + abs(y1 - y);
        c[x - 1][y - 1]++;
    }
    int now1 = 0, now2 = 0;
    for(int i = 0; i < n; i++){
        now1 += c[i][0] - 1;
        now2 += c[i][1] - 1;
        if((now1 > 0) && (now2 < 0)){
            int k = min(now1, -now2);
            now1 -= k;
            now2 += k;
            ans += k;
        }else if((now1 < 0) && (now2 > 0)){
            int k = min(-now1, now2);
            now1 += k;
            now2 -= k;
            ans += k;
        }
        ans += abs(now1) + abs(now2);
    }
    cout << ans << endl;
}

signed main(){
#ifdef lisie_bimbi
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    cin.tie(nullptr)->sync_with_stdio(false);
#endif
    cout << setprecision(5) << fixed;
    int _ = 1;
    //cin >> t;
    while(_--){
        solve();
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 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 464 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 0 ms 468 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 0 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 468 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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 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 464 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 0 ms 468 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 0 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 468 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 348 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 500 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 0 ms 504 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 476 KB Output is correct
47 Correct 1 ms 500 KB Output is correct
48 Correct 1 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 508 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 500 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 0 ms 348 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 604 KB Output is correct
60 Correct 1 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 0 ms 348 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 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 464 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 0 ms 468 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 0 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 468 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 348 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 500 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 0 ms 504 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 476 KB Output is correct
47 Correct 1 ms 500 KB Output is correct
48 Correct 1 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 508 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 500 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 0 ms 348 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 604 KB Output is correct
60 Correct 1 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 0 ms 348 KB Output is correct
65 Correct 19 ms 2752 KB Output is correct
66 Correct 34 ms 4948 KB Output is correct
67 Correct 26 ms 4180 KB Output is correct
68 Correct 27 ms 4176 KB Output is correct
69 Correct 27 ms 4176 KB Output is correct
70 Correct 27 ms 4284 KB Output is correct
71 Correct 28 ms 4188 KB Output is correct
72 Correct 26 ms 3548 KB Output is correct
73 Correct 26 ms 3408 KB Output is correct
74 Correct 26 ms 3928 KB Output is correct
75 Correct 26 ms 3676 KB Output is correct
76 Correct 27 ms 3664 KB Output is correct
77 Correct 26 ms 3400 KB Output is correct
78 Correct 27 ms 3936 KB Output is correct
79 Correct 25 ms 3664 KB Output is correct
80 Correct 25 ms 3676 KB Output is correct
81 Correct 27 ms 3540 KB Output is correct
82 Correct 25 ms 3664 KB Output is correct
83 Correct 25 ms 3668 KB Output is correct
84 Correct 26 ms 3928 KB Output is correct
85 Correct 25 ms 3920 KB Output is correct
86 Correct 26 ms 4188 KB Output is correct
87 Correct 29 ms 4292 KB Output is correct
88 Correct 27 ms 4176 KB Output is correct
89 Correct 28 ms 4296 KB Output is correct
90 Correct 27 ms 4176 KB Output is correct
91 Correct 28 ms 4180 KB Output is correct
92 Correct 35 ms 4432 KB Output is correct
93 Correct 25 ms 4436 KB Output is correct
94 Correct 25 ms 4180 KB Output is correct
95 Correct 24 ms 4188 KB Output is correct
96 Correct 25 ms 4188 KB Output is correct
97 Correct 27 ms 4180 KB Output is correct
98 Correct 26 ms 4108 KB Output is correct
99 Correct 25 ms 3920 KB Output is correct
100 Correct 27 ms 4192 KB Output is correct
101 Correct 25 ms 3860 KB Output is correct
102 Correct 25 ms 3932 KB Output is correct
103 Correct 25 ms 3872 KB Output is correct