oj.uz

답안 #792676

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792676 2023-07-25T08:01:41 Z vjudge1 Bitaro's travel (JOI23_travel) C++14
45 / 100
 138 ms 20908 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 + 2], abu[N + 2] ;
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(ll i = 1 ; i <= n ; i++)
        {
            ll l = i - 1, r = i + 1, now = i ;
            while(x[now] - x[l] <= 100ll && x[r] - x[now] <= 100ll)
                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] <= 100)
                    abu[i] += x[now] - x[1] ;
                else
                    abu[i] += x[n] - x[now] ;
            }
            abu[i] += x[n] - x[1] ;
        }
        while(q--)
        {
            ll pos, l = 0, r = n + 1 ;
            cin >> pos ;
            while(l + 1 < r)
            {
                ll 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 ;
}
//7
//0 90 97 100 103 126 226
//2
//100
//100

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 460 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 2 ms 468 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 464 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 460 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 2 ms 468 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 122 ms 20760 KB Output is correct
18 Correct 128 ms 20792 KB Output is correct
19 Correct 135 ms 20684 KB Output is correct
20 Correct 135 ms 20784 KB Output is correct
21 Correct 134 ms 20800 KB Output is correct
22 Correct 133 ms 20672 KB Output is correct
23 Correct 120 ms 20676 KB Output is correct
24 Correct 138 ms 20796 KB Output is correct
25 Correct 127 ms 20728 KB Output is correct
26 Correct 126 ms 20668 KB Output is correct
27 Correct 128 ms 20744 KB Output is correct
28 Correct 129 ms 20784 KB Output is correct
29 Correct 129 ms 20784 KB Output is correct
30 Correct 125 ms 20908 KB Output is correct
31 Correct 125 ms 20780 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 81 ms 4796 KB Output is correct
8 Correct 90 ms 7332 KB Output is correct
9 Correct 87 ms 7352 KB Output is correct
10 Correct 80 ms 7372 KB Output is correct
11 Correct 94 ms 7292 KB Output is correct
12 Correct 82 ms 7304 KB Output is correct
13 Correct 31 ms 4196 KB Output is correct
14 Correct 22 ms 1440 KB Output is correct
15 Correct 59 ms 8388 KB Output is correct
16 Correct 60 ms 8356 KB Output is correct
17 Correct 63 ms 8380 KB Output is correct
18 Correct 40 ms 4156 KB Output is correct

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 460 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 2 ms 468 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 122 ms 20760 KB Output is correct
18 Correct 128 ms 20792 KB Output is correct
19 Correct 135 ms 20684 KB Output is correct
20 Correct 135 ms 20784 KB Output is correct
21 Correct 134 ms 20800 KB Output is correct
22 Correct 133 ms 20672 KB Output is correct
23 Correct 120 ms 20676 KB Output is correct
24 Correct 138 ms 20796 KB Output is correct
25 Correct 127 ms 20728 KB Output is correct
26 Correct 126 ms 20668 KB Output is correct
27 Correct 128 ms 20744 KB Output is correct
28 Correct 129 ms 20784 KB Output is correct
29 Correct 129 ms 20784 KB Output is correct
30 Correct 125 ms 20908 KB Output is correct
31 Correct 125 ms 20780 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 81 ms 4796 KB Output is correct
39 Correct 90 ms 7332 KB Output is correct
40 Correct 87 ms 7352 KB Output is correct
41 Correct 80 ms 7372 KB Output is correct
42 Correct 94 ms 7292 KB Output is correct
43 Correct 82 ms 7304 KB Output is correct
44 Correct 31 ms 4196 KB Output is correct
45 Correct 22 ms 1440 KB Output is correct
46 Correct 59 ms 8388 KB Output is correct
47 Correct 60 ms 8356 KB Output is correct
48 Correct 63 ms 8380 KB Output is correct
49 Correct 40 ms 4156 KB Output is correct
50 Incorrect 16 ms 3980 KB Output isn't correct
51 Halted 0 ms 0 KB -