oj.uz

Submission #966605

# Submission time Handle Problem Language Result Execution time Memory
966605 2024-04-20T06:26:27 Z abczz Bitaro's travel (JOI23_travel) C++14
15 / 100
 433 ms 18516 KB 
#include <iostream>
#include <array>
#define ll long long

using namespace std;

bool dir;
ll n, q, a, f, l, r, x, mid, A[200000], L[200000], R[200000];

struct SegTree{
  array <ll, 2> st[800000];
  void build(ll id, ll l, ll r) {
    if (l == r) {
      st[id] = {L[l], R[l]};
      return;
    }
    ll mid = (l+r)/2;
    build(id*2, l, mid);
    build(id*2+1, mid+1, r);
    st[id][0] = max(st[id*2][0], st[id*2+1][0]);
    st[id][1] = min(st[id*2][1], st[id*2+1][1]);
  }
  ll queryL(ll id, ll l, ll r, ll ql, ll qr, ll w) {
    if (qr < l || r < ql) return -1e18;
    ll mid = (l+r)/2;
    if (ql <= l && r <= qr) {
      if (st[id][0] <= w) return -1e18;
      else if (l == r) return l;
      ll res = queryL(id*2+1, mid+1, r, ql, qr, w);
      if (res == -1e18) res = queryL(id*2, l, mid, ql, qr, w);
      return res;
    }
    ll res = queryL(id*2+1, mid+1, r, ql, qr, w);
    if (res == -1e18) res = queryL(id*2, l, mid, ql, qr, w);
    return res;
  }
  ll queryR(ll id, ll l, ll r, ll ql, ll qr, ll w) {
    if (qr < l || r < ql) return 1e18;
    ll mid = (l+r)/2;
    if (ql <= l && r <= qr) {
      if (st[id][1] >= w) return 1e18;
      else if (l == r) return l;
      ll res = queryR(id*2, l, mid, ql, qr, w);
      if (res == 1e18) res = queryR(id*2+1, mid+1, r, ql, qr, w);
      return res;
    }
    ll res = queryR(id*2, l, mid, ql, qr, w);
    if (res == 1e18) res = queryR(id*2+1, mid+1, r, ql, qr, w);
    return res;
  }
}ST;

int main() {
  cin >> n;
  for (int i=0; i<n; ++i) {
    cin >> A[i];
    R[i] = 1e18;
    L[i] = -1e18;
  }
  for (int i=1; i<n-1; ++i) {
    l = 0, r = i-1;
    while (l < r) {
      mid = (l+r)/2;
      if (A[i+1]-A[i] > A[i]-A[mid]) r = mid;
      else l = mid+1;
    }
    if (A[i+1]-A[i] > A[i]-A[l]) {
      R[i] = l;
    }
    l = i+1, r = n-1;
    while (l < r) {
      mid = (l+r+1)/2;
      if (A[i]-A[i-1] > A[mid]-A[i]) l = mid;
      else r = mid-1;
    }
    if (A[i]-A[i-1] > A[l]-A[i]) {
      L[i] = l;
    }
  }
  ST.build(1, 0, n-1);
  cin >> q;
  while (q--) {
    cin >> a;
    f = 0;
    auto it = lower_bound(A, A+n, a);
    if (it == A+n) {
      f += a - *prev(it);
      a = n-1;
    }
    else if (it == A) {
      f += *it-a;
      a = 0;
    }
    else if (a-*prev(it) <= *it-a) {
      f += a - *prev(it);
      a = it-A-1;
    }
    else {
      f += *it-a;
      a = it-A;
    }
    dir = 0;
    if (!a || (a != n-1 && A[a+1]-A[a] < A[a]-A[a-1])) dir = 1;
    l = r = a;
    //cout << l << " " << r << " " << f << '\n';
    while (l != 0 && r != n-1) {
      if (!dir) {
        x = ST.queryL(1, 0, n-1, 0, l-1, r);
        if (x == -1e18) {
          f += A[r]-A[0];
          l = 0;
        }
        else {
          f += A[r]-A[x];
          l = x;
        }
      }
      else {
        x = ST.queryR(1, 0, n-1, r+1, n-1, l);
        if (x == 1e18) {
          f += A[n-1]-A[l];
          r = n-1;
        }
        else {
          f += A[x]-A[l];
          r = x;
        }
      }
      //cout << l << " " << r << " " << f << '\n';
      dir ^= 1;
    }
    if (l != 0 || r != n-1) f += A[n-1]-A[0];
    cout << f << '\n';
  }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4536 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 1 ms 4540 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 3 ms 4444 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4536 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 1 ms 4540 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 3 ms 4444 KB Output is correct
17 Correct 66 ms 15444 KB Output is correct
18 Correct 62 ms 15268 KB Output is correct
19 Correct 63 ms 15444 KB Output is correct
20 Correct 63 ms 15436 KB Output is correct
21 Correct 75 ms 15444 KB Output is correct
22 Correct 62 ms 15440 KB Output is correct
23 Correct 62 ms 15400 KB Output is correct
24 Correct 69 ms 15276 KB Output is correct
25 Correct 71 ms 15376 KB Output is correct
26 Correct 66 ms 15440 KB Output is correct
27 Correct 84 ms 15376 KB Output is correct
28 Correct 64 ms 15440 KB Output is correct
29 Correct 66 ms 15768 KB Output is correct
30 Correct 65 ms 15188 KB Output is correct
31 Correct 62 ms 15328 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 380 ms 17236 KB Output is correct
8 Correct 390 ms 17280 KB Output is correct
9 Correct 389 ms 17232 KB Output is correct
10 Correct 433 ms 17444 KB Output is correct
11 Correct 389 ms 17268 KB Output is correct
12 Correct 390 ms 17548 KB Output is correct
13 Correct 297 ms 8272 KB Output is correct
14 Correct 269 ms 5712 KB Output is correct
15 Incorrect 418 ms 18516 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4536 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 1 ms 4540 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 3 ms 4444 KB Output is correct
17 Correct 66 ms 15444 KB Output is correct
18 Correct 62 ms 15268 KB Output is correct
19 Correct 63 ms 15444 KB Output is correct
20 Correct 63 ms 15436 KB Output is correct
21 Correct 75 ms 15444 KB Output is correct
22 Correct 62 ms 15440 KB Output is correct
23 Correct 62 ms 15400 KB Output is correct
24 Correct 69 ms 15276 KB Output is correct
25 Correct 71 ms 15376 KB Output is correct
26 Correct 66 ms 15440 KB Output is correct
27 Correct 84 ms 15376 KB Output is correct
28 Correct 64 ms 15440 KB Output is correct
29 Correct 66 ms 15768 KB Output is correct
30 Correct 65 ms 15188 KB Output is correct
31 Correct 62 ms 15328 KB Output is correct
32 Correct 1 ms 4440 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4440 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 380 ms 17236 KB Output is correct
39 Correct 390 ms 17280 KB Output is correct
40 Correct 389 ms 17232 KB Output is correct
41 Correct 433 ms 17444 KB Output is correct
42 Correct 389 ms 17268 KB Output is correct
43 Correct 390 ms 17548 KB Output is correct
44 Correct 297 ms 8272 KB Output is correct
45 Correct 269 ms 5712 KB Output is correct
46 Incorrect 418 ms 18516 KB Output isn't correct
47 Halted 0 ms 0 KB -