| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
|
0
1 2 2 1 3 2 1 2 Is this a valid test for G1? |
|
0
Thank you for replying. It would be really helpful if you can share your code. |
|
0
Did someone tried to solve B using binary search and maximum bipartite matching? I tried but got TLE (253131171). |
|
+5
In problem G solution is should be a[i] > 1. |
|
0
Can someone explain graph based solution for problem D? Thank You. |
|
0
Can someone hack my F. 220282299 |
|
0
Yes it is a valid strategy. I solved D using same approach. |
|
0
I lost 100 points for 2 unsuccessful hacks. I later realised in last few seconds that I should have used 1 1000000000 for 200000 times. It might have given me 150 points from my room. |
|
0
Yes but it runs in O(1e9) which should TLE? |
|
0
For Div2 B I tried hacking with this solution 215216845 with test case: 1 200000 1000000000 but judge gave me unsuccessful hacking verdict. Can anyone explain why the above mentioned solution won't TLE on this test case. Also the solution got FST on test 21 with TLE verdict. |
