oj.uz

Submission #890874

# Submission time Handle Problem Language Result Execution time Memory
890874 2023-12-22T04:43:18 Z vjudge1 Bitaro's travel (JOI23_travel) C++17
15 / 100
 102 ms 12636 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    vector <int> X(n);
    for ( auto &u: X ) cin >> u;
    int q; cin >> q;
    vector <int> S(q);
    for ( auto &u: S ) cin >> u;
    if ( q == 1 ){
        int x = S[0];
        const int inf = 1e15;
        set <int> st{-inf, inf};
        for ( int i = 0; i < n; i++ ){
            st.insert(X[i]);
        }
        int ans = 0;
        while ( st.size() > 2 ){
            auto it = st.lower_bound(x);
            assert(*prev(it) <= x && *it >= x);
            if ( abs(*prev(it) - x) <= abs(*it - x) ){
                ans += x - *prev(it);
                x = *prev(it);
                st.erase(prev(it));
            } else{
                ans += -x + *it;
                x = *it;
                st.erase(it);
            }
        }
        cout << ans << ln;
        return 0;
    }
    for ( auto &xx: S ){
        int it = lower_bound(all(X), xx) - X.begin();
        if ( it - 1 >= 0 && (it == n || X[it] - xx >= xx - X[it - 1]) ) --it;
        int ans = abs(X[it] - xx), l = it - 1, r = it + 1, x = X[it];
        while ( l >= 0 || r < n ){
            if ( l < 0 ){
                ans += abs(X.back() - x);
                break;
            } else if ( r >= n ){
                ans += abs(X[0] - x);
                break;
            } else{
                if ( abs(X[r] - x) >= 100 ){
                    ans += abs(X[0] - x);
                    x = X[0]; l = -1;
                    continue;
                }
                if ( abs(X[l] - x) > 100 ){
                    ans += abs(X.back() - x);
                    x = X.back(); r = n;
                    continue;
                }
                if ( abs(X[l] - x) <= abs(X[r] - x) ){
                    ans += abs(X[l] - x);
                    x = X[l--];
                } else{
                    ans += abs(X[r] - x);
                    x = X[r++];
                }
            }
        }
        cout << ans << ln;
    }

    cout << '\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 412 KB Output is correct
7 Correct 1 ms 500 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 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 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 412 KB Output is correct
7 Correct 1 ms 500 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 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 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 60 ms 12628 KB Output is correct
18 Correct 64 ms 12552 KB Output is correct
19 Correct 61 ms 12636 KB Output is correct
20 Correct 66 ms 12464 KB Output is correct
21 Correct 60 ms 12628 KB Output is correct
22 Correct 64 ms 12520 KB Output is correct
23 Correct 58 ms 12624 KB Output is correct
24 Correct 59 ms 12628 KB Output is correct
25 Correct 61 ms 12600 KB Output is correct
26 Correct 61 ms 12504 KB Output is correct
27 Correct 60 ms 12488 KB Output is correct
28 Correct 60 ms 12524 KB Output is correct
29 Correct 59 ms 12508 KB Output is correct
30 Correct 59 ms 12484 KB Output is correct
31 Correct 59 ms 12636 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 91 ms 4872 KB Output is correct
8 Correct 95 ms 4864 KB Output is correct
9 Correct 90 ms 4944 KB Output is correct
10 Correct 92 ms 4948 KB Output is correct
11 Correct 102 ms 4796 KB Output is correct
12 Correct 98 ms 4804 KB Output is correct
13 Correct 30 ms 3920 KB Output is correct
14 Correct 22 ms 2392 KB Output is correct
15 Incorrect 62 ms 5224 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 412 KB Output is correct
7 Correct 1 ms 500 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 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 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 60 ms 12628 KB Output is correct
18 Correct 64 ms 12552 KB Output is correct
19 Correct 61 ms 12636 KB Output is correct
20 Correct 66 ms 12464 KB Output is correct
21 Correct 60 ms 12628 KB Output is correct
22 Correct 64 ms 12520 KB Output is correct
23 Correct 58 ms 12624 KB Output is correct
24 Correct 59 ms 12628 KB Output is correct
25 Correct 61 ms 12600 KB Output is correct
26 Correct 61 ms 12504 KB Output is correct
27 Correct 60 ms 12488 KB Output is correct
28 Correct 60 ms 12524 KB Output is correct
29 Correct 59 ms 12508 KB Output is correct
30 Correct 59 ms 12484 KB Output is correct
31 Correct 59 ms 12636 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 91 ms 4872 KB Output is correct
39 Correct 95 ms 4864 KB Output is correct
40 Correct 90 ms 4944 KB Output is correct
41 Correct 92 ms 4948 KB Output is correct
42 Correct 102 ms 4796 KB Output is correct
43 Correct 98 ms 4804 KB Output is correct
44 Correct 30 ms 3920 KB Output is correct
45 Correct 22 ms 2392 KB Output is correct
46 Incorrect 62 ms 5224 KB Output isn't correct
47 Halted 0 ms 0 KB -