oj.uz

Submission #812213

# Submission time Handle Problem Language Result Execution time Memory
812213 2023-08-07T07:52:14 Z vjudge1 Olympic Bus (JOI20_ho_t4) C++17
5 / 100
 162 ms 2996 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 1000;
const int M = 100000;
const ll INF = 1e18;

int n, m;
vector<pair<int, int>> g[N], g0[N];
ll C[M], D[M];
pair<int, int> edges[M];

vector<ll> dijkstra(int s, vector<pair<int, int>> g[]) {
    vector<ll> dist(n + 1, INF);
    dist[s] = 0;
    set<pair<ll, int>> st; 
    for(int i = 1; i <= n; i++) 
        st.insert({dist[i], i});
    while(!st.empty()) {
        s = st.begin()->second;
        st.erase(st.begin());
        for(auto [to, i] : g[s]) {
            if(dist[to] > dist[s] + C[i]) {
                st.erase({dist[to], to});
                dist[to] = dist[s] + C[i];
                st.insert({dist[to], to});
            }
        }
    }
    return dist;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        edges[i] = {u, v};
        cin >> C[i] >> D[i];
        g[u].push_back({v, i});
        g0[v].push_back({u, i});
    }
    bool subtask2 = 1;
    for(int i = 0; i < m; i += 2) 
        subtask2 &= (edges[i] == edges[i + 1] && C[i] == C[i + 1]);
    if(subtask2) {
        auto d1 = dijkstra(1, g);
        auto dn = dijkstra(n, g);
        auto e1 = dijkstra(1, g0);
        auto en = dijkstra(n, g0);
        ll res = d1[n] + dn[1];
        for(int i = 0; i < m; i++) {
            auto [u, v] = edges[i];
            res = min(res, d1[v] + en[u] + dn[1] + C[i] + D[i]);
            res = min(res, dn[v] + e1[u] + d1[n] + C[i] + D[i]);
        }
        if(res >= INF) res = -1;
        cout << res;
        return 0;
    }
    if(m <= 1000) {
        ll res = dijkstra(1, g)[n] + dijkstra(n, g)[1];
        for(int i = 0; i < m; i++) {
            auto [u, v] = edges[i];
            g[u].erase(find(g[u].begin(), g[u].end(), make_pair(v, i)));
            g[v].push_back({u, i});
            res = min(res, dijkstra(1, g)[n] + dijkstra(n, g)[1] + D[i]);
            g[u].push_back({v, i});
            g[v].erase(find(g[v].begin(), g[v].end(), make_pair(u, i)));
        }
        if(res >= INF) res = -1;
        cout << res;
        return 0;
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 340 KB Output is correct
2 Correct 9 ms 340 KB Output is correct
3 Correct 143 ms 340 KB Output is correct
4 Correct 156 ms 452 KB Output is correct
5 Correct 21 ms 452 KB Output is correct
6 Correct 10 ms 428 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 162 ms 448 KB Output is correct
11 Correct 157 ms 440 KB Output is correct
12 Correct 160 ms 444 KB Output is correct
13 Correct 93 ms 440 KB Output is correct
14 Correct 120 ms 436 KB Output is correct
15 Correct 116 ms 440 KB Output is correct
16 Correct 121 ms 440 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2800 KB Output is correct
2 Correct 16 ms 2864 KB Output is correct
3 Correct 16 ms 2856 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 16 ms 2996 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 456 KB Output is correct
2 Correct 12 ms 340 KB Output is correct
3 Incorrect 10 ms 2132 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 340 KB Output is correct
2 Correct 9 ms 340 KB Output is correct
3 Correct 143 ms 340 KB Output is correct
4 Correct 156 ms 452 KB Output is correct
5 Correct 21 ms 452 KB Output is correct
6 Correct 10 ms 428 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 162 ms 448 KB Output is correct
11 Correct 157 ms 440 KB Output is correct
12 Correct 160 ms 444 KB Output is correct
13 Correct 93 ms 440 KB Output is correct
14 Correct 120 ms 436 KB Output is correct
15 Correct 116 ms 440 KB Output is correct
16 Correct 121 ms 440 KB Output is correct
17 Correct 15 ms 2800 KB Output is correct
18 Correct 16 ms 2864 KB Output is correct
19 Correct 16 ms 2856 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Incorrect 16 ms 2996 KB Output isn't correct
26 Halted 0 ms 0 KB -