| # | 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 |
|
0
was it correct initially and later system testing gave WA? |
|
0
can you try using keys of one of the maps(cs for example) to iterate over as r? also try breaking when r becomes bigger than k / 2. Basically i want you to avoid unordered_set usage to see if TLE will become accepted. |
|
0
I think you are copying the vector x for each indice. That could be why. |
|
0
2104C - Card Game Another late comment for problem C. The following code pretty much handles the win for Alice, if she can't win, Bob will. boolean expression Last (card n is with Alice) and first (card 1 is with Alice) booleans are self explanatory, bobCantCounterFirstCard is false if Bob has at least one card from 2 to n — 1. beforeLastCard is true if Alice has the n — 1'th card. There are two main situations. If Alice has the last card (1): she has to have either first card (only counter of last card) or beforeLastCard (this can be used until the first card is grabbed by Alice). If she does not have the last card (2), she has to have the first card (in order to grab the last card) and she shouldn't have any weakness before playing the first card (bobCantCounterFirstCard). |
|
+3
This is the smallest it can get, the bottle is on the horizon!!! |
