熊猫烧香问题.docVIP

Project 3: Attack of Panda Time Limit: 3 seconds The computers in our network were connected in an array of M rows and N columns. Any one computer was connected directly to only the computers horizontally or vertically adjacent to it. At the beginning, T computers were infected with the Panda virus, each with a different variation, denoted by Type1, Type2, ... TypeT. Given that each computer in the network had a specific integer defense level L (0 L 1000). The Panda virus could rapidly spread across the network according to the following rules: The virus could only spread across the network from the infected computers to the clean ones; If a computer had already been infected by one variation of the virus, it would never be infected again by another variation; The attacking capability of the Panda virus would increase each day. In day 1, the virus could only infect computers with the defense level 1 provided that the virus could reach those computers. A computer with a defense level L 1 could stop the virus. In day D, the virus could spread to all the computers connected with their defense level L ( D, provided that the virus was not stopped by any computer with a defense level L D; Within the same day, the Type1 variation would attack first and infect all the computers it could reach. Then the virus variations Type2, Type3, ... TypeT would be activated in order. Given the network in the following figure as an example: In the 3(4 network, there were initially two computers infected by variations of Type1 and Type2, respectively. We may represent the status of the network by a 3(4 matrix, with –L representing a clean computer with defense level L, and a positive integer i representing the variation type index by which the computer was infected. Hence the given network corresponds to the matrix . In the first day, Type1 was stopped by its two neighboring computers, while Type2 attacked the two computers in the 3rd row with defense level 1. The matrix t