Hi, Round #288 was Div. 1 and Div. 2 yesterday.

What happened ? Now I see it's a Div .2 Only contest !

Is this a mistake ? Or plan changed ?

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

1 | tourist | 3557 |

2 | Um_nik | 3494 |

3 | Radewoosh | 3344 |

4 | wxhtxdy | 3309 |

5 | LHiC | 3302 |

6 | Benq | 3286 |

7 | mnbvmar | 3274 |

8 | Petr | 3254 |

9 | yutaka1999 | 3190 |

10 | ksun48 | 3170 |

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

1 | Errichto | 191 |

2 | Radewoosh | 180 |

3 | PikMike | 165 |

3 | antontrygubO_o | 165 |

3 | Vovuh | 165 |

6 | rng_58 | 161 |

7 | majk | 156 |

7 | Um_nik | 156 |

9 | 300iq | 155 |

10 | farmersrice | 151 |

Hi, Round #288 was Div. 1 and Div. 2 yesterday.

What happened ? Now I see it's a Div .2 Only contest !

Is this a mistake ? Or plan changed ?

Hi, bro !

I was trying to solve problem 126C - E-reader Display !

In this problem n is at most 2000, and my algorithm was O(n*n*log n).

getting input with cin : 5857002

getting input with scanf : 5858216

But my code got TLE , and I can't find it reason.

If you know it, please tell me !

Hi !

I am trying to answer problem 155 at ACM.SGU.RU site .

My algortihm is sort by a[i] elements , then create a BST by k[i] elements.

I know my algorithm in worse case is O(n^2) and n can be 50000 ! So my answer get TLE .

What can I do for this problem ? Is my algorithm wrong or can be optimize ?

Hi :)

In recent Codeforces contests , we see many problem with "Geometry" tag ! so I decide to learn Geometry algorithms and formula !

What must I do ?

Hi :) We have two string with same size ! ( n = strings.size() )

I want an algorithm with O(n.lg n) , to find LCS of this strings .

What is best Order of this problem ? I can find it with O(n^2) by using dp !

sry 4 my bad English! :|

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/14/2019 12:27:11 (e1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|