2005ACM杯比赛往年试题集锦.doc

Constructing Roads Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 12262 Accepted: 4862 Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected. We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum. Input The first line is an integer N (3 = N = 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000]) between village i and village j. Then there is an integer Q (0 = Q = N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 = a b = N), which means the road between village a and village b has been built. Output You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum. Sample Input 3 0 990 692 990 0 179 692 179 0 1 1 2 Sample Output 179 Source PKU Monthly,kicc The Wolves and the Sheep Time Limit: 15000MS Memory Limit: 131072K Total Submissions: 332 Accepted: 77 Description Nalim, Ocis and Remmarguts are playing on grass, and they feel very hungry now. As baby wolves, they decide to capture a little sheep to eat. Fortunately, they immediately discover a sheep roaming around the grass. However, what they found is the queen of the sheep Mmxl, who has extraordinary speed that can compare with the wolves, and is very clever! Can you judge whether the baby wolves will capture Mmxl! There are some rules to follow: The grass field is a rectangular area that consist of R *