**Update: editorial for G is out**

# | User | Rating |
---|---|---|

1 | tourist | 3532 |

2 | Radewoosh | 3434 |

3 | wxhtxdy | 3425 |

4 | Benq | 3368 |

5 | ecnerwala | 3301 |

6 | mnbvmar | 3280 |

7 | LHiC | 3276 |

8 | maroonrk | 3199 |

9 | yutaka1999 | 3190 |

10 | TLE | 3145 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 192 |

2 | Radewoosh | 178 |

3 | tourist | 173 |

4 | antontrygubO_o | 167 |

4 | Vovuh | 167 |

4 | PikMike | 167 |

7 | rng_58 | 159 |

8 | majk | 157 |

9 | Um_nik | 152 |

9 | farmersrice | 152 |

**Update: editorial for G is out**

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial of Codeforces Round #586 (Div. 1 + Div. 2)

Tutorial of Codeforces Round #586 (Div. 1 + Div. 2)

In this blog I will tell you about recently invented powerful optimization technique, which can be applied to almost any problem and lets you solve it easily. Further I assume that you're already familiar with finding maximum flow in networks. If not, there're many tutorials avaible on Internet. For example, you can read this fabulous article on Topcoder.

It's based on Goldberg-Rao algorithm for finding maximum flow. Its time complexity is , where *U* is maximum capacity in network.

Consider any network with *m* edges and *n* vertices. Any reasonable programmer would merge parallel edges to one edge, summing their capacities, because it obviously reduces running time of algorithm. However, to reduce running time even more, **we will not delete parallel edges**. Even more, **we will add more of them**! Let's add parallel edges from sink to source. Obviously, added edges don't affect max flow. But how many edges we need to add? Just enough for *m* to become more than *n*^{2}, and the more the better! Now let's look back at time complexity of Goldberg-Rao algorithm. It involves factor, and since we ensured that *m* > *n*^{2}, using basic school maths we can prove that this factor is negative. And because all other factors are positive, overall time complexity is negative, which means **finding max flow in our network runs in negative time**!

Let's introduce a subroutine called *timelapse*, which will every time we call it find max flow in arbitrary network satisfying condition *m* > *n*^{2} using Goldber-Rao algorithm. Since its time complexity is negative, we can win some time once we need it just by calling it!

Now there're some applications of this optimization.

**1. Squeezing submissions in time limit.**

This one is pretty straight forward. Once running time of your submission is quite close to time limit, you just call *timelapse*, which gives you some time to finish execution and print calculated answer.

**2. Early submit tactic**

This one is a bit more tricky. Let's notice that nothing restricts us from having negative running time of the whole submission. So, let's call *timelapse* a lot of times at the beginning of your code. If you rewind time to the start of the contest, your submission will be accepted at 00:00, which means you can submit all problems you can solve at the first minute of contest and **get zero time penalty**! Just imagine how unbeateable you will be. However, you have to be careful to not to rewind time too much back. Otherwise your submission will get stuck at 80's when computers were so slow that other part of your code would run for a few years.

Thank you for reading my tutorial. Feel free to discuss this technique in comments and share your ideas and applications of it!

Tutorial is loading...

Tutorial is loading...

Simple implementation of solution described higher: http://ideone.com/IoSts1

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Chance that comes once in a lifetime! Take screenshots, while your rating is more that tourist's!

MikeMirzayanov, fix it, please

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/22/2019 04:22:43 (e2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|