Submission #8065542


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
					println(i, " ",j)
					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 0
Code Size 740 Byte
Status WA
Exec Time 434 ms
Memory 115724 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 1
WA × 1
AC × 11
WA × 19
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 WA 428 ms 111860 KB
sample_02.txt AC 419 ms 111756 KB
subtask_1_01.txt AC 417 ms 113032 KB
subtask_1_02.txt AC 419 ms 112904 KB
subtask_1_03.txt AC 419 ms 112576 KB
subtask_1_04.txt AC 419 ms 111108 KB
subtask_1_05.txt WA 431 ms 111368 KB
subtask_1_06.txt WA 426 ms 113032 KB
subtask_1_07.txt AC 417 ms 111852 KB
subtask_1_08.txt AC 422 ms 110848 KB
subtask_1_09.txt AC 421 ms 112328 KB
subtask_1_10.txt AC 420 ms 111664 KB
subtask_1_11.txt WA 425 ms 112108 KB
subtask_1_12.txt WA 427 ms 112124 KB
subtask_1_13.txt AC 421 ms 111672 KB
subtask_1_14.txt WA 428 ms 113288 KB
subtask_1_15.txt AC 421 ms 112496 KB
subtask_1_16.txt WA 425 ms 111504 KB
subtask_1_17.txt WA 426 ms 113272 KB
subtask_1_18.txt WA 427 ms 114764 KB
subtask_1_19.txt WA 427 ms 112908 KB
subtask_1_20.txt WA 429 ms 113132 KB
subtask_1_21.txt WA 429 ms 111928 KB
subtask_1_22.txt WA 427 ms 113896 KB
subtask_1_23.txt WA 426 ms 112896 KB
subtask_1_24.txt WA 434 ms 115724 KB
subtask_1_25.txt WA 429 ms 111580 KB
subtask_1_26.txt WA 433 ms 113408 KB
subtask_1_27.txt WA 434 ms 111744 KB
subtask_1_28.txt WA 431 ms 112952 KB