oj.uz

답안 #1038761

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038761 2024-07-30T07:19:31 Z juicy Passport (JOI23_passport) C++17
48 / 100
 41 ms 54612 KB 
#include <bits/stdc++.h>

using namespace std;

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

const int N = 2e5 + 5, inf = 1e9 + 7;

int n, q;
int res[N], pos[N], d[4 * N], vis[4 * N];
vector<array<int, 2>> g[4 * N];

void bfs(int src) {
  memset(d, 0x3f, sizeof(d));
  deque<int> q;
  d[src] = 0;
  q.push_back(src);
  while (q.size()) {
    int u = q.front(); q.pop_front();
    if (vis[u] == src) {
      continue;
    }
    vis[u] = src;
    for (auto [v, w] : g[u]) {
      if (d[v] > d[u] + w) {
        d[v] = d[u] + w;
        if (w) {
          q.push_back(v);
        } else {
          q.push_front(v);
        }
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    if (res[pos[i]] != inf && d[pos[i]] < inf) {
      res[pos[i]] += d[pos[i]];
    } else {
      res[pos[i]] = inf;
    }
  }
}

void add(int u, int v, int w) {
  g[v].push_back({u, w});
}

void bld(int id = 1, int l = 1, int r = n) {
  if (l == r) {
    pos[l] = id;
    return;
  }
  res[id] = inf;
  int md = (l + r) / 2;
  bld(id * 2, l, md);
  bld(id * 2 + 1, md + 1, r);
  add(id, id * 2, 0);
  add(id, id * 2 + 1, 0);
}

void upd(int u, int v, int x, int id = 1, int l = 1, int r = n) {
  if (u <= l && r <= v) {
    add(x, id, 1);
    return;
  }
  int md = (l + r) / 2;
  if (u <= md) {
    upd(u, v, x, id * 2, l, md);
  }
  if (md < v) {
    upd(u, v, x, id * 2 + 1, md + 1, r);
  }
}

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

  cin >> n;
  bld();
  for (int i = 1; i <= n; ++i) {
    int l, r; cin >> l >> r;
    upd(l, r, pos[i]);
  }
  bfs(pos[1]);
  bfs(pos[n]);
  using T = array<int, 2>;
  priority_queue<T, vector<T>, greater<T>> pq;
  for (int i = 1; i <= n; ++i) {
    if (res[pos[i]] != inf) {
      if (i != 1 && i != n) {
        res[pos[i]] -= 1;
      }
      pq.push({res[pos[i]], pos[i]});
    }
  }
  while (pq.size()) {
    auto [c, u] = pq.top(); pq.pop();
    if (c != res[u]) {
      continue;
    }
    for (auto [v, w] : g[u]) {
      if (res[v] > res[u] + w) {
        pq.push({res[v] = res[u] + w, v});
      }
    }
  }
  cin >> q;
  while (q--) {
    int u; cin >> u;
    cout << (res[pos[u]] == inf ? -1 : res[pos[u]]) << "\n";
  }
  return 0;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 22364 KB Output is correct
2 Correct 8 ms 22320 KB Output is correct
3 Correct 7 ms 22324 KB Output is correct
4 Runtime error 41 ms 54612 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 22364 KB Output is correct
2 Correct 8 ms 22364 KB Output is correct
3 Correct 8 ms 22364 KB Output is correct
4 Correct 9 ms 22364 KB Output is correct
5 Correct 12 ms 22168 KB Output is correct
6 Correct 12 ms 22324 KB Output is correct
7 Correct 9 ms 22364 KB Output is correct
8 Correct 8 ms 22364 KB Output is correct
9 Correct 9 ms 22364 KB Output is correct
10 Correct 8 ms 22364 KB Output is correct
11 Correct 9 ms 22364 KB Output is correct
12 Correct 8 ms 22316 KB Output is correct
13 Correct 9 ms 22364 KB Output is correct
14 Correct 8 ms 22364 KB Output is correct
15 Correct 11 ms 22324 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 22364 KB Output is correct
2 Correct 8 ms 22364 KB Output is correct
3 Correct 8 ms 22364 KB Output is correct
4 Correct 9 ms 22364 KB Output is correct
5 Correct 12 ms 22168 KB Output is correct
6 Correct 12 ms 22324 KB Output is correct
7 Correct 9 ms 22364 KB Output is correct
8 Correct 8 ms 22364 KB Output is correct
9 Correct 9 ms 22364 KB Output is correct
10 Correct 8 ms 22364 KB Output is correct
11 Correct 9 ms 22364 KB Output is correct
12 Correct 8 ms 22316 KB Output is correct
13 Correct 9 ms 22364 KB Output is correct
14 Correct 8 ms 22364 KB Output is correct
15 Correct 11 ms 22324 KB Output is correct
16 Correct 10 ms 22876 KB Output is correct
17 Correct 15 ms 22592 KB Output is correct
18 Correct 15 ms 22964 KB Output is correct
19 Correct 11 ms 22972 KB Output is correct
20 Correct 9 ms 22620 KB Output is correct
21 Correct 9 ms 22676 KB Output is correct
22 Correct 13 ms 22616 KB Output is correct
23 Correct 15 ms 22616 KB Output is correct
24 Correct 11 ms 22876 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 22364 KB Output is correct
2 Correct 8 ms 22364 KB Output is correct
3 Correct 8 ms 22364 KB Output is correct
4 Correct 9 ms 22364 KB Output is correct
5 Correct 12 ms 22168 KB Output is correct
6 Correct 12 ms 22324 KB Output is correct
7 Correct 9 ms 22364 KB Output is correct
8 Correct 8 ms 22364 KB Output is correct
9 Correct 9 ms 22364 KB Output is correct
10 Correct 8 ms 22364 KB Output is correct
11 Correct 9 ms 22364 KB Output is correct
12 Correct 8 ms 22316 KB Output is correct
13 Correct 9 ms 22364 KB Output is correct
14 Correct 8 ms 22364 KB Output is correct
15 Correct 11 ms 22324 KB Output is correct
16 Correct 10 ms 22876 KB Output is correct
17 Correct 15 ms 22592 KB Output is correct
18 Correct 15 ms 22964 KB Output is correct
19 Correct 11 ms 22972 KB Output is correct
20 Correct 9 ms 22620 KB Output is correct
21 Correct 9 ms 22676 KB Output is correct
22 Correct 13 ms 22616 KB Output is correct
23 Correct 15 ms 22616 KB Output is correct
24 Correct 11 ms 22876 KB Output is correct
25 Correct 11 ms 22388 KB Output is correct
26 Correct 9 ms 22180 KB Output is correct
27 Correct 16 ms 22928 KB Output is correct
28 Correct 11 ms 22620 KB Output is correct
29 Correct 16 ms 22620 KB Output is correct
30 Correct 10 ms 22628 KB Output is correct
31 Correct 14 ms 22592 KB Output is correct

Subtask #5
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 22364 KB Output is correct
2 Correct 8 ms 22320 KB Output is correct
3 Correct 7 ms 22324 KB Output is correct
4 Runtime error 41 ms 54612 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -