Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

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

1 | tourist | 3539 |

2 | Radewoosh | 3464 |

3 | V--o_o--V | 3338 |

4 | Um_nik | 3307 |

5 | Petr | 3297 |

6 | ecnerwala | 3282 |

7 | LHiC | 3266 |

8 | wxhtxdy | 3264 |

9 | Vn_nV | 3182 |

10 | xyz111 | 3147 |

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

1 | Radewoosh | 207 |

2 | Errichto | 176 |

3 | neal | 159 |

4 | Ashishgup | 158 |

5 | PikMike | 157 |

6 | Petr | 156 |

6 | majk | 156 |

8 | rng_58 | 155 |

9 | Um_nik | 154 |

9 | 300iq | 154 |

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial of Technocup 2017 - Elimination Round 2

↑

↓

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/19/2019 10:24:44 (d1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

"Will be translated soon": Waiting for translation...

should be inside the maximum function.

Similarly, for zhenya.

Sure, fixed. Thanks!

Any idea why my submission for 729C http://codeforces.com/contest/737/submission/22410492 is exceeding time limit (on test #9). Please help to check.

Have you tried fast I/O?

yup, that's indeed the problem. Keep forgetting about that :( Thanks )

Can someone please suggest some reading materials for learning graph matching? =)

Can someone give a good explanation for the problem Div2 D?

For problem C, I do not understand the following statement:

if x ≤ f, then it is possible to ride in the fast mode min(x, f - x) kilometers.

How did you obtain the expression min(x,f-x) kilometers?

Let the number of km in fast mode be k. Then the number of km in slow mode in x — k. So, we have the equation: Fuel used = 2*k + (x — k) <= f -> k + x <= f. Therefore, k <= f — x. Also, k <= x because we stop when we reach the next station. Therefore, k = min(x, f-x).

For problem E, why is 3 the answer for the following test case:

9 1 0 1 1 1 1 1 6 7 8

Clearly, workers at index 2 to 5 are wrong because they should have 2,3,4 and 5 superiors respectively. I must be misunderstanding something. Could anyone please help to clarify?

I had some trouble understanding Div2 D solution, so I'll explain it in more details.

The solution is actually an application of the pigeonhole principle.

Let

sbe the maximum number of positions where you can place a ship (of course, already considering thosekmisses of the input). The trick: reduce the problem to its complement! In other words: what is the maximum number of misses we can still make? The answer:m=s-a. If we shootmship slots once, an additional shot will hit some slot a second time (by the pigeonhole principle), or will hit a ship. So if we choosem+ 1 distinct ship slots to be shot once, at least one of the shots will hit a ship.In Financiers Game, shouldn't the "difference between the sum" mean the absolute value of the differences?