Online Round will take place on CF ?

God Level Consistency Sir :)

Competitive programming is meant to be fun. The time spent digging into these issues could have been better used on your own problem-solving. Calling out people like this feels like a waste of effort.

time to leave cp now

I'm in

Ashwanth.K IT will be conducted on unstop ?

ALESTA sir orz

Team : 'gladiators' from NIT jaipur

Members : define_int_long_long, saini.laxman2002 and aayush_chhabra

Regionals : Qualified for Amrita

Preferences in problemset : Tress, DS based problems!

Dhanraj sir orz.. CM soon

Ram Ram sareyana .. aaj mai utha lgae 2 sawal ...

will there be no prizes for the offlne onsite round of pro trio??

it is indeed the optimal solution

Ya now i got it thanks it was a nice problem

but will the time limit not be O(n*k) in that case also

Good question

can anyone tell the logic for Typewriter Game ..

depends like if u have a very good rank than u can but mostly top team from one clg

okk thanks got it

mohit_jx64 On the coderills page for the protrio contest it says Please make sure you login and verify your team before the contest .. So how to do this step ???

thanks got it now sorting also a good option

G Problem is kind of impossible with python

not that much worth .

Good Luck buddy . I took a 2 months break from cp now back with all my force again.

i gave up man

Good luck . Lets see even i can reach cm in this year

Congrats you are source of inspiration for people like me

nice

Difficulty gap between c and d1 is huge

Both contests on the same day one after the other .. Schedule could have been better

your contributions reflect how much you practice

surely will try to learn it.

ohk thanks for the info

Problems not visible for upsolving

To improve my problem solving skills .

Just SomeQueries like what will be the level of the problems and are problems new or it is kind of a mashup

mine is saved

converting to stack version makes the problem tough for sure . like it makes +100 tougher

With dfs it gives runtime more so python 3 is best choice for dfs related stuff

As far as the logic is concerned and intended complexity it is fully fine it is just the time python takes

Ya ik it is very close to time limit but because of unconsistency may be due to load on site sometimes it is just below and sometimes it is just above the time limit

i also have the same doubt from where we can find team id

Thanks got it

even after taking this i cant solve

what was the proof for problem D ..

Team : 'gladiators' from MNIT JAIPUR

Members : define_int_long_long saini.laxman2002 aayush_chhabra

Regionals : Qualified for both, Locations : Bangalore, Mathura

Preferences in problemset : No game theory !!

All members have to fill the google form ? SkyWalkerPS

Colleges qualified for mathura and kanpur displayed on their official site

issues with 2nd problem in python

what will be the level of contest Ashwanth.K

Can anyone please give some hint regarding the MEX problem . thanks in advance

literally not at all tested for python every problem giving a runtime

bad gateway problem srijan_2002

Soltuion for d :

n,m=map(int,input().split())
parent=[i for i in range(n+1)]
def find(x):
    st=[]
    while parent[x]!=x:
        st.append(x)
        x=parent[x]
    while st:
        parent[st.pop()]=x
    return x
ans=0
for _ in range(m):
    e=[el for el in input().split()]
    l=int(e[0])
    r=int(e[2])
    pl=find(l)
    pr=find(r)
    if pl==pr:
        ans+=1
    else:
        parent[pl]=pr
s=set()
for i in range(1,n+1):
    find(i)
for el in parent[1:]:
    s.add(el)
print(ans,len(s)-ans)

a very nice problem set really liked the problem.bhawan distance

legend sir

thanks for this blog i think i needed this

According to me my E is working but my solution gets WA on test 5 can anyone please help me where i am lagging https://codeforces.me/contest/1788/submission/192944044

ya i liked the contest

i am not able to register

same with me first time i did a d problem in contest

you can also use your own template of sortedlist .. etc

it is not working .

although i failed miserably in this contest but problem was not tough in my opinions and overall I liked the problems very much

like lets say we have multiple maximums than to fits those maximum we need count of maximum extra space .

for example 1 2 7 7 than to fit these two 7s we need to use count of the maximum element

for _ in range(int(input())):
    n,m,k=map(int,input().split())
    arr=list(map(int,input().split()))
    if (max(arr)-1)*(k)+arr.count(max(arr))>n:
        print("NO")
    else:
        print("YES")

dont know what is going with the solution of b in editorial if anyone interested in a single line solution do check this out https://codeforces.me/contest/1774/submission/185703602

thanks a lot got it

ya i avoided the first position actually and moreover I got a wa actually but I checked for many a times but not able to found wa test case

mine submissions takes 15 submission which is in range

15 brother with is less than 2*(9) where 9 is the size of array

i did exact same apprroach but got WA on test 5 can u please help https://codeforces.me/contest/1762/submission/185370228

Can anyone tell whats wrong with my Submission in D https://codeforces.me/contest/1762/submission/185370228 it would be great help

WonderFull explanation dude

lol i also did a dp solution haha new learning for me

Dont know why people hating b imo b was very easy here is my submission link https://codeforces.me/contest/1771/submission/184805442

https://codeforces.me/contest/1771/submission/184805442

That sudden increase in problem difficulty after problem 3 and the lack of editorial makes it very irritating for the participant. So these days I avoid this contest

Ya contest was nice but somewhere in examples a bit of explanation was required. But overall a nice experience

Aaj toh puri bio wali feel aa gyi lol

Goal: stable around 1800

Current Rating: 1693

Number of solved Problems: 1556

ya happened to me also

The part i hate about newtons contest is the so steep increase in difficulties of problems rest the problems are nice

Count me in

https://codeforces.me/contest/1737/submission/175080288 same code gets ac when I used isqrt when sqrt used gives a wa on test 4 dont know why https://codeforces.me/contest/1737/submission/175044806

Ya pypy3 saves u from tle but sometimes even pypy3 will give u tle and python3 will give u ac like in a question involving dfs or string manipulation stuff ..

Any advice to become Cm

can anyone explain why we dont have to go beyond 256 for checking for a particular i... i am not able to get this by editorial

a very underrated explanation thanks dude i was struggling with this problem

actually i started cp in my second year(got late should have started in 1st sem ) and started enjoying it .. so ya nothing great in my story haha..just keep grinding

Congrats keep going btw i also have similar story like u

thanks a lot it helped me a lot

same

yes sir

true beethoven is the hacking pro i have been hacked by him many times

both have their pros and cons use whatever suits u..good luck

strings operations are always slow in py so try to submit string related question in python ...

div 2 c a nightmare

thank u so much

https://codeforces.me/contest/1684/submission/157771378 i have checked so many cases but still not able to find the mistake please can anyone help in finding the mistake in this or which case i am missing