제출 #1104331

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1104331		zephyrion	Olympic Bus (JOI20_ho_t4)	C++17	0 / 100	46 ms	5572 KiB

ho_t4

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

typedef vector<tuple<int, int, int, int>> vtiiii;
typedef vector<vector<int>> vvi;
typedef vector<pair<int, int>> vpii;

const int INF = 1e18;

signed main() {
    int n, m;
    cin >> n >> m;

    vtiiii edges;
    vvi dist(n + 1, vector<int>(n + 1, INF));
    vpii g[201];

    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;

        edges.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] : edges) {
        ans = min(ans, d + min(dist[1][v] + c + dist[u][n], dist[1][n]) 
        + min(dist[n][v] + c + dist[u][1], dist[n][1]));
    }
    if (ans == INF){
        cout << -1;
    }
    else{
        cout << ans;
    }

}

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