I recently came to know about Small to Large trick from a blog.

It is useful technique and helps to improve O(N^2 * log(N)) to O(N*log^2(N))

Can someone please share links to few problems based on the same trick.

Thanks in advance !

Codeforces may be unavailable between Sept. 29, 18:00 (UTC) to Sept. 29, 20:00 (UTC) due to a maintainence.
×

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

1 | tourist | 3751 |

2 | Benq | 3727 |

3 | cnnfls_csy | 3691 |

4 | Radewoosh | 3651 |

5 | jiangly | 3632 |

6 | orzdevinwang | 3559 |

7 | -0.5 | 3545 |

8 | inaFSTream | 3478 |

9 | fantasy | 3468 |

10 | Rebelz | 3415 |

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

1 | adamant | 178 |

2 | awoo | 167 |

3 | BledDest | 165 |

4 | Um_nik | 164 |

5 | maroonrk | 163 |

6 | SecondThread | 160 |

7 | nor | 158 |

8 | -is-this-fft- | 154 |

9 | kostka | 146 |

10 | TheScrasse | 144 |

I recently came to know about Small to Large trick from a blog.

It is useful technique and helps to improve O(N^2 * log(N)) to O(N*log^2(N))

Can someone please share links to few problems based on the same trick.

Thanks in advance !

Hi, I was trying to solve the question 161D - Distance in Tree but I'm getting WA on test 11 and can't figure out what's wrong. And the editorial is a bit confusing to me.

Here is my submission : 85076026 Can anyone suggest what might've gone wrong. Thanks in advance !

I came across this song while doing CP. It might've unintentionally mentioned the meet in the middle algorithm quite a few times which makes it fun to listen to. Do listen to it.

I hope everyone is fine and practicing social distancing.

I am trying to solve 1284D - New Year and Conference I used a randomized approach involving hashes. I assigned random numbers to each lecture and then calculated for each lecture the xor of numbers assigned to lectures it intersects with. Now I checked that every lecture has **same** hashes in first location (a) and second location (b)

Take a look at my submission : 68617652 I am getting WA on test 6.

Any advice would be greatly appreciated.

Thanks in advance :)

I came across this problem : 1242B - 0-1 MST It requires us to find components of the complement of the graph. The editorial asks us to use DSU (Disjoint set union) to find the components but I'm not able to understand how to proceed after initializing the DSU.

Any suggestion / comment is greatly appreciated.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/29/2023 20:47:57 (k1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|