Комментарии
На vovuh → Codeforces Round #661 (Div. 3) Editorial, 6 лет назад
0
  • For Problem E1
  • testcase
  • 1
  • 10 23
  • 8 7 5
  • 2 1 9
  • 10 5 6
  • 6 5 9
  • 5 3 5
  • 3 2 2
  • 4 3 8
  • 7 6 2
  • 9 8 7

  • How does this can be done in just 12 steps,

  • My solution divided following edges:
  • total edge Value of particular edge(Column 1)
  • no. of Leaves of going through that edge(COLUMN 2)
  • Total Sum of paths(COLUMN 3)
  • Number of steps(COLUMN 4)
  • 80
  • 27 3 65 -1
  • 12 3 59 -2
  • 10 2 53 -3
  • 9 1 48 -4
  • 8 1 44 -5
  • 7 1 40 -6
  • 6 3 37 -7
  • 6 3 34 -8
  • 6 1 31 -9-
  • 5 1 28 -10
  • 4 2 26 -11
  • 4 1 24 -12
  • 4 1 22 -13
  • Total steps= 13 given answer=12