oj.uz

Submission #757201

# Submission time Handle Problem Language Result Execution time Memory
757201 2023-06-12T19:05:16 Z sysia Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 3128 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;
    set<T>s;
    vector<int>pre(n+1);
    s.insert({0, from});
    while ((int)s.size()){
        auto [d, v] = *s.begin();
        s.erase(s.begin());
        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;
                s.insert({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;
    set<T>s;
    s.insert({0, from});
    while ((int)s.size()){
        auto [d, v] = *s.begin();
        s.erase(s.begin());
        if (dist[v] < d) continue;
        for (auto [x, c]: g[v]){
            if (dist[x] > dist[v] + c){
                dist[x] = dist[v] + c;
                s.insert({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);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 2 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 12 ms 340 KB Output is correct
10 Correct 34 ms 428 KB Output is correct
11 Correct 46 ms 340 KB Output is correct
12 Correct 45 ms 404 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 2992 KB Output is correct
2 Correct 42 ms 2888 KB Output is correct
3 Correct 63 ms 2900 KB Output is correct
4 Correct 5 ms 456 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 21 ms 2364 KB Output is correct
10 Correct 21 ms 2408 KB Output is correct
11 Correct 77 ms 3008 KB Output is correct
12 Correct 54 ms 2968 KB Output is correct
13 Correct 54 ms 2940 KB Output is correct
14 Correct 59 ms 3128 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 20 ms 2236 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 27 ms 2900 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 18 ms 2404 KB Output is correct
9 Correct 18 ms 2348 KB Output is correct
10 Correct 28 ms 2880 KB Output is correct
11 Correct 25 ms 3056 KB Output is correct
12 Correct 28 ms 3016 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 25 ms 3052 KB Output is correct
20 Correct 26 ms 2888 KB Output is correct
21 Correct 24 ms 2880 KB Output is correct
22 Correct 26 ms 2888 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 2 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 12 ms 340 KB Output is correct
10 Correct 34 ms 428 KB Output is correct
11 Correct 46 ms 340 KB Output is correct
12 Correct 45 ms 404 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 56 ms 2992 KB Output is correct
18 Correct 42 ms 2888 KB Output is correct
19 Correct 63 ms 2900 KB Output is correct
20 Correct 5 ms 456 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 21 ms 2364 KB Output is correct
26 Correct 21 ms 2408 KB Output is correct
27 Correct 77 ms 3008 KB Output is correct
28 Correct 54 ms 2968 KB Output is correct
29 Correct 54 ms 2940 KB Output is correct
30 Correct 59 ms 3128 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 20 ms 2236 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 27 ms 2900 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 18 ms 2404 KB Output is correct
39 Correct 18 ms 2348 KB Output is correct
40 Correct 28 ms 2880 KB Output is correct
41 Correct 25 ms 3056 KB Output is correct
42 Correct 28 ms 3016 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 25 ms 3052 KB Output is correct
50 Correct 26 ms 2888 KB Output is correct
51 Correct 24 ms 2880 KB Output is correct
52 Correct 26 ms 2888 KB Output is correct
53 Correct 39 ms 2840 KB Output is correct
54 Correct 50 ms 2876 KB Output is correct
55 Correct 49 ms 2888 KB Output is correct
56 Correct 4 ms 340 KB Output is correct
57 Correct 2 ms 340 KB Output is correct
58 Correct 434 ms 2336 KB Output is correct
59 Correct 517 ms 2344 KB Output is correct
60 Correct 720 ms 2336 KB Output is correct
61 Correct 382 ms 2252 KB Output is correct
62 Correct 483 ms 2332 KB Output is correct
63 Correct 688 ms 2364 KB Output is correct
64 Execution timed out 1067 ms 2808 KB Time limit exceeded
65 Halted 0 ms 0 KB -