oj.uz

답안 #951092

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
951092 2024-03-21T06:28:47 Z blackslex Passport (JOI23_passport) C++17
48 / 100
 2000 ms 1048576 KB 
#include<bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;

int n, q, x;
vector<vector<pii>> v;

int main() {
    scanf("%d", &n);
    vector<int> L(n + 5), R(n + 5);
    v.resize(n + 5, vector<pii>());
    for (int i = 1; i <= n; i++) {
        scanf("%d %d", &L[i], &R[i]);
        for (int j = L[i]; j <= R[i]; j++) v[j].emplace_back(i, 1);
    }
    scanf("%d", &q);
    vector<int> d(n + 5, 1e9), d2(n + 5, 1e9), ans(n + 5, 1e9);
    auto dijk = [&] (int s, vector<int> &curd) {
        priority_queue<pii, vector<pii>, greater<pii>> pq;
        pq.emplace(curd[s] = 0, s);
        while (!pq.empty()) {
            auto [nd, nn] = pq.top(); pq.pop();
            for (auto &[tn, td]: v[nn]) if (curd[tn] > curd[nn] + td) pq.emplace(curd[tn] = curd[nn] + td, tn);
        }
    };
    dijk(1, d); dijk(n, d2);
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    for (int i = 1; i <= n; i++) pq.emplace(ans[i] = min(ans[i], d[i] + d2[i] - (i > 1 && i < n)), i);
    priority_queue<pii, vector<pii>, greater<pii>> pq2;
    while (!pq.empty()) {
        auto [nd, nn] = pq.top(); pq.pop();
        pq2.emplace(nd, nn);
    }
    while (!pq2.empty()) pq.emplace(pq2.top()), pq2.pop();
    while (!pq.empty()) {
        auto [nd, nn] = pq.top(); pq.pop();
        for (auto &[tn, td]: v[nn]) if (ans[tn] > ans[nn] + td) pq.emplace(ans[tn] = ans[nn] + td, tn);
    }
    while (q--) scanf("%d", &x), printf("%d\n", ans[x] == 1e9 ? -1 : ans[x]);
}

Compilation message

passport.cpp: In function 'int main()':
passport.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
passport.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         scanf("%d %d", &L[i], &R[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
passport.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
passport.cpp:40:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |     while (q--) scanf("%d", &x), printf("%d\n", ans[x] == 1e9 ? -1 : ans[x]);
      |                 ~~~~~^~~~~~~~~~

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 2133 ms 1048576 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 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 604 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 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 604 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 23 ms 16984 KB Output is correct
17 Correct 3 ms 856 KB Output is correct
18 Correct 58 ms 33168 KB Output is correct
19 Correct 47 ms 31496 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 6 ms 5212 KB Output is correct
22 Correct 39 ms 38132 KB Output is correct
23 Correct 40 ms 27340 KB Output is correct
24 Correct 38 ms 28496 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 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 604 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 23 ms 16984 KB Output is correct
17 Correct 3 ms 856 KB Output is correct
18 Correct 58 ms 33168 KB Output is correct
19 Correct 47 ms 31496 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 6 ms 5212 KB Output is correct
22 Correct 39 ms 38132 KB Output is correct
23 Correct 40 ms 27340 KB Output is correct
24 Correct 38 ms 28496 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 24 ms 18116 KB Output is correct
28 Correct 3 ms 860 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 7 ms 4956 KB Output is correct
31 Correct 29 ms 20572 KB Output is correct

Subtask #5
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 2133 ms 1048576 KB Time limit exceeded
5 Halted 0 ms 0 KB -