| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 130 |
|
On
SleeepyHead →
Code Cauldron 3.0 Inter College Coding Competition (Prizes worth 15K INR), 18 months ago
0
Edit: Money Credited |
|
+3
https://codeforces.me/contest/1926/submission/247492595 You need to use faster flow network |
|
+1
It is possible to see TC 2 for F question |
|
+1
They considered that, if an edge directed upwards(towards root) then the subtree below that edge as unreachable. |
|
0
|
|
0
apart from (time / space complexity) yours recurrence solution was correct, but generally recursive solution was slower than dp. |
|
0
See the constraint on a, b (1e9). It seems yours code taking O(ab) time and memory |
|
+7
Multi source bfs gives nearest red vextex not farthest |
|
+13
Mint is basically a custom data structure unlike int, long long it has some extra features Once you declare a variable in mint, you can forget about mod operations and can use in a normal way. modular Uncomment required mod. and can declare as modular var; |
|
+12
K can be solved by kinetic tournament, https://codeforces.me/contest/1866/submission/221756159 |
|
0
we can use cartesian tree to get range in O(N) My solution: https://codeforces.me/contest/1359/submission/208068147 |
