### fcspartakm's blog

By fcspartakm, history, 6 years ago, translation,

• +28

 » 6 years ago, # |   +5 First of all, I didn't even come to know when this editorial came.In D, there was the constraint "Each person needs S or M, M or L, L or XL" and so on.I was wondering how to solve D if this constraint is removed. I was trying to maintain what all people are left with just a SINGLE choice, so I have no option but to give them the t-shirt of their choice, and on doing so, find new people that are left with single choice.Ofcourse, this can stop mid-way, and we would be left with people having exactly two choices. But I couldn't analyse how to proceed ahead. My failed attempt
•  » » 6 years ago, # ^ | ← Rev. 2 →   0 You can just build a network and run max flow on it and it will pass since the graph is special.
•  » » » 6 years ago, # ^ |   0 That's cool. Then I guess this problem from last contest is also basically the same but with cost assigned to each edge.(MinCostMaxFLow) I am new to the concept of max flow, but let me know whether I am thinking correct or not. Also can you share some AC codes on CF/CC where you used MaxFlow and MinCostMaxFlow because I am not able to find a good template for them.
•  » » » » 6 years ago, # ^ |   +3 Try this.My solution 17710740.
•  » » » » » 6 years ago, # ^ |   0 Your implementation is not the fastest right? So instead of adjacency matrix, i should implement it with vectors and that would be the best code in terms of time complexity?
•  » » » 5 years ago, # ^ |   0 Can you please explain what do u mean by the graph is special and how will it pass using max flow algorithms?
 » 2 years ago, # |   0 How to solve Problem E using rolling Hash for strings.
•  » » 22 months ago, # ^ |   0