oj.uz

답안 #792629

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792629 2023-07-25T07:36:10 Z vjudge1 Bitaro's travel (JOI23_travel) C++14
15 / 100
 155 ms 20672 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(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] <= 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--)
        {
            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 ;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 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 468 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 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 468 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 1 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 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 468 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 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 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 142 ms 20656 KB Output is correct
18 Correct 129 ms 20656 KB Output is correct
19 Correct 141 ms 20656 KB Output is correct
20 Correct 130 ms 20652 KB Output is correct
21 Correct 126 ms 20664 KB Output is correct
22 Correct 154 ms 20672 KB Output is correct
23 Correct 130 ms 20564 KB Output is correct
24 Correct 139 ms 20660 KB Output is correct
25 Correct 135 ms 20612 KB Output is correct
26 Correct 155 ms 20664 KB Output is correct
27 Correct 142 ms 20656 KB Output is correct
28 Correct 135 ms 20664 KB Output is correct
29 Correct 131 ms 20656 KB Output is correct
30 Correct 123 ms 20664 KB Output is correct
31 Correct 131 ms 20660 KB Output is correct

Subtask #3
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 1 ms 212 KB Output is correct
7 Incorrect 89 ms 4836 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 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 468 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 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 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 142 ms 20656 KB Output is correct
18 Correct 129 ms 20656 KB Output is correct
19 Correct 141 ms 20656 KB Output is correct
20 Correct 130 ms 20652 KB Output is correct
21 Correct 126 ms 20664 KB Output is correct
22 Correct 154 ms 20672 KB Output is correct
23 Correct 130 ms 20564 KB Output is correct
24 Correct 139 ms 20660 KB Output is correct
25 Correct 135 ms 20612 KB Output is correct
26 Correct 155 ms 20664 KB Output is correct
27 Correct 142 ms 20656 KB Output is correct
28 Correct 135 ms 20664 KB Output is correct
29 Correct 131 ms 20656 KB Output is correct
30 Correct 123 ms 20664 KB Output is correct
31 Correct 131 ms 20660 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 1 ms 212 KB Output is correct
38 Incorrect 89 ms 4836 KB Output isn't correct
39 Halted 0 ms 0 KB -