제출 #649756

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
649756		RealSnake	Commuter Pass (JOI18_commuter_pass)	C++17	0 / 100	30 ms	7420 KiB

commuter_pass

#include "bits/stdc++.h"
#define ll long long

using namespace std;

int n, m, s, t, u, v;
int a[100005];
ll dist[305][305];
vector<pair<int, ll>> node[100005];
ll ans;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> m >> s >> t >> u >> v;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++)
            dist[i][j] = 1e18;
        dist[i][i] = 0;
    }
    for(int i = 0; i < m; i++) {
        int a, b;
        ll c;
        cin >> a >> b >> c;
        node[a].push_back({b, c});
        node[b].push_back({a, c});
        dist[a][b] = dist[b][a] = c;
    }
    for(int k = 1; k <= n; k++) {
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                if(dist[i][k] + dist[k][j] < dist[i][j])
                    dist[i][j] = dist[i][k] + dist[k][j];
            }
        }
    }
    ans = dist[u][v];
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            if(i == 2 && j == 1)
            if(dist[s][i] + dist[i][j] + dist[j][t] == dist[s][t] || dist[s][j] + dist[j][i] + dist[i][t] == dist[s][t])
                ans = min(ans, dist[u][i] + dist[j][v]);
        }
    }
    cout << ans;

    return 0;
}

• Subtask 1: 0 / 16
• Subtask 2: 0 / 15
• Subtask 3: 0 / 24
• Subtask 4: 0 / 45