# Faulty Robot

2018/04/22 20:32

As part of a CS course, Alice just ﬁnished programming her robot to explore a graph having n nodes, labeled 1, 2, . . . , n, and m directed edges. Initially the robot starts at node 1.
While nodes may have several outgoing edges, Alice programmed the robot so that any node may have a forced move to a speciﬁc one of its neighbors. For example, it may be that node 5 has outgoing edges to neighbors 1, 4, and 6 but that Alice programs the robot so that if it leaves 5 it must go to neighbor 4.
If operating correctly, the robot will always follow forced moves away from a node, and if reaching a node that does not have a forced move, the robot stops. Unfortunately, the robot is a bit buggy, and it might violate those rules and move to a randomly chosen neighbor of a node (whether or not there had been a designated forced move from that node). However, such a bug will occur at most once (and might never happen).
Alice is having trouble debugging the robot, and would like your help to determine what are the possible nodes where the robot could stop and not move again.
We consider two sample graphs, as given in Figures G.1 and G.2. In these ﬁgures, a red arrow indicate an edge corresponding to a forced move, while black arrows indicate edges to other neighbors. The circle around a node is red if it is a possible stopping node. In the ﬁrst example, the robot will cycle forever through nodes 1, 5, and 4 if it does not make a buggy move.
A bug could cause it to jump from 1 to 2, but that would be the only buggy move, and so it would never move on from there. It might also jump from 5 to 6 and then have a forced move to end at 7.
In the second example, there are no forced moves, so the robot would stay at 1 without any buggy moves. It might also make a buggy move from 1 to either 2 or 3, after which it would stop.

## 输入

The ﬁrst line contains two integers n and m, designating the number of nodes and number of edges such that 1 ≤ n ≤ 103, 0 ≤ m ≤ 104. The next m lines will each have two integers a and b, 1 ≤ |a|, b ≤ n and |a| ≠ b. If a > 0, there is a directed edge between nodes a and b that is not forced. If a < 0, then there is a forced directed edge from −a to b. There will be at most 900 such forced moves. No two directed edges will be the same. No two starting nodes for forced moves will be the same.

## 输出

Display the number of nodes at which the robot might come to a rest.

## 样例输入

``````7 9
1 2
2 3
-1 5
2 6
5 1
-4 1
5 6
-6 7
-5 4
``````

## 样例输出

``2简单来说就是给你一个图，然后一个机器人，机器人不出bug会往红边走，出bug会往黑边走，最多出一次bug，问机器人能在几个位置停下。思路:dfs红路，并记录下每次经过的点，如果这个点周围没有红边，ans++。再对于每个记录下的点，往其黑边进行一次dfs，接着走红边。代码待补。``

0
0 收藏

### 作者的其它热门文章 0 评论
0 收藏
0 