Search for AnswerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 156 Accepted Submission(s): 57
Given a tournament, you need to determine the direction of the remaining sides to maximize the answer. The answer is calculated in the following way. The vertices are labeled from $0$ to $n-1$, and the matrix $s$ is used to represent the edges.
The first line of input is a single line of integer $T (2 \le T \le 10)$, the number of test cases. In each test case, there are $1$ integers $n(5 \le n \le 200)$, denoting the number of vertices. Then in the following $n$ lines, the $i$-th line has a string of length $n$. If $s[i][j]=1$, there is an edge from $i$ to $j$. If $s[i][j]=2$ means you need to determine the direction for that edge. The input is guaranteed to be legal, and the number of $(i, j) (i < j)$ satisfying $s[i][j]=s[j][i]=2$ is less than $200$. The data is randomly generated.
For each set of test samples, output one line to represent the maximized answer.
One solution to the first case is: