oj.uz

Submission #845004

# Submission time Handle Problem Language Result Execution time Memory
845004 2023-09-06T10:49:59 Z Alora Event Hopping (BOI22_events) C++17
0 / 100
 345 ms 22948 KB 
#include <bits/stdc++.h>
#define st first
#define nd second
using namespace std;
const int LG = 17;

int main() {
  int n, q; cin >> n >> q;
  vector<vector<int>> nx(LG);
  vector<vector<pair<int, int>>> rmq(LG);
  for (int i = 0; i < LG; i++)
    nx[i].resize(n), rmq[i].resize(n, {1'000'000'001, -1});
  vector<pair<int, int>> a(n);
  vector<int> b;
  for (int i = 0; i < n; i++) {
    cin >> a[i].st >> a[i].nd;
    b.push_back(a[i].nd);
  }
  sort(b.begin(), b.end());
  b.erase(unique(b.begin(), b.end()), b.end());
  for (int i = 0; i < n; i++) {
    int r = lower_bound(b.begin(), b.end(), a[i].nd) - b.begin();
    rmq[0][r] = min(rmq[0][r], {a[i].st, i});
  }
  for (int i = 0; i + 1 < LG; i++)
    for (int j = 0; j + (1 << (i + 1)) <= n; j++)
      rmq[i + 1][j] = min(rmq[i][j], rmq[i][j + (1 << i)]);
  for (int i = 0; i < n; i++) {
    int l = lower_bound(b.begin(), b.end(), a[i].st) - b.begin();
    int r = lower_bound(b.begin(), b.end(), a[i].nd) - b.begin();
    int h = 31 - __builtin_clz(r - l + 1);
    nx[0][i] = min(rmq[h][l], rmq[h][r + 1 - (1 << h)]).nd;
  }
  for (int i = 0; i + 1 < LG; i++)
    for (int j = 0; j < n; j++)
      nx[i + 1][j] = nx[i][nx[i][j]];
  while (q--) {
    int x, y, l = 1; cin >> x >> y; x--, y--;
    if (x == y || (a[y].st <= a[x].nd && a[x].nd <= a[y].nd)) {
      cout << (x == y ? 0 : 1) << "\n";
      continue;
    }
    for (int i = LG - 1; ~i; i--) {
      if (a[x].nd < a[nx[i][y]].st)
        l += 1 << i, y = nx[i][y];
    }
    y = nx[0][y];
    if (a[x].nd < a[y].st || y == -1)
      cout << "impossible\n";
    else
      cout << l + 1 << "\n";
  }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 261 ms 22180 KB Output is correct
3 Correct 271 ms 22276 KB Output is correct
4 Correct 345 ms 22480 KB Output is correct
5 Correct 283 ms 22356 KB Output is correct
6 Correct 292 ms 22332 KB Output is correct
7 Correct 279 ms 22472 KB Output is correct
8 Correct 285 ms 22948 KB Output is correct
9 Correct 291 ms 22696 KB Output is correct
10 Incorrect 280 ms 22104 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 22136 KB Output is correct
2 Correct 271 ms 22332 KB Output is correct
3 Correct 299 ms 22568 KB Output is correct
4 Correct 302 ms 22728 KB Output is correct
5 Incorrect 305 ms 22396 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 261 ms 22180 KB Output is correct
3 Correct 271 ms 22276 KB Output is correct
4 Correct 345 ms 22480 KB Output is correct
5 Correct 283 ms 22356 KB Output is correct
6 Correct 292 ms 22332 KB Output is correct
7 Correct 279 ms 22472 KB Output is correct
8 Correct 285 ms 22948 KB Output is correct
9 Correct 291 ms 22696 KB Output is correct
10 Incorrect 280 ms 22104 KB Output isn't correct
11 Halted 0 ms 0 KB -