oj.uz

Submission #757205

# Submission time Handle Problem Language Result Execution time Memory
757205 2023-06-12T19:07:06 Z sysia Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 3116 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

typedef pair<int, int> T;
set<T>cycle;
const long long oo = 1e18;
const int oo2 = 1e9+7;

vector<int> dijkstra(int n, vector<vector<T>>&g, int from, int to = -1){
    vector<int>dist(n+1, oo2);
    dist[from] = 0;
    priority_queue<T>pq;
    vector<int>pre(n+1);
    pq.push({0, from});
    while ((int)pq.size()){
        auto [d, v] = pq.top();
        pq.pop();
        if (dist[v] < d) continue;
        for (auto [x, c]: g[v]){
            if (dist[x] > dist[v] + c){
                pre[x] = v;
                dist[x] = dist[v] + c;
                pq.push({dist[x], x});
            }
        }
    }
    if (to != -1){
        int now = to;
        vector<int>path;
        while (now){
            path.emplace_back(now);
            now = pre[now];
        }
        reverse(path.begin(), path.end());
        for (int i = 1; i<(int)path.size(); i++) cycle.insert({path[i-1], path[i]});
    }
    return dist;
}

int dijkstra2(int n, vector<vector<T>>&g, int from, int to = -1){
    vector<int>dist(n+1, oo2);
    dist[from] = 0;
    priority_queue<T>pq;
    pq.push({0, from});
    while ((int)pq.size()){
        auto [d, v] = pq.top(); pq.pop();
        if (dist[v] < d) continue;
        for (auto [x, c]: g[v]){
            if (dist[x] > dist[v] + c){
                dist[x] = dist[v] + c;
                pq.push({dist[x], x});
            }
        }
    }
    return dist[to];
}


void solve(){
    int n, m; cin >> n >> m;
    vector<vector<T>>g(n+1), gt(n+1);
    vector<tuple<int, int, int, int>>edges;
    for (int i = 0; i<m; i++){
        int a, b, c, d; cin >> a >> b >> c >> d;
        g[a].emplace_back(b, c);
        gt[b].emplace_back(a, c);
        edges.emplace_back(a, b, c, d);
    }
    auto d1 = dijkstra(n, g, 1, n); //1 do x
    auto dn = dijkstra(n, g, n, 1); //n do x
    auto d1rev = dijkstra(n, gt, 1); //x do 1
    auto dnrev = dijkstra(n, gt, n); //x do n
    long long ans = d1[n] + dn[1];
    int k = 0;
    debug(cycle);
    for (auto &[a, b, c, d]: edges){
        if (cycle.find({a, b}) != cycle.end()){
            debug(a, b);
            long long tmp = d;
            vector<vector<T>>G(n+1);
            for (int i = 0; i<m; i++){
                auto [A, B, C, D] = edges[i];
                if (i == k) {
                    G[B].emplace_back(A, C);
                    continue;
                }
                G[A].emplace_back(B, C);
            }
            tmp += dijkstra2(n, G, 1, n) + dijkstra2(n, G, n, 1);
            ans = min(ans, tmp);
        } else {
            ans = min(ans, (long long)d + (long long)min(d1[n], d1[b]+c+dnrev[a]) + (long long)min(dn[1], dn[b] + c + d1rev[a]));
        }
        k++;
    }
    if (ans >= oo2) cout << "-1\n";
    else cout << ans << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 16 ms 400 KB Output is correct
4 Correct 29 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 14 ms 380 KB Output is correct
10 Correct 510 ms 340 KB Output is correct
11 Correct 727 ms 404 KB Output is correct
12 Correct 640 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 11 ms 344 KB Output is correct
15 Correct 9 ms 404 KB Output is correct
16 Correct 17 ms 408 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 481 ms 3008 KB Output is correct
2 Correct 354 ms 3004 KB Output is correct
3 Correct 420 ms 3004 KB Output is correct
4 Correct 26 ms 340 KB Output is correct
5 Correct 16 ms 400 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 212 KB Output is correct
9 Correct 23 ms 2376 KB Output is correct
10 Correct 22 ms 2416 KB Output is correct
11 Correct 432 ms 3024 KB Output is correct
12 Correct 210 ms 2996 KB Output is correct
13 Correct 272 ms 2996 KB Output is correct
14 Correct 378 ms 3116 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 20 ms 2252 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 34 ms 2884 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 22 ms 2320 KB Output is correct
9 Correct 16 ms 2308 KB Output is correct
10 Correct 25 ms 2940 KB Output is correct
11 Correct 20 ms 2928 KB Output is correct
12 Correct 23 ms 3060 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 22 ms 3052 KB Output is correct
20 Correct 24 ms 2888 KB Output is correct
21 Correct 21 ms 2964 KB Output is correct
22 Correct 21 ms 2892 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 16 ms 400 KB Output is correct
4 Correct 29 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 14 ms 380 KB Output is correct
10 Correct 510 ms 340 KB Output is correct
11 Correct 727 ms 404 KB Output is correct
12 Correct 640 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 11 ms 344 KB Output is correct
15 Correct 9 ms 404 KB Output is correct
16 Correct 17 ms 408 KB Output is correct
17 Correct 481 ms 3008 KB Output is correct
18 Correct 354 ms 3004 KB Output is correct
19 Correct 420 ms 3004 KB Output is correct
20 Correct 26 ms 340 KB Output is correct
21 Correct 16 ms 400 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 212 KB Output is correct
25 Correct 23 ms 2376 KB Output is correct
26 Correct 22 ms 2416 KB Output is correct
27 Correct 432 ms 3024 KB Output is correct
28 Correct 210 ms 2996 KB Output is correct
29 Correct 272 ms 2996 KB Output is correct
30 Correct 378 ms 3116 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 20 ms 2252 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 34 ms 2884 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 22 ms 2320 KB Output is correct
39 Correct 16 ms 2308 KB Output is correct
40 Correct 25 ms 2940 KB Output is correct
41 Correct 20 ms 2928 KB Output is correct
42 Correct 23 ms 3060 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 22 ms 3052 KB Output is correct
50 Correct 24 ms 2888 KB Output is correct
51 Correct 21 ms 2964 KB Output is correct
52 Correct 21 ms 2892 KB Output is correct
53 Correct 226 ms 2880 KB Output is correct
54 Correct 454 ms 2960 KB Output is correct
55 Correct 396 ms 3008 KB Output is correct
56 Correct 19 ms 396 KB Output is correct
57 Correct 14 ms 408 KB Output is correct
58 Correct 993 ms 2304 KB Output is correct
59 Execution timed out 1075 ms 2436 KB Time limit exceeded
60 Halted 0 ms 0 KB -