demoralizer finally did it.

I WAS THE FIRST PERSON WHO REQUESTED IT !

https://mirror.codeforces.com/blog/entry/83164?#comment-704678

When are you going to make Roadmaps to FAANG

i am young at heart ;)

There are over 300,000 handles, i am adding them based on rating from top to bottom, your handle will also be added soon. Currently, all IGM,LGM,GM,M(almost) have been added.

The density of users is more towards the bottom, so its taking time, but it will all be added soon

yes lol

Use SublimeText....SublimeText is the best

your cat got a better rating on cf lmao

What's full form of UWCOI ?

User : Jerry

Round: #372

C

this is my alt i use it to shitpost :P

Div 2 D was pretty easy ! just hope that it has strong pretest.

why do you even care? is this some kind of commenting algorithm you guys have?

if shit_gets_real==True :
    comment("Post this blog from your original account.")

I agree, but educational or div 3 rounds can be atleast more frequent

did u break after the manhattan distance exceeded 1000?

Its DP with some optimization.

sort every celeb by time...then start from right.

let dp[i] denote the no of celeb u can pick if u start from this celeb.

so now for any $$$i$$$, iterate over all $$$j$$$ in $$$i$$$+$$$1$$$ to $$$n$$$ and for those celeb if the manhattan distance of $$$i$$$ and $$$j$$$ celeb is less than the time difference then take maximum dp[j] over it.

so for $$$i^{th}$$$ celeb answer is dp[i] = 1 + max(dp[j]) for all valid $$$j$$$

the optimization here is that the grid is small, so if for any $$$j$$$ the manhataan distance exceed 1000 then condition will be always valid...so use maximum suffix and break the loop

Bro, you are an absolute legend! Hoping to see you red soon!

Really hope that they would make videos on this as well

I have watched this, but it's theoretical again. I have the understanding, I just need the implementation part

Do we get a ranklist?

No it worked ! did you try it?

Yes... actually iterate i till B, then if you set j at position i, then calculate the change by subtracting no of numbers equal to j at index i

here i is effectively i%B

2nd was easy, count nodes with depth < B, say cnt... answer is $$$2^{cnt}$$$ % mod

5 was dp

dp[i][1024]

我在胡说八道

Yup, what language u coded into,

Also i did lots of precomputation, and used arrays instead of maps

This is from google hiring challenge

And i got this problem, your solution is correct ( partially)

Basically for each node keep a list of values co prime to it

Then use this vector<pair<int,int>> stc[], when u visit a node (say src) at level (say level) with value (say v[i]) , insert it like this

stc[v[i]].push_back(make_pair(src,level))

Now just iterate over all x in in numbers co prime to $$$val[i]$$$ and check the last element in $$$stc[x]$$$ pick the one with closest level. And you're done

And don't forget to pop stuff out when backtracking

Where problem statement is not written like some essay

Try this !

1
7
5 5 9 9 10 10 5

Open the problem in an Incognito window, its fast and gets the job done

Good luck for next contest then :)

I don't know if my solution was intended to work or not, but i simply bruteforced $$$A_i$$$ and $$$A_j$$$, with $$$A_i$$$ as one of the maximum or second maximum number, and $$$A_j$$$ as elements of array. It got accepted surprisingly lol

You should participate in Div 1 then, you won't find A and B

I think it's your response to problems you can't solve, like what do you do when you are unable to solve a problem ? Do you read editorials straight away?

Contest is still running

Thanks ! My submission tool works now, i just need to pass the RCPC as a cookie while making the request

Here is the python sample

import requests
cookies = {
    'RCPC': '606806bf70edce2cb8427ea1f7d71ece',
}
response = requests.get('https://mirror.codeforces.com/', cookies=cookies)

Is this fix permanent btw?

Do you even realize that this is an alt/troll handle

Why are submissions low on problems? Were they hard, imo first 3 were pretty easy?

Hope to become LGM this contest!

What other purpose is there for Competitive Programming?

For many people, it's their passion !

Do basically in D, we could kill monsters in any order?

I used policy based data structure so my solution got accepted at last