Блог пользователя YuukaKazami

Автор YuukaKazami, 10 лет назад, По-английски

I am going to quit from Algorithm contests since I want to be a moe~moe~ theoretical computer scientist <_< . In memory of my algorithm competition days, I plan to collect those problems(remove some routine trivial problems) written by me and translate those Chinese ones into English, it might be interesting for all of you to solve :)

It might take some days to finish, I will first list some English problems :)

From Multi-University Training Contest 2013 and 2014

  1. Life Game
  2. Crime
  3. Endless Spin (one of my favorite)
  4. JZPTREE
  5. Jinloid
  6. The only survival
  7. Hero’s assistant
  8. Hero meet devil
  9. NO ACM NO LIFE

A very old problem on SPOJ:

JZPGYZ

From 2014 ACM/ICPC Asia Regional Anshan Online and Onsite:

  1. Biconnected
  2. Square

Codeforces:

  1. Contest 146
  2. CF#172 C

Codechef:

  1. Union on Tree
  2. String Query
  • Проголосовать: нравится
  • +274
  • Проголосовать: не нравится

»
10 лет назад, # |
Rev. 2   Проголосовать: нравится +53 Проголосовать: не нравится

> algorithm competitor
> theoretical computer scientist

Why not both?

Btw your last visit is 97 minutes ago now, while this blog post is said to have been posted 59 minutes ago. How do you do it, are you a wizard? :D

  • »
    »
    10 лет назад, # ^ |
      Проголосовать: нравится +52 Проголосовать: не нравится

    You know, life is too short to learn math.

    • »
      »
      »
      10 лет назад, # ^ |
        Проголосовать: нравится +1 Проголосовать: не нравится

      Considering an individual, life HAD been also short for calculus, mechanics, optics, philosophy, theology and economics.

  • »
    »
    10 лет назад, # ^ |
      Проголосовать: нравится +31 Проголосовать: не нравится

    your last visit is 97 minutes ago now, while this blog post is said to have been posted 59 minutes ago

    This timer shows some random time:) Sometimes you just refresh page and last visit there changes:) Sometimes it shows time from start of the session, not from the end. Sometimes it shows 1 hour ago, then online 10 minutes later, then 8 hours ago 30 minutes later:)

    YuukaKazami, you will not participate in competitions at all? Or you just want to say that you will stop creating problems and doing regular trainings — but still visit some contests when you have time for it?

»
10 лет назад, # |
  Проголосовать: нравится +2 Проголосовать: не нравится

It will be good that you can also share your training camp material or your notes if present in English.

»
10 лет назад, # |
  Проголосовать: нравится +19 Проголосовать: не нравится

Won't you participate in any qualification round for some onsite event ?

Some contestants who retired from regular rounds (like Codeforces or SRM) still participate in qualification rounds and sometimes advance to the onsite.

»
10 лет назад, # |
  Проголосовать: нравится +19 Проголосовать: не нравится

Does that mean you are not going to participate in ACM ICPC this season?

»
10 лет назад, # |
  Проголосовать: нравится +117 Проголосовать: не нравится

"I am going to quit from Algorithm contests since I want to be a moe~moe~ theoretical computer scientist <<"_

My expected position in every contest has become 0.99999 better since this very moment.

  • »
    »
    10 лет назад, # ^ |
      Проголосовать: нравится +64 Проголосовать: не нравится

    BTW, your chance to win a competition against YuukaKazami is as high as ~2.3%, if we'll calculate this probability using CF rating formulas and your current ratings:)

    Therefore i have a bad news for you, your expected position become only 0.977 better...

    • »
      »
      »
      10 лет назад, # ^ |
        Проголосовать: нравится 0 Проголосовать: не нравится

      Let me clarify that this would be true, only if YuukaKazami would participate in every contest. On CF he took part only in ~60 rounds, so his activity is ~2%. I would say Roman's expected place decreased by 0.977·0.02 = 0.01954. Such an improvement :-)

      • »
        »
        »
        »
        10 лет назад, # ^ |
          Проголосовать: нравится 0 Проголосовать: не нравится

        2% out of what?.. Total number of contests at CF is less than 500 — even with div2 only and div1/div2 contests as separate events.

        And now with your updated calculations Roman should be even more upset:( In the morning he used to think that he made such a big improvement today.

»
10 лет назад, # |
  Проголосовать: нравится +16 Проголосовать: не нравится

But I don't know why you say it. I don't think there is a contradiction between becoming a theoretical computer scientist and taking part in Algorithm contests. Maybe I'm very foolish.

»
10 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

It looks like you are feeling bad after your performance in TCO finals :( If that is the case, then I think you should reconsider your decision. After all does it really require one to leave competitive programming to become a good researcher in computer science (or learning CS in general)? We have quite a few examples of successful researchers and competitive programmers on codeforces/ topcoder. So I would ask you to re-think about the rationale of your decision.

  • »
    »
    10 лет назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    Come on. Don't you think that one can find it boring to compete after years of intense trainings and competitions. I also believe that it's not like classic sport and having a long break may be useful.

  • »
    »
    10 лет назад, # ^ |
      Проголосовать: нравится +118 Проголосовать: не нравится

    Well, he tried to retire so many times, for example:

    1. He can't make it to IOI2012 and decide to retire. But you know he is the winner of IOI2013.

    2. After this year's world final, his team did not performance well and he decide to retire. But some days after that he said "I will beat tourist in Google Code Jam!". (But unfortunately he can't come to US for GCJ because visa issue.)

    3. This time he can't beat tourist during Topcoder Open, so he decide to retire again.

    So I guess he will not stop attempting to beat tourist.

»
10 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Endless spin is a really nice problem, thanks. Is it intended to get 15 correct digits using big rationals?

  • »
    »
    10 лет назад, # ^ |
    Rev. 3   Проголосовать: нравится 0 Проголосовать: не нравится

    Yes, or some arbitrary precision floating numbers.

    The text "不建议使用long double" in Hints section of the problem translated to "It is NOT recommended to use long double", and according to what YuukaKazami wrote in the editorial of this problem, it means "BigDecimal wins".

  • »
    »
    10 лет назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    I don't understand that picture in statement — what does it depict? Does probability of choosing interval [l, r] equals to for all integer values satisfying 1 ≤ l ≤ r ≤ n?

»
10 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

thanks YuukaKazami:) && best wishes

»
10 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

What's the next plan of you without ACM, or what's the future of ACMer as you think? I am confused.

»
10 лет назад, # |
Rev. 2   Проголосовать: нравится +21 Проголосовать: не нравится

How about preparing a good bye round ???

»
10 лет назад, # |
  Проголосовать: нравится +4 Проголосовать: не нравится

YEAH BABY))))

»
10 лет назад, # |
  Проголосовать: нравится +59 Проголосовать: не нравится

Welcome back.

»
10 лет назад, # |
  Проголосовать: нравится +4 Проголосовать: не нравится

Welcome back!

»
8 лет назад, # |
  Проголосовать: нравится +28 Проголосовать: не нравится

Welcome back!

»
8 лет назад, # |
  Проголосовать: нравится +5 Проголосовать: не нравится

'wen day is dark alway rember happy day'