P7607 - I do not know Graph Theory!

内存限制：128 MB 时间限制：14 S 标准输入输出

题目类型：传统评测方式：文本比较上传者：

提交：0 通过：0

A tournament graph is a directed graph where there is exactly one edge between every two distinct vertices.

A strongly connected graph is a directed graph where there is a path between every two distinct vertices.

You are given a tournament graph. For each edge of the graph, find out whether the graph is strongly connected when that edge is reversed.

The first line contains one integer

T (

1≤T≤40000), the number of test cases.
For each test case, the first line contains one integer

n (

2≤n≤5000), the number of vertices.
The next

n−1 lines give out the compressed lower triangular matrix in the following way:
Each line contains an uppercase hexadecimal string, where the

j-th hexadecimal of the

i-th string

Si,j=∑3k=02k×Ei+1,4j+k−3, and

Ei,j=1 iff the direction of the edge between

i,j is from

i to

j. All indices start from

1.
It is guaranteed that there are at most

3 test cases in which the

n is larger than

10.

For each test case, output

n−1 lines in the same format of the input:

Si,j=∑3k=02k×ansi+1,4j+k−3, and

ansi,j=1 iff the graph is strongly connected when the edge between

i,j is reversed.

7607: I do not know Graph Theory!

题目描述

输入格式

输出格式

输入样例复制

输出样例复制