Submission #8065543


Source Code Expand

parseInt(x) = parse(Int, x)
parseMap(x::Array{SubString{String},1}) = map(parseInt, x)

function main()
	n,m = readline() |> split |> parseMap
	g = zeros(Int,n,n)
	d = 10000000*ones(Int,n,n)
	for i in 1:n
		d[i,i] = 0
	end
	x = 0
	for i in 1:m
		a,b,c = readline() |> split |> parseMap
		g[a,b] = c
		g[b,a] = c
		d[a,b] = c
		d[b,a] = c
	end
	for k in 1:n
		for i in 1:n
			for j in 1:n
				d[i,j] = min(d[i,j],d[i,k]+d[k,j])
			end
		end
	end
	for i in 1:n-1
		for j in i+1:n
			if g[i,j] > 0
				f = 0
				for s in 1:n
					if d[s,i] + g[i,j] == d[s,j]
						f = 1
						break
					end
				end
				if f == 0
					x += 1
				end
			end
		end
	end
	println(x)
end

main()

Submission Info

Submission Time
Task D - Candidates of No Shortest Paths
User T49E2
Language Julia (0.5.0)
Score 400
Code Size 716 Byte
Status AC
Exec Time 899 ms
Memory 169224 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt
Case Name Status Exec Time Memory
sample_01.txt AC 899 ms 169224 KB
sample_02.txt AC 416 ms 111508 KB
subtask_1_01.txt AC 418 ms 114664 KB
subtask_1_02.txt AC 418 ms 110576 KB
subtask_1_03.txt AC 418 ms 112668 KB
subtask_1_04.txt AC 418 ms 110712 KB
subtask_1_05.txt AC 419 ms 112072 KB
subtask_1_06.txt AC 417 ms 111644 KB
subtask_1_07.txt AC 419 ms 111988 KB
subtask_1_08.txt AC 418 ms 111328 KB
subtask_1_09.txt AC 418 ms 112396 KB
subtask_1_10.txt AC 420 ms 111208 KB
subtask_1_11.txt AC 417 ms 112000 KB
subtask_1_12.txt AC 417 ms 111528 KB
subtask_1_13.txt AC 418 ms 112412 KB
subtask_1_14.txt AC 419 ms 112516 KB
subtask_1_15.txt AC 419 ms 112236 KB
subtask_1_16.txt AC 416 ms 111060 KB
subtask_1_17.txt AC 418 ms 112180 KB
subtask_1_18.txt AC 417 ms 111832 KB
subtask_1_19.txt AC 419 ms 113028 KB
subtask_1_20.txt AC 418 ms 114056 KB
subtask_1_21.txt AC 425 ms 110848 KB
subtask_1_22.txt AC 417 ms 112092 KB
subtask_1_23.txt AC 418 ms 114764 KB
subtask_1_24.txt AC 418 ms 110980 KB
subtask_1_25.txt AC 419 ms 115728 KB
subtask_1_26.txt AC 417 ms 111552 KB
subtask_1_27.txt AC 420 ms 112048 KB
subtask_1_28.txt AC 421 ms 114056 KB