Submission #1018594

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018594		NintsiChkhaidze	Bitaro's travel (JOI23_travel)	C++17	15 / 100	3090 ms	12548 KiB

travel

#include <bits/stdc++.h>
#define pb push_back
#define s second
#define f first
#define pb push_back
#define pii pair <int,int>
#define ll long long
#define left h*2,l,(l + r)/2
#define right h*2+1,(l + r)/2 + 1,r
using namespace std;

const int N = 3e5 + 5,mod = 1e9 + 7;
int a[N];

int main() {
  ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);

  int n;
  cin>>n;

  for (int i = 1; i <= n; i++){
    cin >> a[i];
  }

  int q;
  cin>>q;

  while (q--){
    multiset <int> st;
    for (int i = 1; i <= n; i++){
      st.insert(a[i]);
    }

    int s;
    cin>>s;

    int ans = 0;
    while (st.size()){
      multiset <int> :: iterator it = st.lower_bound(s);
      int l = -1,r = -1;
      if (it != st.end()) {
        r = *it;
      }
      if (it != st.begin()){
        --it;
        l = *it;
      }

      if (l == -1 || (l != -1 && r != -1 && (r - s) < (s - l))) {
        st.erase(st.find(r));
        ans += abs(r - s);
        s = r;
      }else if (r == -1 || (l != -1 && r != -1 && (s - l) <= (r - s))){
        st.erase(st.find(l));
        ans += abs(s - l);
        s = l;
      }
    }

    cout<<ans<<endl;
  }
}

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