제출 #1104093

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1104093		Champ_Naman	Olympic Bus (JOI20_ho_t4)	C++17	11 / 100	31 ms	5776 KiB

ho_t4

#include<bits/stdc++.h>
#define int long long
using namespace std;

vector<pair<int,int>> g[201];

inline void solve(){
    int n, m;
    cin>>n>>m;

    vector<tuple<int,int,int,int>> e;
    vector<vector<int>> dist(n+1, vector<int>(n+1, 1e18));
    for(int i=1; i<=n; i++) dist[i][i] = 0;

    for(int i=0; i<m; i++){
        int u, v, c, d;
        cin>>u>>v>>c>>d;

        e.push_back({u, v, c, d});
        g[u].push_back({v, c});
        dist[u][v] = min(dist[u][v], c);
    }

    for(int k=1; k<=n; k++){
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }

    int ans = dist[1][n] + dist[n][1];
    for(auto [u, v, c, d] : e){
        ans = min(ans, d + min(dist[1][n], dist[1][v] + c + dist[u][n]) + min(dist[n][1], dist[n][v] + c + dist[u][1]));
    }
    
    cout<<(ans >= 1e18 ? -1 : ans);
}

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

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

    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 11 / 11
• Subtask 3: 0 / 21
• Subtask 4: 0 / 63