| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
The replay of the NSU Inter-University contest is going to start on December 3, 2016 at 1200 UTC and will run for 5 hours. The contest will take place on Toph.
The setters for this contest are: ridowan007, sn23581, TarifEzaz, nfssdq, Shafaet, faiyaz26, d1xlord, Zobayer Hasan and Abdullah Al Raqibul Islam.
Good luck and have fun!
Auto comment: topic has been updated by jAckAL_1586 (previous revision, new revision, compare).
Auto comment: topic has been updated by jAckAL_1586 (previous revision, new revision, compare).
The contest is over. Can we get an editorial or solutions of the problems please??
What is the logic of problem KEEP MOVING . Can you please explain ? My logic is : I am leveling the graph , using adjacent of X as a source node . If i got a odd level node and this node has no adjacent node Gobu wins , if for all possible there has no node such that odd level node and this node has no adjacent node i am printing gobu cant win .
My code: Code
Can anybody give me any hints on how to solve Problem C?
Try to use DSU on Tree.You can learn it here
Could you please explain in detail how you solved it with DSU on Tree? I have solved the easier version of it (Village Fair) with mapping and DSU on Tree. But I can't seem to do the same here.
Is there any tutorial for this contest , please?