oj.uz

Submission #807709

# Submission time Handle Problem Language Result Execution time Memory
807709 2023-08-04T22:28:09 Z dong_liu Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 327 ms 55796 KB 
#include <array>
#include <iostream>
#include <set>
#include <vector>
using namespace std;

#define ar array

const int N = 1e5, N_ = 1 << 17, L = 17;

ar<int, 2> operator+(const ar<int, 2> &u, const ar<int, 2> &v) {
  return {min(u[0], v[0]), max(u[1], v[1])};
}

int n_;

void build(ar<int, 2> *t, ar<int, 2> *p, int n) {
  for (int i = 0; i < n_; i++) t[n_ + i] = i < n ? p[i] : ar{0, 0};
  for (int i = n_ - 1; i > 0; i--) t[i] = t[i << 1 | 0] + t[i << 1 | 1];
}

ar<int, 2> query(ar<int, 2> *t, int l, int r) {
  ar<int, 2> x = {N, 0};
  for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1) {
    if ((l & 1) == 1) x = x + t[l++];
    if ((r & 1) == 0) x = x + t[r--];
  }
  return x;
}

int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  int m;
  scanf("%d", &m);
  static vector<pair<int, int>> el[N + 1], er[N + 1];
  while (m--) {
    int i, j;
    scanf("%d%d", &i, &j), i--, j--;
    if (i < j) {
      er[i].push_back({j, +1});
      er[min(i + k, j)].push_back({j, -1});
    } else {
      el[max(i - k, j) + 1].push_back({j, +1});
      el[i + 1].push_back({j, -1});
    }
  }
  multiset<int> ls, rs;
  static ar<int, 2> p[N];
  for (int i = 0; i < n; i++) {
    for (auto [x, t] : el[i])
      if (t == +1)
        ls.insert(x);
      else
        ls.erase(ls.find(x));
    for (auto [x, t] : er[i])
      if (t == +1)
        rs.insert(x);
      else
        rs.erase(rs.find(x));
    p[i][0] = ls.empty() ? i : *ls.begin();
    p[i][1] = rs.empty() ? i : *rs.rbegin();
  }
  n_ = 1;
  while (n_ < n) n_ <<= 1;
  static ar<int, 2> tb[L][N_ * 2];
  build(tb[0], p, n);
  for (int l = 1; l < L; l++) {
    for (int i = 0; i < n; i++) p[i] = query(tb[l - 1], p[i][0], p[i][1]);
    build(tb[l], p, n);
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    int i, j;
    scanf("%d%d", &i, &j), i--, j--;
    if (i == j) {
      printf("0\n");
      continue;
    }
    int x = 1;
    ar<int, 2> p = {i, i};
    for (int l = L - 1; l >= 0; l--) {
      ar<int, 2> q = query(tb[l], p[0], p[1]);
      if (q[0] > j || q[1] < j) p = q, x += 1 << l;
    }
    printf("%d\n", x == (1 << L) ? -1 : x);
  }
  return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   scanf("%d%d", &n, &k);
      |   ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |   scanf("%d", &m);
      |   ~~~~~^~~~~~~~~~
Main.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |     scanf("%d%d", &i, &j), i--, j--;
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:73:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   scanf("%d", &q);
      |   ~~~~~^~~~~~~~~~
Main.cpp:76:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     scanf("%d%d", &i, &j), i--, j--;
      |     ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 3 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 4 ms 5288 KB Output is correct
6 Correct 3 ms 5204 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 3 ms 5204 KB Output is correct
9 Correct 3 ms 5204 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5172 KB Output is correct
12 Correct 3 ms 5204 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 3 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 4 ms 5288 KB Output is correct
6 Correct 3 ms 5204 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 3 ms 5204 KB Output is correct
9 Correct 3 ms 5204 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5172 KB Output is correct
12 Correct 3 ms 5204 KB Output is correct
13 Correct 6 ms 5716 KB Output is correct
14 Correct 6 ms 5836 KB Output is correct
15 Correct 4 ms 5716 KB Output is correct
16 Correct 5 ms 5844 KB Output is correct
17 Correct 5 ms 5844 KB Output is correct
18 Correct 4 ms 5828 KB Output is correct
19 Correct 5 ms 5844 KB Output is correct
20 Correct 5 ms 5844 KB Output is correct
21 Correct 4 ms 5844 KB Output is correct
22 Correct 5 ms 5864 KB Output is correct
23 Correct 7 ms 5716 KB Output is correct
24 Correct 5 ms 5824 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 44532 KB Output is correct
2 Correct 128 ms 44364 KB Output is correct
3 Correct 162 ms 44812 KB Output is correct
4 Correct 120 ms 44352 KB Output is correct
5 Correct 183 ms 52292 KB Output is correct
6 Correct 159 ms 49124 KB Output is correct
7 Correct 149 ms 55116 KB Output is correct
8 Correct 125 ms 47988 KB Output is correct
9 Correct 114 ms 48348 KB Output is correct
10 Correct 150 ms 49988 KB Output is correct
11 Correct 182 ms 49948 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 49212 KB Output is correct
2 Correct 240 ms 53060 KB Output is correct
3 Correct 227 ms 45684 KB Output is correct
4 Correct 185 ms 55796 KB Output is correct
5 Correct 216 ms 55232 KB Output is correct
6 Correct 249 ms 55100 KB Output is correct
7 Correct 208 ms 50632 KB Output is correct
8 Correct 230 ms 50716 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 52036 KB Output is correct
2 Correct 242 ms 45744 KB Output is correct
3 Correct 197 ms 43592 KB Output is correct
4 Correct 194 ms 42268 KB Output is correct
5 Correct 126 ms 41672 KB Output is correct
6 Correct 181 ms 41364 KB Output is correct
7 Correct 204 ms 51100 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 6 ms 5844 KB Output is correct
10 Correct 261 ms 52220 KB Output is correct
11 Correct 261 ms 54228 KB Output is correct
12 Correct 271 ms 52352 KB Output is correct
13 Correct 266 ms 54156 KB Output is correct
14 Correct 4 ms 5204 KB Output is correct
15 Correct 6 ms 5808 KB Output is correct
16 Correct 178 ms 49312 KB Output is correct
17 Correct 276 ms 49980 KB Output is correct
18 Correct 299 ms 49932 KB Output is correct
19 Correct 266 ms 49932 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 3 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 4 ms 5288 KB Output is correct
6 Correct 3 ms 5204 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 3 ms 5204 KB Output is correct
9 Correct 3 ms 5204 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5172 KB Output is correct
12 Correct 3 ms 5204 KB Output is correct
13 Correct 6 ms 5716 KB Output is correct
14 Correct 6 ms 5836 KB Output is correct
15 Correct 4 ms 5716 KB Output is correct
16 Correct 5 ms 5844 KB Output is correct
17 Correct 5 ms 5844 KB Output is correct
18 Correct 4 ms 5828 KB Output is correct
19 Correct 5 ms 5844 KB Output is correct
20 Correct 5 ms 5844 KB Output is correct
21 Correct 4 ms 5844 KB Output is correct
22 Correct 5 ms 5864 KB Output is correct
23 Correct 7 ms 5716 KB Output is correct
24 Correct 5 ms 5824 KB Output is correct
25 Correct 136 ms 44532 KB Output is correct
26 Correct 128 ms 44364 KB Output is correct
27 Correct 162 ms 44812 KB Output is correct
28 Correct 120 ms 44352 KB Output is correct
29 Correct 183 ms 52292 KB Output is correct
30 Correct 159 ms 49124 KB Output is correct
31 Correct 149 ms 55116 KB Output is correct
32 Correct 125 ms 47988 KB Output is correct
33 Correct 114 ms 48348 KB Output is correct
34 Correct 150 ms 49988 KB Output is correct
35 Correct 182 ms 49948 KB Output is correct
36 Correct 150 ms 49212 KB Output is correct
37 Correct 240 ms 53060 KB Output is correct
38 Correct 227 ms 45684 KB Output is correct
39 Correct 185 ms 55796 KB Output is correct
40 Correct 216 ms 55232 KB Output is correct
41 Correct 249 ms 55100 KB Output is correct
42 Correct 208 ms 50632 KB Output is correct
43 Correct 230 ms 50716 KB Output is correct
44 Correct 327 ms 52036 KB Output is correct
45 Correct 242 ms 45744 KB Output is correct
46 Correct 197 ms 43592 KB Output is correct
47 Correct 194 ms 42268 KB Output is correct
48 Correct 126 ms 41672 KB Output is correct
49 Correct 181 ms 41364 KB Output is correct
50 Correct 204 ms 51100 KB Output is correct
51 Correct 4 ms 5204 KB Output is correct
52 Correct 6 ms 5844 KB Output is correct
53 Correct 261 ms 52220 KB Output is correct
54 Correct 261 ms 54228 KB Output is correct
55 Correct 271 ms 52352 KB Output is correct
56 Correct 266 ms 54156 KB Output is correct
57 Correct 4 ms 5204 KB Output is correct
58 Correct 6 ms 5808 KB Output is correct
59 Correct 178 ms 49312 KB Output is correct
60 Correct 276 ms 49980 KB Output is correct
61 Correct 299 ms 49932 KB Output is correct
62 Correct 266 ms 49932 KB Output is correct
63 Correct 222 ms 45184 KB Output is correct
64 Correct 243 ms 45460 KB Output is correct
65 Correct 214 ms 45132 KB Output is correct
66 Correct 229 ms 53016 KB Output is correct
67 Correct 258 ms 49912 KB Output is correct
68 Correct 205 ms 50984 KB Output is correct
69 Correct 254 ms 55168 KB Output is correct
70 Correct 224 ms 50592 KB Output is correct
71 Correct 239 ms 50748 KB Output is correct