oj.uz

Submission #1042917

# Submission time Handle Problem Language Result Execution time Memory
1042917 2024-08-03T14:40:42 Z juicy Bitaro's travel (JOI23_travel) C++17
0 / 100
 257 ms 5156 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

const int N = 2e5 + 5;

int n, q;
int x[N];

int main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> x[i];
  }
  cin >> q;
  while (q--) {
    int s; cin >> s;
    int r = lower_bound(x + 1, x + n + 1, s) - x;
    int l = r - (x[r] != s);
    long long res = 0;
    while (1) {
      if (l == 1) {
        res += abs(s - x[n]);
        break;
      }
      if (r == n) {
        res += abs(s - x[1]);
        break;
      }
      int L = x[l - 1], R = x[r + 1];
      if (s - L <= R - s) {
        int nxt = lower_bound(x + 1, x + n + 1, 2 * s - R) - x;
        res += abs(s - x[nxt]);
        s = x[nxt];
        l = nxt;
      } else {
        int nxt = upper_bound(x + 1, x + n + 1, 2 * s - L) - x - 1;
        res += abs(s - x[nxt]);
        s = x[nxt];
        r = nxt;
      }
    }
    cout << res << "\n";
  }
  return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 257 ms 5156 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -