|
||||||||||
Pleasant sheep and big big wolfTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3569 Accepted Submission(s): 1456 Problem Description In ZJNU, there is a well-known prairie. And it attracts pleasant sheep and his companions to have a holiday. Big big wolf and his families know about this, and quietly hid in the big lawn. As ZJNU ACM/ICPC team, we have an obligation to protect pleasant sheep and his companions to free from being disturbed by big big wolf. We decided to build a number of unit fence whose length is 1. Any wolf and sheep can not cross the fence. Of course, one grid can only contain an animal. Now, we ask to place the minimum fences to let pleasant sheep and his Companions to free from being disturbed by big big wolf and his companions. Input There are many cases. For every case: N and M£¨N,M<=200£© then N*M matrix: 0 is empty, and 1 is pleasant sheep and his companions, 2 is big big wolf and his companions. Output For every case: First line output ¡°Case p:¡±, p is the p-th case; The second line is the answer. Sample Input
Sample Output
Source | ||||||||||
|