oj.uz

Submission #548954

# Submission time Handle Problem Language Result Execution time Memory
548954 2022-04-14T20:02:41 Z Alex_tz307 Pinball (JOI14_pinball) C++17
100 / 100
 265 ms 26280 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int INF = 1e18L;

void minSelf(int &x, int y) {
  if (y < x) {
    x = y;
  }
}

struct ST {
  int n;
  vector<int> t;

  ST(int N) : n(N) {
    int dim = 1;
    while (dim < n) {
      dim *= 2;
    }
    t.resize(dim * 2, INF);
  }

  void update(int x, int lx, int rx, int pos, int v) {
    if (lx == rx) {
      minSelf(t[x], v);
      return;
    }
    int mid = (lx + rx) / 2;
    if (pos <= mid) {
      update(x * 2, lx, mid, pos, v);
    } else {
      update(x * 2 + 1, mid + 1, rx, pos, v);
    }
    t[x] = min(t[x * 2], t[x * 2 + 1]);
  }

  void update(int pos, int v) {
    update(1, 1, n, pos, v);
  }

  int query(int x, int lx, int rx, int st, int dr) {
    if (st <= lx && rx <= dr) {
      return t[x];
    }
    int mid = (lx + rx) / 2, ans = INF;
    if (st <= mid) {
      minSelf(ans, query(x * 2, lx, mid, st, dr));
    }
    if (mid < dr) {
      minSelf(ans, query(x * 2 + 1, mid + 1, rx, st, dr));
    }
    return ans;
  }

  int query(int st, int dr) {
    return query(1, 1, n, st, dr);
  }
};

void testCase() {
  int m, n;
  cin >> m >> n;
  vector<int> a(m), b(m), c(m), d(m), v{1, n};
  for (int i = 0; i < m; ++i) {
    cin >> a[i] >> b[i] >> c[i] >> d[i];
    v.emplace_back(a[i]);
    v.emplace_back(b[i]);
    v.emplace_back(c[i]);
  }
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
  auto getIndex = [&](const int &x) -> int {
    return distance(v.begin(), upper_bound(v.begin(), v.end(), x));
  };
  int N = v.size();
  ST left(N), right(N);
  left.update(1, 0);
  right.update(N, 0);
  int ans = INF;
  for (int i = 0; i < m; ++i) {
    a[i] = getIndex(a[i]);
    b[i] = getIndex(b[i]);
    c[i] = getIndex(c[i]);
    int l = left.query(a[i], b[i]), r = right.query(a[i], b[i]);
    minSelf(ans, l + r + d[i]);
    left.update(c[i], l + d[i]);
    right.update(c[i], r + d[i]);
  }
  if (ans == INF) {
    cout << "-1\n";
  } else {
    cout << ans << '\n';
  }
}

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 320 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 516 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 3 ms 464 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 516 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 3 ms 464 KB Output is correct
25 Correct 18 ms 2312 KB Output is correct
26 Correct 47 ms 4748 KB Output is correct
27 Correct 139 ms 10912 KB Output is correct
28 Correct 131 ms 11164 KB Output is correct
29 Correct 99 ms 9224 KB Output is correct
30 Correct 159 ms 11168 KB Output is correct
31 Correct 241 ms 18148 KB Output is correct
32 Correct 234 ms 13820 KB Output is correct
33 Correct 26 ms 4180 KB Output is correct
34 Correct 109 ms 13304 KB Output is correct
35 Correct 151 ms 26244 KB Output is correct
36 Correct 265 ms 26280 KB Output is correct
37 Correct 216 ms 26244 KB Output is correct
38 Correct 208 ms 26172 KB Output is correct