ADACYCLE - Ada and Cycle
Ada the Ladybug is on a trip in Bugindia. There are many cities and some uni-directional roads connecting them. Ada is wondering about the shortest path, which begins in a city and ends in the same city. Since Ada likes short trips, she asked you to find the length of such path for each city in Bugindia.
Input
The first line will contain 0 < N ≤ 2000, the number of cities.
Then N lines follow, each containing N integers 0 ≤ Hij ≤ 1. One means, that there is a road between i and j (zero means there isn't a road).
Output
Print N lines, the length of shortest path which begins in city i and ends in city i. If the path doesn't exist, print "NO WAY" instead.
Example Input
5 0 1 1 1 1 1 0 0 0 1 0 0 1 1 0 0 0 1 0 0 0 0 0 1 0
Example Output
2 2 1 2 NO WAY
Example Input
5 0 1 0 0 1 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 0
Example Output
2 5 5 5 2
hide comments
|
reileen:
2024-12-08 09:16:57
are we allowed to view others' solutions? Last edit: 2024-12-08 09:17:25 |
|
glydon:
2022-10-15 04:21:28
I was facing TLE in the problem until I realized that when you are getting demanded source as an adjacent of someone,
|
|
cpchef7:
2022-01-24 20:38:41
Got an AC, in first time for first time |
|
rushi2001:
2021-05-20 00:22:48
Simple bfs from every point to find shortest distance to itself .
|
|
ktkrsk:
2020-06-05 17:13:08
Is it solvable in C#? Im getting TLE with BFS with Adj list and fast IO(StringBuilder etc). Or do I need to use the SCC? |
|
mr_dot_convict:
2019-06-03 10:26:07
The time limit shown is 3s but I found none of the accepted solutions below 3s. A naive bfs solution without any optimizations(except adjacency list if you call it an optimization) works well too but in approx. 5s.
|
|
snjumaheshwari:
2019-05-25 16:19:16
Solved but not satisfied. Changed cout (with fast i/o) to printf and worked.
|
|
vjvjain0:
2019-05-20 00:12:13
Got to learn applications of bfs and dfs. Sad that same logic which passed in CPP won't pass in Java :( |
|
dschen:
2019-03-18 16:09:33
why I always got Segmentation Fault ...
|
|
ameyanator:
2018-02-20 17:56:10
To get an AC you need to optimize your code so that you only consider those edges that the current node stems to. You should know this before or preprocess it. |
| Added by: | Morass |
| Date: | 2016-09-13 |
| Time limit: | 3s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 GOSU |
RSS