제출 #924096

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
924096		MinaRagy06	Commuter Pass (JOI18_commuter_pass)	C++17	24 / 100	128 ms	262144 KiB

commuter_pass

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

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int n, m;
	cin >> n >> m;
	int s, t, u, v;
	cin >> s >> t;
	cin >> u >> v;
	s--, t--, u--, v--;
	ll dist[n][n];
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			dist[i][j] = 1e18;
		}
		dist[i][i] = 0;
	}
	for (int i = 0, x, y, w; i < m; i++) {
		cin >> x >> y >> w;
		x--, y--;
		dist[x][y] = dist[y][x] = w;
	}
	for (int k = 0; k < n; k++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
			}
		}
	}
	ll mn = 1e18, best = 1e18;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (dist[s][i] + dist[i][j] + dist[j][t] < mn) {
				mn = dist[s][i] + dist[i][j] + dist[j][t];
				best = min({dist[u][i] + dist[j][v], dist[v][i] + dist[j][u]});
			} else if (dist[s][i] + dist[i][j] + dist[j][t] == mn) {
				best = min({best, dist[u][i] + dist[j][v], dist[v][i] + dist[j][u]});
			}
		}
	}
	best = min(best, dist[u][v]);
	cout << best << '\n';
	return 0;
}

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