T1:
Simple dp
T2:
Consider abcd, enumeration bc this side, \ (ANS = \ SUM (deg_b-1) * (deg_c-1) \)
found miscalculated, because even guarantee \ (a = d \!)
Consider when \ (a == d \) when, a (d) -bc form a three-membered ring, considered less points, with quick statistics bitset
complexity \ (O (n ^ 3/ 32) \)
T3:
Title means all point to a subset of their edges even
consider building a \ (2 ^ 20 \) imaginary points, all points to their own weight and the same virtual point even reverse two sides
and then on the imaginary point only a few points between each of the binary point to even the edges, found space explosion.
Then directly transferred between the virtual point, nonunion edge
T4:
Consider the same order each row, actually enumerations, like pressure on the end
T5:
Consider this is a game set game problem
for the inner layer of the game, you can build a tire tree dp
game for the outer layer, to consider how to get the final victory:
1. upper hand control of their victory or defeat, the upper hand to win
2 . control his upper hand can win the victory odd wheel
3. the other case FLAC win
it is necessary to deal with two cases win losing inner layer DP (can be pressed together dp)