|| ||Code Submission Evaluation System
CSES Problem Set
Tree Isomorphism II
Task | Statistics
CSES - Tree Isomorphism IICSES - Tree Isomorphism II
|Time limit:||1.00 s
||Memory limit:||512 MB|
Given two (not rooted) trees, your task is to find out if they are isomorphic
, i.e., it is possible to draw them so that they look the same.
The first input line has an integer $t$: the number of tests. Then, there are $t$ tests described as follows:
The first line has an integer $n$: the number of nodes in both trees. The nodes are numbered $1,2,\dots,n$.
Then, there are $n-1$ lines describing the edges of the first tree, and finally $n-1$ lines describing the edges of the second tree.
For each test, print "YES", if the trees are isomorphic, and "NO" otherwise.
- $1 \le t \le 1000$
- $2 \le n \le 10^5$
- the sum of all values of $n$ is at most $10^5$