oj.uz

Submission #860595

# Submission time Handle Problem Language Result Execution time Memory
860595 2023-10-13T12:47:24 Z SuouYuki Passport (JOI23_passport) C++17
100 / 100
 424 ms 43420 KB 
#include <bits/stdc++.h>

using namespace std;

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

      int n;
      cin >> n;

      vector<int> l(n), r(n);
      for (int i = 0; i < n; i++) {
            cin >> l[i] >> r[i];
            l[i] -= 1;
      }

      vector<vector<int>> f(n * 2);
      for (int i = 0; i < n; i++) {
            for (int u = l[i] + n, v = r[i] + n; u < v; u >>= 1, v >>= 1) {
                  if (u & 1) {
                        f[u++].emplace_back(i);
                  }
                  if (v & 1) {
                        f[--v].emplace_back(i);
                  }
            }
      }

      auto func = [&](vector<int> &d) -> void {
            priority_queue<pair<int, int>> pri_que;
            for (int i = 0; i < n; i++) {
                  pri_que.emplace(-d[i], i);
            }

            vector<bool> vis(n), used(n * 2);

            while (!pri_que.empty()) {
                  int u = pri_que.top().second;
                  pri_que.pop();

                  if (!vis[u]) {
                        vis[u] = true;
                        int x = u + n;
                        while (x > 0 && !used[x]) {
                              used[x] = true;
                              for (int v : f[x]) {
                                    if (d[v] > d[u] + 1) {
                                          d[v] = d[u] + 1;
                                          pri_que.emplace(-d[v], v);
                                    }
                              }
                              x >>= 1;
                        }
                  }
            }
      };

      vector<int> pr(n, 1 << 27);
      pr[0] = 0;
      func(pr);
      pr[0] = 1;

      vector<int> su(n, 1 << 27);
      su[n - 1] = 0;
      func(su);
      su[n - 1] = 1;

      vector<int> d(n);
      for (int i = 0; i < n; i++) {
            d[i] = pr[i] + su[i];
      }
      func(d);

      for (int i = 0; i < n; i++) {
            if (d[i] > n) {
                  d[i] = -1;
            }
            else {
                  d[i] -= 1;
            }
      }

      int q;
      cin >> q;

      while (q--) {
            int x;
            cin >> x;
            x -= 1;
            cout << d[x] << "\n";
      }

      return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 350 ms 42548 KB Output is correct
5 Correct 227 ms 29988 KB Output is correct
6 Correct 129 ms 29444 KB Output is correct
7 Correct 144 ms 32820 KB Output is correct
8 Correct 107 ms 27836 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 3 ms 860 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 608 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 3 ms 860 KB Output is correct
24 Correct 2 ms 604 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 3 ms 860 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 608 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 3 ms 860 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 3 ms 720 KB Output is correct
28 Correct 3 ms 600 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 3 ms 860 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 350 ms 42548 KB Output is correct
5 Correct 227 ms 29988 KB Output is correct
6 Correct 129 ms 29444 KB Output is correct
7 Correct 144 ms 32820 KB Output is correct
8 Correct 107 ms 27836 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 456 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 3 ms 860 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 860 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 608 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 3 ms 860 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 3 ms 720 KB Output is correct
36 Correct 3 ms 600 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 2 ms 860 KB Output is correct
39 Correct 3 ms 860 KB Output is correct
40 Correct 424 ms 43224 KB Output is correct
41 Correct 225 ms 30232 KB Output is correct
42 Correct 275 ms 40028 KB Output is correct
43 Correct 286 ms 43420 KB Output is correct
44 Correct 159 ms 29300 KB Output is correct
45 Correct 181 ms 32108 KB Output is correct
46 Correct 77 ms 12760 KB Output is correct
47 Correct 228 ms 37580 KB Output is correct
48 Correct 213 ms 34400 KB Output is correct