Preparing NOJ

Shortest Path

1000ms 65536K

Description:

There is a graph with N nodes. Given the length of each edge between the nodes. Find the shortest path from S to E.

Input:

First line: three positive integer number N (N <= 100), S (S <= N), E(E <= N).
Next N lines: the i-th line contains N non-negative integers (<= 100), indicating the length of edge from the i-th node to any nodes.

Output:

One line contains several integers, indicating the indexes of node in the shortest path from S to E.

Sample Input:

4 1 4
0 3 6 8
3 0 2 9
6 2 0 2
8 9 2 0

Sample Output:

1 2 3 4

Info

NOIOPEN

Provider NOIOPEN

Origin 简单英文题

Code NOIOPJENGLISH07

Tags

Submitted 0

Passed 0

AC Rate 0%

Date 08/15/2021 18:56:20

Related

Nothing Yet