1155. Can I Post the lette
Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
Description
I am a traveler. I want to post a letter to Merlin. But because there are so many roads I can walk through, and maybe I can’t go to Merlin’s house following these roads, I must judge whether I can post the letter to Merlin before starting my travel.
Suppose the cities are numbered from 0 to N-1, I am at city 0, and Merlin is at city N-1. And there are M roads I can walk through, each of which connects two cities. Please note that each road is direct, i.e. a road from A to B does not indicate a road from B to A.
Please help me to find out whether I could go to Merlin’s house or not.
Input
There are multiple input cases. For one case, first are two lines of two integers N and M, (N<=200, M<=N*N/2), that means the number of citys and the number of roads. And Merlin stands at city N-1. After that, there are M lines. Each line contains two integers i and j, what means that there is a road from city i to city j.
The input is terminated by N=0.
Output
For each test case, if I can post the letter print “I can post the letter” in one line, otherwise print “I can't post the letter”.
Sample Input
320 11 2310 10
Sample Output
I can post the letterI can't post the letter
题目分析
判断两点是否可达
当做单源最短路径来做就可以了
#include <stdio.h>
#include <memory.h>
int main()
{
int city, road;
while (scanf("%d", &city)) {
if (city == 0)
break;
scanf("%d", &road);
int connected[city][city];
memset(connected, 0, sizeof(connected));
int start, end;
for (int i = 0; i < road; ++i) {
scanf("%d%d", &start, &end);
connected[start][end] = 1;
}
bool visited[city];
memset(visited, 0, sizeof(visited));
visited[0] = true;
while (true) {
bool flag = false;
int index;
for (int i = 0; i < city; ++i) {
if (!visited[i] && connected[0][i]) {
flag = true;
index = i;
break;
}
}
if (!flag)
break;
visited[index] = true;
for (int i = 0; i < city; ++i)
if (connected[index][i])
connected[0][i] = 1;
}
if (connected[0][city-1]) printf("I can post the letter\n");
else printf("I can't post the letter\n");
}
}