oj.uz

Submission #975034

# Submission time Handle Problem Language Result Execution time Memory
975034 2024-05-04T10:23:50 Z berr Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 8892 KB 
#include <bits/stdc++.h>
using namespace std; 
#define int long long
const int N=205, INF=1e16;
 
 
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    int n, m; cin >> n >> m;
    vector<vector<array<int, 3>>> g(n), g_rev(n);
    vector<array<int, 3>> e(m);
    vector<int> di(m);
 
    vector<int> all[n][n];
    int cnt =0;
    
    for(auto &[u, v, c]: e){
        cin >> u >> v >> c >> di[cnt];
        u--; v--;
        g[u].push_back({v, c, cnt});
        g_rev[v].push_back({u, c, cnt});
        all[u][v].push_back(cnt);
 
        cnt++;
    }
    for(int i=0; i<n; i++){
        for(int l=0; l<n; l++){
            sort(all[i][l].begin(), all[i][l].end(), [&](int x, int y){
                return e[x][2] < e[y][2];
            });
        }
    }
 
    // a = 1 -> i, b = i -> n
    // c = i -> 1 without x
    // d = n -> i without x
 
    vector a(n+1, vector(n, INF)), b(n+1, vector(n, INF));
    vector c(n+1, vector(n, INF)), d(n+1, vector(n, INF));
    auto dijkstra=[&](int v, int skip, auto& dist, auto&&geey){
        dist[v] = 0;
        priority_queue<array<int, 2>> pq;
        pq.push({0, v});
 
        while(pq.size()){
            auto [cost, v]=pq.top();
            pq.pop(); cost*=-1;
            if(v==skip||dist[v] != cost) continue;
 
            for(auto [i, l, j]: geey[v]){
                if(dist[i] > cost+l){
                    dist[i] = cost+l;
                    pq.push({-dist[i], i});
                }
            }
        }
    };
 
 
    for(int i=0; i<=n; i++){
        dijkstra(0, i, a[i], g);
        dijkstra(n-1, i, b[i], g_rev);
        dijkstra(0, i, c[i], g_rev);
        dijkstra(n-1, i, d[i], g);
    }
 
    int ans=INF;
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            //blocklanan edge i ve j arasında
 
            // 0 -> i // swap j -> n
            if(i==j) continue;
 
            if(a[j][i]==INF||b[i][j]==INF) continue;
            int sum=a[j][i]+b[i][j];
            int tsum=sum, ksum=INF;
            for(auto k: all[j][i]){
                sum=tsum;
                sum+=e[k][2];
                sum+=di[k];
                if(all[j][i].size()>1){
                 
                    if(k==all[j][i][0])
                        ans=min(ans, sum+d[i][j]+c[j][i]+e[all[j][i][1]][2]);
                    else 
                        ans=min(ans, sum+d[i][j]+c[j][i]+e[all[j][i][0]][2]);
 
                }
 
                ans=min(ans, sum+c[i][j]+d[j][i]+e[k][2]);
                // diğer değer
 
                if(all[i][j].size()>0){
                    ans=min(ans, sum+c[i][j]+d[j][i]+e[all[i][j][0]][2]);
                }
                ksum=min(ksum, sum);

            }   

            for(int g=0; g<n; g++){
                if(g!=i&&g!=j){
                    ans=min(ans, ksum+d[j][g]+c[i][g]);
                    ans=min(ans, ksum+d[i][g]+c[j][g]);
                }
            }         

        }
    }
 
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            //blocklanan edge i ve j arasında
            if(i==j) continue;
            if(d[j][i]==INF||c[i][j]==INF) continue;
            int sum=d[j][i]+c[i][j];
          //  cout<<i<<" "<<j<<"\n";
            //cout<<d[n][i]<<" "<<c[n][j]<<"\n";
            int tsum=sum, ksum=INF;;
            for(auto k: all[j][i]){
                sum=tsum;
                sum+=e[k][2];
                sum+=di[k];
 
                //cout<<j<<" "<<i<<"\n";
 
                //j-> i di
                //i -> j yaptı
 
                if(all[j][i].size()>1){
                    if(k==all[j][i][0])
                        ans=min(ans, sum+b[j][i]+a[i][j]+e[all[j][i][1]][2]);
                    else 
                        ans=min(ans, sum+b[j][i]+a[i][j]+e[all[j][i][0]][2]);
                }
                //cout<<j<<" "<<i<<"\n";
 
                ans=min(ans, sum+a[j][i]+b[i][j]+e[k][2]);
                // diğer değer
 
                if(all[i][j].size()>0){
                    ans=min(ans, sum+a[j][i]+b[i][j]+e[all[i][j][0]][2]);
                }
                ksum=min(ksum, sum);
 
            }
            for(int g=0; g<n; g++){
                if(g!=i&&g!=j){
                    ans=min(ans, ksum+b[j][g]+a[i][g]);
                    ans=min(ans, ksum+b[i][g]+a[j][g]);
                }
            }
        }
    }
    ans = min(ans, a[n][n-1]+d[n][0]);
    if(ans==INF) cout<<-1;
    else cout<<ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 2808 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 50 ms 2652 KB Output is correct
4 Correct 59 ms 2652 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 63 ms 2832 KB Output is correct
11 Correct 60 ms 2820 KB Output is correct
12 Correct 57 ms 2904 KB Output is correct
13 Correct 12 ms 2648 KB Output is correct
14 Correct 32 ms 2828 KB Output is correct
15 Correct 28 ms 2652 KB Output is correct
16 Correct 39 ms 2652 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 8412 KB Output is correct
2 Correct 154 ms 8124 KB Output is correct
3 Correct 159 ms 8312 KB Output is correct
4 Correct 55 ms 2904 KB Output is correct
5 Correct 44 ms 2652 KB Output is correct
6 Correct 4 ms 2652 KB Output is correct
7 Correct 3 ms 2652 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 70 ms 8540 KB Output is correct
10 Correct 74 ms 8536 KB Output is correct
11 Correct 110 ms 8284 KB Output is correct
12 Correct 122 ms 8284 KB Output is correct
13 Correct 137 ms 7772 KB Output is correct
14 Correct 112 ms 8548 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 2812 KB Output is correct
2 Correct 6 ms 2652 KB Output is correct
3 Correct 86 ms 7024 KB Output is correct
4 Correct 5 ms 3156 KB Output is correct
5 Correct 109 ms 8280 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 48 ms 8796 KB Output is correct
9 Correct 49 ms 8892 KB Output is correct
10 Correct 89 ms 8256 KB Output is correct
11 Correct 82 ms 8028 KB Output is correct
12 Correct 72 ms 8540 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 82 ms 8768 KB Output is correct
20 Correct 73 ms 8400 KB Output is correct
21 Correct 77 ms 8348 KB Output is correct
22 Correct 83 ms 8284 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 2808 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 50 ms 2652 KB Output is correct
4 Correct 59 ms 2652 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 63 ms 2832 KB Output is correct
11 Correct 60 ms 2820 KB Output is correct
12 Correct 57 ms 2904 KB Output is correct
13 Correct 12 ms 2648 KB Output is correct
14 Correct 32 ms 2828 KB Output is correct
15 Correct 28 ms 2652 KB Output is correct
16 Correct 39 ms 2652 KB Output is correct
17 Correct 167 ms 8412 KB Output is correct
18 Correct 154 ms 8124 KB Output is correct
19 Correct 159 ms 8312 KB Output is correct
20 Correct 55 ms 2904 KB Output is correct
21 Correct 44 ms 2652 KB Output is correct
22 Correct 4 ms 2652 KB Output is correct
23 Correct 3 ms 2652 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 70 ms 8540 KB Output is correct
26 Correct 74 ms 8536 KB Output is correct
27 Correct 110 ms 8284 KB Output is correct
28 Correct 122 ms 8284 KB Output is correct
29 Correct 137 ms 7772 KB Output is correct
30 Correct 112 ms 8548 KB Output is correct
31 Correct 40 ms 2812 KB Output is correct
32 Correct 6 ms 2652 KB Output is correct
33 Correct 86 ms 7024 KB Output is correct
34 Correct 5 ms 3156 KB Output is correct
35 Correct 109 ms 8280 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 48 ms 8796 KB Output is correct
39 Correct 49 ms 8892 KB Output is correct
40 Correct 89 ms 8256 KB Output is correct
41 Correct 82 ms 8028 KB Output is correct
42 Correct 72 ms 8540 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 82 ms 8768 KB Output is correct
50 Correct 73 ms 8400 KB Output is correct
51 Correct 77 ms 8348 KB Output is correct
52 Correct 83 ms 8284 KB Output is correct
53 Correct 167 ms 8488 KB Output is correct
54 Correct 167 ms 8608 KB Output is correct
55 Correct 174 ms 8484 KB Output is correct
56 Correct 48 ms 2804 KB Output is correct
57 Correct 51 ms 2652 KB Output is correct
58 Correct 157 ms 7100 KB Output is correct
59 Correct 168 ms 7260 KB Output is correct
60 Correct 151 ms 7512 KB Output is correct
61 Correct 164 ms 7300 KB Output is correct
62 Correct 148 ms 7280 KB Output is correct
63 Correct 174 ms 7292 KB Output is correct
64 Execution timed out 1069 ms 7992 KB Time limit exceeded
65 Halted 0 ms 0 KB -