Comments
On Ant_Man → XXI Open Cup (GP of Xiaomi), 6 years ago
0

The std is also $$$O(n\log^2 n)$$$. Enumerating on the transition graph is the intended solution. (We tried to make it faster for a long time but we failed.
+50

I hope you can win the world final.
+18

Auto comment: topic has been updated by Syloviaely (previous revision, new revision, compare).
0

Auto comment: topic has been updated by Syloviaely (previous revision, new revision, compare).
On MikeMirzayanov → New Year Gifts 2019!, 8 years ago
+26

I'm glad that I do not have to change my handle this year, too :)

(And I hope it will not be changed in the future.
On riadwaw → Opencup. GP of XiAn, 8 years ago
+13

I tried my best to find an easy but novel geometric task QwQ. I did not think about it is still an old problem. Sad :(
+13

The OpenCup contest has finished. Thank you for your participation~
+36

Today’s suspense: whether Red Fanta can AK this contest.

(And whether they can solve 4 more problems than the onsite champion again

The tasks are interesting, and I hope you will enjoy this contest :P
+30

Actually, I've considered changing my nickname to "KujouKaren" for thousands of times. But sadly, I found that this name had been used by KujouKaren. That's quite a pity for me.

(BTW, my nickname on atcoder is KujouKaren. Touyama Nao is the best in the world!

+35

Haha, that's a nice point. I'm glad that you like this tutorial. I've moved this blog to this account :).
+66

Thanks a lot :)
+466

Well, It's true that I have multiple accounts (jiry_2 = Syloviaely)

The first name of this account is "TakanashiRikka". At that time, I was a beginner and I believed it's interesting to play the role of my favorite anime character on CodeForces, just like she is living in our world, and also a good algorithm competitor. I felt a lot of fun in this process.

As time goes on, my rating became higher and higher, and when I had the chance to become one of Top10 players, I finally realized how unfair it would be if I still kept both of these two high-rating accounts. So I gave up jiry_2 immediately and I only use this account in contests from than on.

I want to apologize for my past behavior and its negative effect, and I can promise that I'm not DearMargaret. I don't want to be the "leader" of multiple accounts (although it's the truth), so I think I have a duty to take a stand, and I can accept the result that jiry_2 is banned :)
On 300iq → IOI 2018 predictions, 8 years ago
+139

I believe China will get four golden medals this year!
On ainta → Quality of the WF problems, 8 years ago
+46

Personally I do not like this year's World Final problemset, too.

As a supplement, the problem I is almost the same as an old problem in China, except the input format. When I saw this problem at the beginning of the contest, I was excited and wanted to try to get the first blood. But when I saw the input format, I turned to read other problems immediately :(
+164

EvenImage is the best! I love you!
+11

+6

In H, I think tree[i][j] can be calculated in O(n3) if you enumerate the size of subtree of the child which has the minimum index during the transition.

BTW, such a weak sample input makes me confused. I think it will be much better if you add a larger sample or give a more detailed explanation about the modification Ember could do (I think this process is a little bit complex and is somehow hard for me to understand well).
+10

Oh, that's my mistake.. thanks a lot
0

Why the third sample input of H is 36?

I think 1 2 3 and 3 2 1 just have a single way to modify. QwQ
On Lewin → Good Bye 2017, 9 years ago
0

So we go die together :)
On Lewin → Good Bye 2017, 9 years ago
+131

CF new winner EvenImage !!!
On adedalic → Codeforces Round #421, 9 years ago
-16

RUA!
On adedalic → Codeforces Round #421, 9 years ago
0

Well, due to the unrated, maybe I have lost more than 100 rating.

But...

Where is my Akagi?

(ノ=Д=)ノ┻━┻
On adedalic → Codeforces Round #421, 9 years ago
+48

Make a wish for Akagi with 200 rating.
On robinyu → Codeforces Round #419, 9 years ago
+106

Actually, the user KujouKaren in atcoder is me...

I've tried to register the username KujouKaren in CF but I found that this ID has been used KujouKaren.
On robinyu → Codeforces Round #419, 9 years ago
+109

Karen is so cute DA☆ZE~

⁄(⁄ ⁄•⁄ω⁄•⁄ ⁄)⁄
+15

⁄(⁄ ⁄•⁄ω⁄•⁄ ⁄)⁄
On Barichek → Codeforces Round #407, 9 years ago
+30

I have an interesting solution for div1 D and maybe it need only O(n) queries.

First we choose a number number G less than , probably (M is the coordinate range and n is the number of lines). And we can random several times to find a point a = (x, y) such that .

Then, for vertical lines, we query all the point (x + kG, y) which is in the coordinate range. And we can find several lines. But if there are many lines which are very close, we may only find out some of them.

So, the next step, we need to find out the remaining lines. If the dis between two adjacent lines is larger than 2G, then there are no lines between them. Otherwise, we can search between these two lines. Each time we query the midpoint of the search range, if we get a new line, then we try to search both sides and otherwise, exit.

We can find out the horizontal lines analogously.

This is my code 25939395.

During the contest, I made some stupid mistakes and failed to pass it. Sad story.
+15

Hi!