csp-s 100 analog

T1:
  the character seen as points, words seen as a side, it is a directed graph and undirected graph two cases
  to consider all the words you want to use, namely: After all the edges
  so it becomes a question of Euler Road
 
T2 :
  consider a time out and it would eliminate a number of reverse number consisting of all of it back
  and each number only once to eliminate
  it back every time the minimum number of queries and subtract out the impact it caused to
 
T3:
  the cancer problem
  random trees I served really
  consider what is the nature of random trees: only about log layer
  then log what's the use? Pressure can be installed ( \ (^ {2} = n-log_2n \) )! ! !
  Case found that the ancestors will affect the calculation of the contribution
  we will subtree ancestors, the number of dots lit if not greater than or equal number of points is lit as the state, pressure mounted
  in consideration of the current point of time, direct according to calculate the contribution of ancestors case, there is not a legitimate state guarantee
  when backtracking, we are only half the legal interception return transfer up to