oj.uz

답안 #945598

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945598 2024-03-14T05:28:56 Z phoenix0423 Bitaro's travel (JOI23_travel) C++17
100 / 100
 348 ms 79128 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0);
#pragma GCC optimize("Ofast","unroll-loops")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define int long long
#define lowbit(x) x&-x
const int maxn = 3e5 + 5;
const int INF = 1e9 + 7;
int mn[maxn][20], mx[maxn][20];

signed main(void){
    fastio;
    int n;
    cin>>n;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin>>a[i];
    vector<int> b(n), c(n);
    for(int i = 0; i < n; i++){
        if(i == n - 1) mx[i][0] = INF;
        else mx[i][0] = 2 * a[i + 1] - a[i];
        if(!i) mn[i][0] = -INF;
        else mn[i][0] = 2 * a[i - 1] - a[i];
    }
    for(int i = 1; (1 << i) < n; i++){
        for(int j = 0; j + (1 << i) - 1 < n; j++){
            mx[j][i] = max(mx[j][i - 1], mx[j + (1 << (i - 1))][i - 1]);
            mn[j][i] = min(mn[j][i - 1], mn[j + (1 << (i - 1))][i - 1]);
        }
    }
    int q;
    cin>>q;
    auto get_max = [&](int l, int r) -> int{
        int len = __lg(r - l + 1);
        return max(mx[l][len], mx[r - (1 << len) + 1][len]);
    };
    auto get_min = [&](int l, int r) -> int{
        int len = __lg(r - l + 1);
        return min(mn[l][len], mn[r - (1 << len) + 1][len]);
    };
    auto find_first_grt = [&](int l, int r, int tar) -> int{
        if(mx[r][0] > tar) return r;
        l--;
        while(l + 1 < r){
            int m = (l + r) / 2;
            if(get_max(m, r) > tar) l = m;
            else r = m;
        }
        return l;
    };
    auto find_first_sm = [&](int l, int r, int tar) -> int{
        if(mn[l][0] <= tar) return l;
        r++;
        while(l + 1 < r){
            int m = (l + r) / 2;
            if(get_min(l, m) <= tar) r = m;
            else l = m;
        }
        return r;
    };
    while(q--){
        int x;
        cin>>x;
        int stp = lower_bound(a.begin(), a.end(), x) - a.begin();
        if(stp == n) stp--;
        if(stp != 0 && x - a[stp - 1] <= a[stp] - x) stp--;
        int l = stp, r = stp, ans = abs(x - a[stp]);
        int d = 0;
        while(true){
            if(l == 0 || r == n - 1){
                ans += a[n - 1] - a[0];
                break;
            }
            ans += a[r] - a[l];
            if(d == 0){
                int tmp = find_first_grt(0, l - 1, a[r + 1]);
                ans += a[l] - a[tmp + 1];
                l = tmp + 1;
            }
            else{
                int tmp = find_first_sm(r + 1, n - 1, a[l - 1]);
                ans += a[tmp - 1] - a[r];
                r = tmp - 1;
            }
            d ^= 1;
        }
        cout<<ans<<"\n";
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 4696 KB Output is correct
15 Correct 1 ms 4696 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 4696 KB Output is correct
15 Correct 1 ms 4696 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 78 ms 74932 KB Output is correct
18 Correct 63 ms 74980 KB Output is correct
19 Correct 61 ms 74968 KB Output is correct
20 Correct 63 ms 74976 KB Output is correct
21 Correct 65 ms 75088 KB Output is correct
22 Correct 62 ms 74984 KB Output is correct
23 Correct 64 ms 74836 KB Output is correct
24 Correct 60 ms 74840 KB Output is correct
25 Correct 62 ms 75040 KB Output is correct
26 Correct 62 ms 74844 KB Output is correct
27 Correct 63 ms 74844 KB Output is correct
28 Correct 64 ms 74972 KB Output is correct
29 Correct 63 ms 74844 KB Output is correct
30 Correct 60 ms 74832 KB Output is correct
31 Correct 61 ms 74844 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 138 ms 74344 KB Output is correct
8 Correct 144 ms 74292 KB Output is correct
9 Correct 138 ms 74320 KB Output is correct
10 Correct 135 ms 74324 KB Output is correct
11 Correct 141 ms 74344 KB Output is correct
12 Correct 148 ms 74364 KB Output is correct
13 Correct 31 ms 4444 KB Output is correct
14 Correct 22 ms 2908 KB Output is correct
15 Correct 140 ms 74832 KB Output is correct
16 Correct 141 ms 78040 KB Output is correct
17 Correct 140 ms 78020 KB Output is correct
18 Correct 31 ms 6236 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 4696 KB Output is correct
15 Correct 1 ms 4696 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 78 ms 74932 KB Output is correct
18 Correct 63 ms 74980 KB Output is correct
19 Correct 61 ms 74968 KB Output is correct
20 Correct 63 ms 74976 KB Output is correct
21 Correct 65 ms 75088 KB Output is correct
22 Correct 62 ms 74984 KB Output is correct
23 Correct 64 ms 74836 KB Output is correct
24 Correct 60 ms 74840 KB Output is correct
25 Correct 62 ms 75040 KB Output is correct
26 Correct 62 ms 74844 KB Output is correct
27 Correct 63 ms 74844 KB Output is correct
28 Correct 64 ms 74972 KB Output is correct
29 Correct 63 ms 74844 KB Output is correct
30 Correct 60 ms 74832 KB Output is correct
31 Correct 61 ms 74844 KB Output is correct
32 Correct 0 ms 2396 KB Output is correct
33 Correct 0 ms 2396 KB Output is correct
34 Correct 0 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 0 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 138 ms 74344 KB Output is correct
39 Correct 144 ms 74292 KB Output is correct
40 Correct 138 ms 74320 KB Output is correct
41 Correct 135 ms 74324 KB Output is correct
42 Correct 141 ms 74344 KB Output is correct
43 Correct 148 ms 74364 KB Output is correct
44 Correct 31 ms 4444 KB Output is correct
45 Correct 22 ms 2908 KB Output is correct
46 Correct 140 ms 74832 KB Output is correct
47 Correct 141 ms 78040 KB Output is correct
48 Correct 140 ms 78020 KB Output is correct
49 Correct 31 ms 6236 KB Output is correct
50 Correct 348 ms 79128 KB Output is correct
51 Correct 335 ms 79056 KB Output is correct
52 Correct 320 ms 78992 KB Output is correct
53 Correct 199 ms 79052 KB Output is correct
54 Correct 201 ms 79048 KB Output is correct
55 Correct 205 ms 78932 KB Output is correct
56 Correct 121 ms 78944 KB Output is correct
57 Correct 114 ms 78932 KB Output is correct
58 Correct 118 ms 78932 KB Output is correct