Submission #7208397

---

Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
using System.Runtime.CompilerServices;
using static MyUtil;

class MyUtil
{
    public static int[] ReadIntArray()
    {
	return ReadLine().Split().Select(x => int.Parse(x)).ToArray();
    }
    public static void WarshallFloyd(int[,] d, int v)
    {
	for (int k = 0; k < v; k++)
	    for (int i = 0; i < v; i++)
		for (int j = 0; j < v; j++)
		    d[i, j] = Math.Min(d[i, j], d[i, k] + d[k, j]);
    }
}

class Program
{
    public static void Main()
    {
	const int Inf = 1000 * 300 * 2;
	
	var tmp = ReadIntArray();
	int n = tmp[0], m = tmp[1];
	int[,] e = new int[n,n];
	for (int i = 0; i < n; i++)
	    for (int j = 0; j < n; j++)
		if (i==j) e[i,j] = 0;
		else      e[i,j] = Inf;
	for (int i = 0; i < m; i++)
	{
	    tmp = ReadIntArray();
	    int a = tmp[0] - 1, b = tmp[1] - 1, t = tmp[2];
	    e[a,b] = e[b,a] = t;
	}
	WarshallFloyd(e, n);

	int ans = Inf;
	for (int i = 0; i < n; i++)
	{
	    int w = 0;
	    for (int j = 0; j < n; j++)
	    {
		w = Math.Max(w, e[i,j]);
	    }
	    ans = Math.Min(ans, w);
	}
	WriteLine(ans);
    }
}

Submission Info

Judge Result