제출 #966656

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
966656		angella	Bitaro's travel (JOI23_travel)	C++17	100 / 100	410 ms	8328 KiB

travel

/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

int n, q;
vector<ll> vec;
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

    cin>>n;
    for(ll x,i=1; i<=n; i++) {
        cin>>x; vec.pb(x);
    }

    cin>>q;
    while(q--) {
        ll x; cin>>x;
        ll ans = 0;
        
        int r=lower_bound(all(vec), x+1) - vec.begin() + 1;
        int l = r-1;
        
        while(true) {
            // cout<<l<<' '<<r<<endl;
            if(l == 0) {
                ans += (vec.back() - x);
                break;
            }
            if(r == n+1) {
                ans += (x - vec[0]);
                break;
            }
            if(vec[r-1]-x < x-vec[l-1]) {
                r = lower_bound(all(vec), x+(x-vec[l-1])) - vec.begin() + 1;
                ans += (vec[r-2]-x);
                x = vec[r-2];
            } else {
                l = lower_bound(all(vec), x-(vec[r-1]-x)) - vec.begin();
                ans += (x-vec[l]);
                x = vec[l];
            }
        }
        cout<<ans<<endl;
    }

	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 30 / 30
• Subtask 4: 55 / 55