oj.uz

답안 #757566

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
757566 2023-06-13T10:48:22 Z Desh03 Olympic Bus (JOI20_ho_t4) C++17
5 / 100
 1000 ms 3440 KB 
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;
int n;
vector<multiset<pair<int, int>>> g;

void djikstra(int src, vector<long long> &sp) {
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;
    pq.push({sp[src] = 0, src});
    vector<bool> vis(n);
    while (pq.size()) {
        int u = pq.top().second;
        pq.pop();
        if (vis[u]) continue;
        vis[u] = 1;
        for (auto [v, w] : g[u]) {
            if (sp[u] + w < sp[v])
                sp[v] = sp[u] + w, pq.push({sp[v], v});
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int m;
    cin >> n >> m;
    g.resize(n);
    vector<long long> sp1, sp2;
    vector<tuple<int, int, int, int>> edges;
    for (int i = 0; i < m; i++) {
        int u, v, c, d;
        cin >> u >> v >> c >> d;
        --u, --v;
        g[u].insert({v, c});
        edges.push_back({u, v, c, d});
    }
    sp1 = sp2 = vector<long long> (n, INF);
    djikstra(0, sp1), djikstra(n - 1, sp2);
    long long ans = min(INF, sp1[n - 1] + sp2[0]);
    for (auto [u, v, c, d] : edges) {
        g[u].erase(g[u].find({v, c}));
        g[v].insert({u, c});
        sp1 = sp2 = vector<long long> (n, INF);
        djikstra(0, sp1), djikstra(n - 1, sp2);
        ans = min(ans, sp1[n - 1] + sp2[0] + d);
        g[v].erase(g[v].find({u, c}));
        g[u].insert({v, c});
    }
    cout << (ans == INF ? -1 : ans) << '\n';
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 58 ms 384 KB Output is correct
4 Correct 63 ms 384 KB Output is correct
5 Correct 26 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 17 ms 468 KB Output is correct
10 Correct 81 ms 340 KB Output is correct
11 Correct 80 ms 340 KB Output is correct
12 Correct 82 ms 384 KB Output is correct
13 Correct 28 ms 400 KB Output is correct
14 Correct 39 ms 340 KB Output is correct
15 Correct 36 ms 340 KB Output is correct
16 Correct 38 ms 340 KB Output is correct

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1035 ms 3440 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Execution timed out 1091 ms 2824 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 58 ms 384 KB Output is correct
4 Correct 63 ms 384 KB Output is correct
5 Correct 26 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 17 ms 468 KB Output is correct
10 Correct 81 ms 340 KB Output is correct
11 Correct 80 ms 340 KB Output is correct
12 Correct 82 ms 384 KB Output is correct
13 Correct 28 ms 400 KB Output is correct
14 Correct 39 ms 340 KB Output is correct
15 Correct 36 ms 340 KB Output is correct
16 Correct 38 ms 340 KB Output is correct
17 Execution timed out 1035 ms 3440 KB Time limit exceeded
18 Halted 0 ms 0 KB -