Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
# | User | Rating |
---|---|---|
1 | Radewoosh | 3611 |
2 | jiangly | 3597 |
3 | Benq | 3593 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3570 |
6 | cnnfls_csy | 3569 |
7 | tourist | 3565 |
8 | maroonrk | 3487 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
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
You can just build a network and run max flow on it and it will pass since the graph is special.
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.
Try this.My solution 17710740.
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?
Can you please explain what do u mean by the graph is special and how will it pass using max flow algorithms?
How to solve Problem E using rolling Hash for strings.
Link