Musical

Special Judge Time Limit: 6000/3000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)

Problem Description

      Witty likes musicals most of all. He have seen all musicals in the world, and have seen some of them for ten or more times. But now the great time has come for Witty. He has put his own musical on a stage! Now he plans a tour around the country with his musical. The tour will visit n cities. Each week the musical will be staged in some new city. There will be a performance every day.
      Witty must choose the order in which the cities should be visited, to maximize the profit. Some cities are connected by bidirectional roads. Although musical equipment and performers move from city to city by air, roads play important role in a way musical fans visit musicals and exchange information about
musicals.
      To estimate the profit Witty has gathered information about musical fans in all cities. He divided them to three categories.
  • Ordinary musical fans go to one musical per week. They only attend musicals that are staged in their city. When there are several musicals possible, they choose the one which they have most information about. The amount of information depends on the number of neighboring cities that were already visited by the musical. Two cities are neighboring if they are connected by a road. If there are several musicals they have equal information about they go to a random one.
  • Crazy musical fans go to one musical every day. When there are several musicals in the city, theygo to a random one.
  • Finally, musical maniacs go to one musical every day, choosing one from the city they live in and all neighboring cities. When there are several possible musicals to choose from, they choose a random one.
      Having all this information, as well as the information about all other musicals that will be staged during next weeks, help Witty to choose the order in which the cities should be visited by the tour to maximize the expected number of fans that would come to see his musical.

Input

      The first line of the input file contains three integer numbers: n, m and k — the number of cities, roads, and other musicals (1 ≤ n ≤ 10, 0 ≤ m, 0 ≤ k ≤ 10). The following n lines describe cities. Each city is described with three integer numbers not exceeding 10— the number of ordinary musical fans, the number of crazy musical fans, and the number of musical maniacs.
      The following m lines describe roads, each road is described by two integer numbers — the numbers of cities it connects. No two cities are connected by more than one road, no road connects a city to itself. The following k lines give the time table of other musicals. Each musical is described with n numbers, the i-th of these numbers is the number of the city where the musical will be staged on the i-th week, or 0 if the musical will be on vacation that week. Note that unlike Witty’s musical, other musicals may perform in the same city for more than once.

Output

      Print the maximal possible expected amount of attendants of Witty’s musical at the first line of the output file. Your answer must be accurate up to 10−6.

      The second line must contain the permutation of n numbers — the order in which the cities must be visited to maximize the expected attendance.

Sample Input

3 2 1
100 10 20
20 50 30
10 40 30
1 2
1 3
2 3 1

Sample Output

1670.00000000
1 2 3

Hint

      In this example, there are 555 people expected to come see musical on the first week — 100 ordinary fans, 10 crazy fans every day for a total of 70, 20=2 = 10 maniacs from the first city, 30=2 = 15 maniacs from the second city, and 30 maniacs from the third city every day for a total of (10 + 15 + 30) · 7 = 385 maniacs, and therefore 100 + 70 + 385 = 555 people on the first week.
      On the second week the musical is expected to be visited by 20 + 50 · 7 + (20=2 + 30) · 7 = 650 people, and on the third week by 10 + 40 · 7 + (20=2 + 30=2) · 7 = 465 people, for a total of 1670 expected people on all three weeks.

Source

Andrew Stankevich Contest 21

Manager

Information
Solved Number25
Submit Number134
Problem Tags
No tag edit access
温馨提示:AC后可以编辑标签哦. ^-^
Login
LoginCancel