EnDeRBeaT's blog

Historic moment
By EnDeRBeaT, history, 18 months ago, In English

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!

  • Vote: I like it
  • +265
  • Vote: I do not like it

Comments Comments (18)
| Write comment?
»
18 months ago, # |
  Vote: I like it +39 Vote: I do not like it

He's also the first python LGM! Congrats! What an inspiration for all the python users out there.

→ Reply
  • »
    »
    18 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Yup, it's really a great motivation for python users like me.

    → Reply
»
18 months ago, # |
  Vote: I like it +3 Vote: I do not like it

How tf this guy become LGM using python

→ Reply
  • »
    »
    18 months ago, # ^ |
      Vote: I like it +63 Vote: I do not like it

    Maybe because he knows how to binary search in python.

    → Reply
    • »
      »
      »
      18 months ago, # ^ |
        Vote: I like it +8 Vote: I do not like it

      Nah, he definitely knows how to unary search in python

      → Reply
    • »
      »
      »
      18 months ago, # ^ |
        Vote: I like it +14 Vote: I do not like it

      But can he create segment tree in python?

      → Reply
      • »
        »
        »
        »
        18 months ago, # ^ |
          Vote: I like it -33 Vote: I do not like it

        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.

        → Reply
        • »
          »
          »
          »
          »
          18 months ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          recursion isn't an issue for segTree. python recursion depth is more than enough for segment trees

          → Reply
          • »
            »
            »
            »
            »
            »
            18 months ago, # ^ |
            ← Rev. 2   Vote: I like it -19 Vote: I do not like it

            The depth is not an issue, but the painfully slow speed is.

            → Reply
        • »
          »
          »
          »
          »
          18 months ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          bro, if you didn't ruin every other joke on codeforces, you wouldn't have -100 contribution

          → Reply
      • »
        »
        »
        »
        18 months ago, # ^ |
          Vote: I like it +42 Vote: I do not like it

        I don't know how to code segment tree in python :(

        But I can just copy it from here

        → Reply
        • »
          »
          »
          »
          »
          18 months ago, # ^ |
          ← Rev. 2   Vote: I like it +14 Vote: I do not like it

          ORZ

          As the great Py-casso said once:
          "Python wannabes imitate; great Python gigachads steal"

          → Reply
»
18 months ago, # |
  Vote: I like it +39 Vote: I do not like it

In am honored to be the setter of that round...

→ Reply
»
18 months ago, # |
  Vote: I like it -6 Vote: I do not like it

orz

→ Reply
»
18 months ago, # |
  Vote: I like it +1 Vote: I do not like it

conqueror_of_tourist gives me the confidence to not leave python

→ Reply
»
18 months ago, # |
  Vote: I like it -6 Vote: I do not like it

zORZ

→ Reply
»
18 months ago, # |
  Vote: I like it +5 Vote: I do not like it

bro did what he said.... orz

→ Reply