zoj 3502 Contest //dp

Contest

---

Time Limit: 2 Seconds       Memory Limit: 65536 KB

---

Lazyman is going to join the programming contest! There are n problems in the contest. Because Lazyman is so lazy, he just tried each problem once and only once. However each problem in the contest may be not independent, it may have some relationship with other problems. So here is a propbility P n*n matrix. The jth element of the ith row is denoted by P_ij. Suppose he have tried m problems, a₁,a₂,...a_m (No matter the problems are solved or not.) (1 ≤ a₁,a₂,...a_m ≤ n) If he tries the rth problems next, (r!=a₁,a₂,...a_m) the propbility that he can solve it is the maximum value of the m + 1 values, P_rr, P_a1r%, P_a2r%, ... P_amr%.

Help him to decide the order he tries the problems to make the expected number of the solved problems maximum.

Input

There are multiple test cases. The first line of input is an integer T (0 < T ≤ 100), indicating the number of test cases. Then T test cases follow. The first line of each test case is a positive integer n (0 < n ≤ 10). Then comes n lines. The jth element of the ith line is an integer P_ij. (0 ≤ P_ij ≤100 1 ≤ i,j ≤ n)

Output

For each test case, output 2 lines. The first line is the maxmum expected number of problems, accurated to the nearest 0.01. The second the order he should try each problems to achieve this expected number of problems. If there are several sequeces achieve the same maximum expected number, choose the lexicographically smallest one. Use capital letters to denote each problems please. (Start from A)

Sample Input

2
1
0
2
2 3
5 7

Sample Output

0.00
A
0.12
BA

Hint

For the 2nd sample, if the order is AB:
The probility of the result that he solves problem A is 0.02*(1-0.07)=0.0186
The probility of the result that he solves problem B is (1-0.02)*0.07=0.0686
The probility of the result that he solves problem A and B is 0.02*0.07=0.0014
So the expected number of the problem sovled is  1*0.0186+1*0.0686+2*0.0014=0.09

For the 2nd sample, if the order is BA:
The probility of the result that he solves problem A is (1-0.07)*0.05=0.0465
The probility of the result that he solves problem B is 0.07*(1-0.05)=0.0665
The probility of the result that he solves problem A and B is 0.07*0.05=0.0035
So the expected number of the problem sovled is  1*0.0465+1*0.0665+2*0.0035=0.12

---

Author:  CAO, Peng

 

/* dp实在不行。 这个题目还是看着标程写了，该好好练练DP了 */ #include<cstdio> #include<string> #include<algorithm> using namespace std; const int MAXN=12; const double eps=1e-8; string pre[1<<MAXN]; double dp[1<<MAXN]; double p[MAXN][MAXN]; int main() { int T; scanf("%d",&T); while(T--) { int n; double q; scanf("%d",&n); for(int i=0;i<n;i++) for(int j=0;j<n;j++) scanf("%lf",&p[i][j]); pre[0]=""; dp[0]=0; int tem=1<<n; for(int k=1;k<tem;k++) { dp[k]=-1; for(int i=0;i<n;i++) { if(k&(1<<i))//k包含这位 { q=0; for(int j=0;j<n;j++) { if(k&(1<<j))//这几位已经取到的，可以进行更新 { q=max(q,p[j][i]); } } q=dp[k^(1<<i)]+q/100; if((q>dp[k]+eps)||(q>dp[k]-eps && pre[k^(1<<i)]<pre[k])) { dp[k]=q; pre[k]=pre[k^(1<<i)]; pre[k]+=('A'+i); } } } } printf("%0.2lf/n%s/n",dp[(1<<n)-1],pre[(1<<n)-1].c_str()); } return 0; }