The 2013 ACM-ICPC Asia Changsha Regional Contest - J

Josephina and RPG

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB      Special Judge

---

A role-playing game (RPG and sometimes roleplaying game) is a game in which players assume the roles of characters in a fictional setting. Players take responsibility for acting out these roles within a narrative, either through literal acting or through a process of structured decision-making or character development.

Recently, Josephina is busy playing a RPG named TX3. In this game, M characters are available to by selected by players. In the whole game, Josephina is most interested in the "Challenge Game" part.

The Challenge Game is a team play game. A challenger team is made up of three players, and the three characters used by players in the team are required to be different. At the beginning of the Challenge Game, the players can choose any characters combination as the start team. Then, they will fight with N AI teams one after another. There is a special rule in the Challenge Game: once the challenger team beat an AI team, they have a chance to change the current characters combination with the AI team. Anyway, the challenger team can insist on using the current team and ignore the exchange opportunity. Note that the players can only change the characters combination to the latest defeated AI team. The challenger team get victory only if they beat all the AI teams.

Josephina is good at statistics, and she writes a table to record the winning rate between all different character combinations. She wants to know the maximum winning probability if she always chooses best strategy in the game. Can you help her?

Input

There are multiple test cases. The first line of each test case is an integer M (3 ≤ M ≤ 10), which indicates the number of characters. The following is a matrixT whose size is R × R. R equals to C(M, 3). T(i, j) indicates the winning rate of team i when it is faced with team j. We guarantee that T(i, j) + T(j, i) = 1.0. All winning rates will retain two decimal places. An integer N (1 ≤ N ≤ 10000) is given next, which indicates the number of AI teams. The following line contains Nintegers which are the IDs (0-based) of the AI teams. The IDs can be duplicated.

Output

For each test case, please output the maximum winning probability if Josephina uses the best strategy in the game. For each answer, an absolute error not more than 1e-6 is acceptable.

Sample Input

4
0.50 0.50 0.20 0.30
0.50 0.50 0.90 0.40
0.80 0.10 0.50 0.60
0.70 0.60 0.40 0.50
3
0 1 2

Sample Output

0.378000

#include <iostream>
#include <string>
#include <string.h>
#include <map>
#include <stdio.h>
#include <algorithm>
#include <queue>
#include <vector>
#define Min(a,b) ((a)<(b)?(a):(b))
#pragma comment(linker, "/STACK:16777216")
using namespace std ;
const int Max_N =  ;
typedef long long LL ;
int N ,AIN;
int AI[Max_N] ;
double grid[][] ;
double dist[][Max_N] ;
struct Node{
    int id ;
    double exp ;
    int step ;
    friend bool operator < (const Node A ,const Node B){
       return A.exp < B.exp ;
    }
    Node(){} ;
    Node(int i ,double e ,int s):id(i),exp(e),step(s){} ;
};

double bfs(){
   priority_queue<Node>que ;
   for(int i =  ;i < N ;i++)
      que.push(Node(i,1.0,)) ;
   memset(dist,,sizeof(dist)) ;
   while(!que.empty()){
      Node now = que.top() ;
      que.pop() ;
      if(now.step == AIN+)
         return now.exp ;
      int u = now.id ;
      int v = AI[now.step] ;
      double w = now.exp*grid[u][v] ;
      if(w > dist[u][now.step+]){
          dist[u][now.step+] = w ;
          que.push(Node(u,w,now.step+)) ;
      }
      if(w > dist[v][now.step+]){
          dist[v][now.step+] = w ;
          que.push(Node(v,w,now.step+)) ;
      }
   }
}

int main(){
   int m ;
   while(scanf("%d",&m)!=EOF){
       N = m*(m-)*(m-)/ ;
       for(int i =  ;i < N ;i++)
          for(int j =  ;j < N ;j++)
             scanf("%lf",&grid[i][j]) ;
       scanf("%d",&AIN) ;
       for(int i =  ;i <= AIN ;i++)
          scanf("%d",&AI[i]) ;
       printf("%.6lf\n",bfs()) ;
   }
   return   ;
}