| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
Do I just have to switch over from java? Full code: https://pastebin.com/5HDQ6kRa
The logic should be correct but it's TLEing for some cases, and I'm pretty sure I have the optimal logic, but it's either cuz Java is slow or something w/ the implementation of the code
I'm lazy to look at the code, even java, but you should solve this problem with graph coloring, it's classical. You should use 2 color and color this graph so that no adjacent vertices have the same color. Some time ago I got accepted in this problem with graph coloring.
yeah that's my logic too but it's TLEing randomly cuz its like borderline 1s for each case
https://imgur.com/yjFP8W3 https://imgur.com/ezWXkYC
prefer to use the iterative approach for cses problems. AC code in java https://ideone.com/K32kmB
i also BFSed it but it TLEd as well, perhaps implementation is bad https://pastebin.com/dcVmMdeY
wait wth. i tried to implements parts of your code and your scanner was the determining factor, wth? bro ur scanner is insane, so Integer.parseInt() is slower than your just normal parser?
yes, this template is fast enough to be used in cses.
Auto comment: topic has been updated by bobbilyking (previous revision, new revision, compare).