oj.uz

답안 #476458

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
476458 2021-09-27T05:48:19 Z palilo 철도 요금 (JOI16_ho_t3) C++17
100 / 100
 139 ms 16488 KB 
#include <bits/stdc++.h>
using namespace std;

template <class T>
bool chmin(T& _old, T _new) { return _old > _new && (_old = _new, true); }
template <class T>
bool chmax(T& _old, T _new) { return _old < _new && (_old = _new, true); }

struct elem {
    pair<int, int> d;
    int u;
    elem(pair<int, int> d, int u) : d(d), u(u) {}
    bool operator<(const elem& rhs) const {
        if (d.first == rhs.d.first) return d.second < rhs.d.second;
        return d.first > rhs.d.first;
    }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
#ifdef palilo
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif
    constexpr int INF = 0x3f3f3f3f;
    int n, m, q;
    cin >> n >> m >> q;
    const auto adj = [&]() {
        vector<pair<int, int>> e(m);
        for (auto& [u, v] : e) {
            cin >> u >> v, --u, --v;
        }
        vector changed(m, INF);
        for (int i = 0, eid; i < q; ++i) {
            cin >> eid, --eid;
            changed[eid] = i;
        }
        vector<vector<pair<int, int>>> adj(n);
        for (int i = 0; i < m; ++i) {
            adj[e[i].first].emplace_back(changed[i], e[i].second);
            adj[e[i].second].emplace_back(changed[i], e[i].first);
        }
        return adj;
    }();
    vector<pair<int, int>> dist(n, pair(INF, INF));
    priority_queue<elem> pq;
    pq.emplace(dist[0] = {0, INF}, 0);
    while (!pq.empty()) {
        const auto [d, u] = pq.top();
        pq.pop();
        if (d != dist[u]) continue;
        for (const auto& [t, v] : adj[u]) {
            const auto t2 = min(t, d.second);
            if (dist[v].first > d.first + 1 || (dist[v].first == d.first + 1 && dist[v].second < t2)) {
                pq.emplace(dist[v] = {d.first + 1, t2}, v);
            }
        }
    }
    vector<int> ans(q);
    for (const auto& [_, t] : dist) {
        if (t != INF) {
            ++ans[t];
        }
    }
    partial_sum(ans.begin(), ans.end(), ans.begin());
    for (const auto& x : ans) {
        cout << x << '\n';
    }
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 115 ms 13516 KB Output is correct
10 Correct 122 ms 13496 KB Output is correct
11 Correct 81 ms 13260 KB Output is correct
12 Correct 81 ms 13388 KB Output is correct
13 Correct 87 ms 13432 KB Output is correct
14 Correct 77 ms 13372 KB Output is correct
15 Correct 44 ms 9148 KB Output is correct
16 Correct 42 ms 8176 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 13536 KB Output is correct
2 Correct 130 ms 13520 KB Output is correct
3 Correct 73 ms 12252 KB Output is correct
4 Correct 83 ms 13252 KB Output is correct
5 Correct 80 ms 13364 KB Output is correct
6 Correct 112 ms 13376 KB Output is correct
7 Correct 46 ms 8132 KB Output is correct
8 Correct 38 ms 8020 KB Output is correct
9 Correct 33 ms 8340 KB Output is correct
10 Correct 33 ms 9200 KB Output is correct
11 Correct 116 ms 13212 KB Output is correct
12 Correct 112 ms 12756 KB Output is correct
13 Correct 106 ms 12588 KB Output is correct
14 Correct 110 ms 13508 KB Output is correct
15 Correct 107 ms 12812 KB Output is correct
16 Correct 98 ms 12388 KB Output is correct
17 Correct 108 ms 12528 KB Output is correct
18 Correct 58 ms 9204 KB Output is correct
19 Correct 132 ms 15396 KB Output is correct
20 Correct 96 ms 12496 KB Output is correct
21 Correct 54 ms 8400 KB Output is correct
22 Correct 51 ms 8360 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 115 ms 13516 KB Output is correct
10 Correct 122 ms 13496 KB Output is correct
11 Correct 81 ms 13260 KB Output is correct
12 Correct 81 ms 13388 KB Output is correct
13 Correct 87 ms 13432 KB Output is correct
14 Correct 77 ms 13372 KB Output is correct
15 Correct 44 ms 9148 KB Output is correct
16 Correct 42 ms 8176 KB Output is correct
17 Correct 127 ms 13536 KB Output is correct
18 Correct 130 ms 13520 KB Output is correct
19 Correct 73 ms 12252 KB Output is correct
20 Correct 83 ms 13252 KB Output is correct
21 Correct 80 ms 13364 KB Output is correct
22 Correct 112 ms 13376 KB Output is correct
23 Correct 46 ms 8132 KB Output is correct
24 Correct 38 ms 8020 KB Output is correct
25 Correct 33 ms 8340 KB Output is correct
26 Correct 33 ms 9200 KB Output is correct
27 Correct 116 ms 13212 KB Output is correct
28 Correct 112 ms 12756 KB Output is correct
29 Correct 106 ms 12588 KB Output is correct
30 Correct 110 ms 13508 KB Output is correct
31 Correct 107 ms 12812 KB Output is correct
32 Correct 98 ms 12388 KB Output is correct
33 Correct 108 ms 12528 KB Output is correct
34 Correct 58 ms 9204 KB Output is correct
35 Correct 132 ms 15396 KB Output is correct
36 Correct 96 ms 12496 KB Output is correct
37 Correct 54 ms 8400 KB Output is correct
38 Correct 51 ms 8360 KB Output is correct
39 Correct 139 ms 16432 KB Output is correct
40 Correct 136 ms 16488 KB Output is correct
41 Correct 115 ms 13436 KB Output is correct
42 Correct 132 ms 14992 KB Output is correct
43 Correct 130 ms 15012 KB Output is correct
44 Correct 124 ms 15024 KB Output is correct
45 Correct 136 ms 14944 KB Output is correct
46 Correct 65 ms 9808 KB Output is correct
47 Correct 62 ms 9392 KB Output is correct
48 Correct 65 ms 9256 KB Output is correct
49 Correct 63 ms 9360 KB Output is correct
50 Correct 72 ms 9640 KB Output is correct
51 Correct 61 ms 9968 KB Output is correct
52 Correct 63 ms 10280 KB Output is correct
53 Correct 59 ms 9180 KB Output is correct
54 Correct 66 ms 9672 KB Output is correct