| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
Hello, today in CodeTON round #3, one of the most epic moments in cf history has happened. It's about tourist.
Did he finally cross 4000 rating? No.
Today, he got owned by his archenemy, python gigachad conqueror_of_tourist.
Congratulations to conqueror_of_tourist. Good job, king!
He's also the first python LGM! Congrats! What an inspiration for all the python users out there.
Yup, it's really a great motivation for python users like me.
How tf this guy become LGM using python
Maybe because he knows how to binary search in python.
Nah, he definitely knows how to unary search in python
But can he create segment tree in python?
Of course he can, I don't see any reason he won't be able to. FYI, iterative segment trees exist, so recursion shouldn't be a big issue.
recursion isn't an issue for segTree. python recursion depth is more than enough for segment trees
The depth is not an issue, but the painfully slow speed is.
I don't know how to code segment tree in python :(
But I can just copy it from here
ORZ
As the great Py-casso said once:
"Python wannabes imitate; great Python gigachads steal"
In am honored to be the setter of that round...
orz
conqueror_of_tourist gives me the confidence to not leave python
I left python and became specialist
zORZ
bro did what he said.... orz