Submission #1172435

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172435		Zero_OP	Bitaro's travel (JOI23_travel)	C++20	15 / 100	3094 ms	1304 KiB

travel

#include <bits/stdc++.h>

using namespace std;

#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r)-1; i >= (l); --i)

#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define sz(v) (int)v.size()
#define pb push_back
#define eb emplace_back
#define compact(v) v.erase(unique(all(v)), end(v))

#define dbg(x) "[" #x " = " << (x) << "]"

template<typename T>
      bool minimize(T& a, const T& b){
            if(a > b) return a = b, true;
            return false;
      }

template<typename T>
      bool maximize(T& a, const T& b){
            if(a < b) return a = b, true;
            return false;
      }

typedef long long ll;

using db = double;
using ull = unsigned long long;

using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;

using vi = vector<int>;
using vl = vector<ll>;
using vc = vector<char>;
using vd = vector<db>;
using vb = vector<bool>;

using vpi = vector<pi>;
using vpl = vector<pl>;

void setIO(){
      ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
      freopen("task.inp", "r", stdin);
      freopen("task.out", "w", stdout);
#endif
}


int main(){
      setIO();

      int N;
      cin >> N;
      vi X(N);
      FOR(i, 0, N) cin >> X[i];

      int Q;
      cin >> Q;
      while(Q--){
            int S;
            cin >> S;

            int st = -1;
            int pos = lower_bound(all(X), S) - X.begin();
            if(pos == N){
                  st = pos-1;
            } else if(pos == 0){
                  st = 0;
            } else{
                  if(S - X[pos-1] <= X[pos] - S) st = pos-1;
                  else st = pos;
            }

            ll ans = abs(S - X[st]);
            int l = st, r = st, cur = l;
            while(l > 0 || r + 1 < N){
//                  cout << l << ' ' << r << '\n';
                  if(l == 0) {
//                        cout << dbg(X[r]) << dbg(X[r+1]) << '\n';
                        ans += (X[r+1] - X[cur]), ++r, cur = r;
                  }
                  else if(r == N) {
//                        cout << dbg(X[l]) << dbg(X[l-1]) << '\n';
                        ans += (X[l-1] - X[cur]), --l, cur = l;
                  }
                  else{
                        if(abs(X[l-1] - X[cur]) <= abs(X[r+1] - X[cur])){
//                              cout << dbg(X[cur]) << dbg(X[l-1]) << '\n';
                              ans += abs(X[l-1] - X[cur]);
                              cur = l-1;
                              --l;
                        } else{
//                              cout << dbg(X[cur]) << dbg(X[r+1]) << '\n';
                              ans += abs(X[r+1] - X[cur]);
                              cur = r+1;
                              ++r;
                        }
                  }
            }
            cout << ans << '\n';
      }

      return 0;
}

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