oj.uz

Submission #757665

# Submission time Handle Problem Language Result Execution time Memory
757665 2023-06-13T14:27:06 Z sysia Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 3784 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
#define ll long long
typedef pair<int, int> T;
set<T>cycle;
const int oo2 = 2e9+7;
const int mx = 202;
int n;
int pre[mx];
priority_queue<T>pq;
 
vector<int> dijkstra(vector<int>&dist, vector<vector<T>>&g, int from, int to = -1){
    dist[from] = 0;
    
    if (to != -1) {
        for (int i = 1; i<=n; i++) pre[i] = 0;
    }
    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;
        int prev = -1;
        while (now){
            if (prev != -1) cycle.insert({now, prev});
            prev = now;
            now = pre[now];
        }
    }
    return dist;
}


int dist[mx];
int dijkstra2(vector<vector<T>>&g, int from, int to){
    for (int i = 1; i<=n; i++) dist[i] = oo2;
    dist[from] = 0;
    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 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);
    }
    vector<int>d1(n+1, oo2), dn(n+1, oo2), d1rev(n+1, oo2), dnrev(n+1, oo2);
    dijkstra(d1, g, 1, n); //1 do x
    dijkstra(dn, g, n, 1); //n do x
    dijkstra(d1rev, gt, 1); //x do 1
    dijkstra(dnrev, gt, n); //x do n
    long long ans = (long long)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);
            auto [A, B, C, D] = edges[k];
            for (int i = 0; i<(int)g[A].size(); i++){
                if (g[A][i] == make_pair(B, C)){
                    swap(g[A][i], g[A].back());
                    break;
                }
            }
            g[A].pop_back();
            g[B].emplace_back(A, C);
            long long tmp = (long long)d + (long long)dijkstra2(g, 1, n) + (long long)dijkstra2(g, n, 1);
            debug(tmp);
            g[B].pop_back();
            g[A].emplace_back(B, C);
            ans = min(ans, tmp);
        } else {
            ans = min(ans, (ll)d + min((ll)d1[n], (ll)d1[b]+c+dnrev[a]) + min((ll)dn[1], (ll)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 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 16 ms 340 KB Output is correct
4 Correct 29 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 4 ms 340 KB Output is correct
10 Correct 456 ms 380 KB Output is correct
11 Correct 662 ms 516 KB Output is correct
12 Correct 697 ms 384 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 10 ms 340 KB Output is correct
15 Correct 8 ms 384 KB Output is correct
16 Correct 16 ms 392 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 2352 KB Output is correct
2 Correct 258 ms 3392 KB Output is correct
3 Correct 317 ms 3604 KB Output is correct
4 Correct 24 ms 468 KB Output is correct
5 Correct 14 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 1 ms 212 KB Output is correct
9 Correct 24 ms 3520 KB Output is correct
10 Correct 26 ms 3624 KB Output is correct
11 Correct 294 ms 3528 KB Output is correct
12 Correct 161 ms 3540 KB Output is correct
13 Correct 196 ms 3604 KB Output is correct
14 Correct 276 ms 3784 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 15 ms 2252 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 19 ms 2388 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 18 ms 2360 KB Output is correct
9 Correct 18 ms 2416 KB Output is correct
10 Correct 18 ms 2444 KB Output is correct
11 Correct 17 ms 2444 KB Output is correct
12 Correct 17 ms 2440 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 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 1 ms 212 KB Output is correct
19 Correct 28 ms 2540 KB Output is correct
20 Correct 19 ms 2364 KB Output is correct
21 Correct 20 ms 2432 KB Output is correct
22 Correct 21 ms 2344 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 16 ms 340 KB Output is correct
4 Correct 29 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 4 ms 340 KB Output is correct
10 Correct 456 ms 380 KB Output is correct
11 Correct 662 ms 516 KB Output is correct
12 Correct 697 ms 384 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 10 ms 340 KB Output is correct
15 Correct 8 ms 384 KB Output is correct
16 Correct 16 ms 392 KB Output is correct
17 Correct 381 ms 2352 KB Output is correct
18 Correct 258 ms 3392 KB Output is correct
19 Correct 317 ms 3604 KB Output is correct
20 Correct 24 ms 468 KB Output is correct
21 Correct 14 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 1 ms 212 KB Output is correct
25 Correct 24 ms 3520 KB Output is correct
26 Correct 26 ms 3624 KB Output is correct
27 Correct 294 ms 3528 KB Output is correct
28 Correct 161 ms 3540 KB Output is correct
29 Correct 196 ms 3604 KB Output is correct
30 Correct 276 ms 3784 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 15 ms 2252 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 19 ms 2388 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 18 ms 2360 KB Output is correct
39 Correct 18 ms 2416 KB Output is correct
40 Correct 18 ms 2444 KB Output is correct
41 Correct 17 ms 2444 KB Output is correct
42 Correct 17 ms 2440 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 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 1 ms 212 KB Output is correct
49 Correct 28 ms 2540 KB Output is correct
50 Correct 19 ms 2364 KB Output is correct
51 Correct 20 ms 2432 KB Output is correct
52 Correct 21 ms 2344 KB Output is correct
53 Correct 180 ms 3412 KB Output is correct
54 Correct 364 ms 3320 KB Output is correct
55 Correct 300 ms 3264 KB Output is correct
56 Correct 17 ms 336 KB Output is correct
57 Correct 14 ms 408 KB Output is correct
58 Correct 618 ms 3020 KB Output is correct
59 Execution timed out 1062 ms 3188 KB Time limit exceeded
60 Halted 0 ms 0 KB -