zeyad_khattab's blog

By zeyad_khattab, history, 10 months ago, In English,

Can someone help me solve this problem ? 101755D - Трансферное окно My approach was to build a graph with the players as the nodes and there is an edge between player a and player b if I can exchange a with b then I created 2 nodes; Source and Sink. Then I added edges from from the Source to players I have and edges from players I want to the Sink, and applied max flow on this graph. All edges have capacity one. But then, I cannot construct the solution. My code (which gets WA at test 8) https://ideone.com/U4EjyO

 
 
 
 
  • Vote: I like it
  • +4
  • Vote: I do not like it