Zzzz is planning a trip with his friends. There are N cities in Taiwan, and there may or may not be a road between any two cities. Given Zzzz's travel itinerary, let's determine whether this route is feasible. Of course, the trip could involve passing through other cities along the way. For example, if there are five cities, the roads AB, BC, AD, BD, and EA, and Zzzz's travel plan is ECBCD, he can achieve his goal through the route EABCBCBD.
Given the number of cities and their interconnectivity, and the order of the cities in Zzzz's travel plan, write a program to determine whether it is possible to visit the same city multiple times.
The first line contains the number of cities N, which must be less than or equal to 200. The second line contains the number of cities M, which must be less than or equal to 1000. The next N lines contain N integers. The jth number in the ith line indicates the connection between city i and city j. 1 indicates a connection, 0 indicates a disconnection. If A and B are connected, then B and A are also connected. The last line contains the itinerary. The cities are numbered from 1 to N, in ascending order.
On the first line, print YES if possible, NO if not possible.
3 3 0 1 0 1 0 1 0 1 0 1 2 3
YES
不公開 測資點#0 (5%): 0.5s , <1K
不公開 測資點#1 (5%): 0.5s , <1K
不公開 測資點#2 (5%): 0.5s , <1K
不公開 測資點#3 (5%): 0.5s , <1K
不公開 測資點#4 (5%): 0.5s , <1K
不公開 測資點#5 (5%): 0.5s , <1K
不公開 測資點#6 (5%): 0.5s , <1K
不公開 測資點#7 (5%): 0.5s , <1K
不公開 測資點#8 (5%): 0.5s , <1K
不公開 測資點#9 (5%): 0.5s , <1K
不公開 測資點#10 (5%): 0.5s , <1M
不公開 測資點#11 (5%): 0.5s , <1M
不公開 測資點#12 (5%): 0.5s , <1M
不公開 測資點#13 (5%): 0.5s , <1M
不公開 測資點#14 (5%): 0.5s , <1M
不公開 測資點#15 (5%): 0.5s , <1M
不公開 測資點#16 (5%): 0.5s , <1M
不公開 測資點#17 (5%): 0.5s , <1M
不公開 測資點#18 (5%): 0.5s , <1M
不公開 測資點#19 (5%): 0.5s , <1M
| 編號 | 身分 | 題目 | 主題 | 人氣 | 發表日期 |
|
沒有發現任何「解題報告」
|
|||||