oj.uz

Submission #792614

# Submission time Handle Problem Language Result Execution time Memory
792614 2023-07-25T07:26:40 Z vjudge1 Bitaro's travel (JOI23_travel) C++14
15 / 100
 154 ms 22668 KB 
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std ;
const ll N = 2e5 ;
ll n, q, x[N + 1], abu[N + 1] ;
bool flag ;
signed main()
{
    ios_base::sync_with_stdio( 0 ) ;
    cin.tie( 0 ) ;
    cout.tie( 0 ) ;
    cin >> n ;
    x[0] = -1e18 ;
    x[n + 1] = 1e18 ;
    for(ll i = 1 ; i <= n ; i++)
        cin >> x[i] ;
    for(ll i = 1 ; i < n ; i++)
        if(x[i + 1] - x[i] > 100)flag = 1 ;
    cin >> q ;
    if(q == 1)
    {
        ll ans = 0, pos ;
        cin >> pos ;
        set<ll> s_neg, s_pos ;
        for(ll i = 1 ; i <= n ; i++)
            s_pos.insert(x[i]), s_neg.insert(-x[i]) ;
        while(s_pos.size())
        {
            ll l = -1e18, r = 1e18 ;
            if(s_pos.lower_bound(pos) != s_pos.end())
                r = *s_pos.lower_bound(pos) ;
            if(s_neg.lower_bound(-pos) != s_neg.end())
                l = -(*s_neg.lower_bound(-pos)) ;
            if(pos - l <= r - pos)
            {
                ans += pos - l ;
                pos = l ;
                s_neg.erase(-l) ;
                s_pos.erase(l) ;
            }
            else
            {
                ans += r - pos ;
                pos = r ;
                s_neg.erase(-r) ;
                s_pos.erase(r) ;
            }
        }
        cout << ans ;
        return 0 ;
    }
    if(!flag)
    {
        for(int i = 1 ; i <= n ; i++)
        {
            int l = i - 1, r = i + 1, now = i ;
            while(x[now] - x[l] <= 100 && x[r] - x[now] <= 100)
                if(x[now] - x[l] <= x[r] - x[now])
                {
                    abu[i] += x[now] - x[l] ;
                    now = l ;
                    l-- ;
                }
                else
                {
                    abu[i] += x[r] - x[now] ;
                    now = r ;
                    r++ ;
                }
            if(l && r <= n)
            {
                if(x[now] - x[l] <= x[r] - x[now])
                    abu[i] += x[now] - x[1] ;
                else
                    abu[i] += x[n] - x[now] ;
            }
            abu[i] += x[n] - x[1] ;
        }
        while(q--)
        {
            int pos, l = 0, r = n + 1 ;
            cin >> pos ;
            while(l + 1 < r)
            {
                int mid = (l + r) >> 1 ;
                if(x[mid] <= pos)l = mid ;
                else r = mid ;
            }
            if(pos - x[l] <= x[r] - pos)
                cout << abu[l] + pos - x[l] ;
            else
                cout << abu[r] + x[r] - pos ;
            cout << '\n' ;
        }
    }
    return 0 ;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 488 KB Output is correct
3 Correct 2 ms 644 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 472 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 488 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 488 KB Output is correct
3 Correct 2 ms 644 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 472 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 488 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 137 ms 22560 KB Output is correct
18 Correct 131 ms 22476 KB Output is correct
19 Correct 148 ms 22464 KB Output is correct
20 Correct 130 ms 22588 KB Output is correct
21 Correct 130 ms 22480 KB Output is correct
22 Correct 137 ms 22668 KB Output is correct
23 Correct 123 ms 22632 KB Output is correct
24 Correct 124 ms 22520 KB Output is correct
25 Correct 154 ms 22572 KB Output is correct
26 Correct 133 ms 22592 KB Output is correct
27 Correct 125 ms 22576 KB Output is correct
28 Correct 131 ms 22592 KB Output is correct
29 Correct 125 ms 22520 KB Output is correct
30 Correct 126 ms 22544 KB Output is correct
31 Correct 138 ms 22584 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 84 ms 7376 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 488 KB Output is correct
3 Correct 2 ms 644 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 472 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 488 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 137 ms 22560 KB Output is correct
18 Correct 131 ms 22476 KB Output is correct
19 Correct 148 ms 22464 KB Output is correct
20 Correct 130 ms 22588 KB Output is correct
21 Correct 130 ms 22480 KB Output is correct
22 Correct 137 ms 22668 KB Output is correct
23 Correct 123 ms 22632 KB Output is correct
24 Correct 124 ms 22520 KB Output is correct
25 Correct 154 ms 22572 KB Output is correct
26 Correct 133 ms 22592 KB Output is correct
27 Correct 125 ms 22576 KB Output is correct
28 Correct 131 ms 22592 KB Output is correct
29 Correct 125 ms 22520 KB Output is correct
30 Correct 126 ms 22544 KB Output is correct
31 Correct 138 ms 22584 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Incorrect 84 ms 7376 KB Output isn't correct
39 Halted 0 ms 0 KB -