same, I thought it was wifi problem so I had a thought getting changed my wifi provider

how to do d using dp?

how to do d using dp ?

you werent lazy , i just copied dsu , and did some changes in code :D

thanks , i need to study lca :|

any one go idea how to do it usign bfs in undirected graph?

can i get discord sever link :)

i was having same logic ,but dont know how to implement , really nice implementation.

how it will be working for this then : aabb ,if it count for prev only

i know im wrong , but i dont know how

i think because of your upper bound , array must me sorted .

division is done because the same pair will be counted twice and not sure but the condition checks that if we should not count the same index value as we should have two value from different index

deleted

thanks man

the round was amazing, can anyone help me identify the error in 114652844 to problem c, my approach is similar to the edi.

can any one tell what's wrong in my solution to c1 , my idea : to generate all subset (sum it ) and put it in set and check whether it is present or not 114425157

eg 5 3 . . . . . then AND_pref2 = 1 and AND_pref1 = 5 . generally it means by taking and operation you'r AND_pref will decrease(same for AND_suf) and for every i if it is valid permu then it would be equal.

i like the popovers.

use map

thanks, great exp.

overflow

ps :) i was wrong

it helped after 5 year of you exp.

why it is giving tle 104708084 any suggestions ( problem B)

!NotFake

look like you found.

same story bro :(

new year gift :P

see the magic tab

great work

did anybody get the idea of B soln 1?

i did not get the logic behind your solution, can you explain.

thanks, I feel dumb now .

what should i change in my solution C to get ac 102883253 , thank you and HAPPY NEW YEAR

length should be even. edit: if you meant there are only '?'

got it, thanks man.

I think I got it, but I have a little doubt, for the ignored command to be successful we had to measure the distance from the point(max) where our previous command had been successful (i.e: from the next point it had been unsuccessful)?

if i am not wrong you are trying to say that command is successful if robot receive command at t[i] which robot ignores when moving to x[i-1], if that's the case then why in the first test case why the last command is successful.

can somebody explain what is the meaning of the below line's from problem c, thanks?

You call the command i successful, if there is a time moment in the range [ti,ti+1] (i. e. after you give this command and before you give another one, both bounds inclusive; we consider tn+1=+∞) when the robot is at point xi. Count the number of successful commands. Note that it is possible that an ignored command is successful.

TO_OO_EndGame can you explain the logic behind your solution

can any one explain why in problem A. regular brackets sample test case 3, answer is 0 ( ( ( ) ) ( ) )

can someone view my problem 94937826 , why it's giving runtime error (cod 11) in which part of code , it is working fine on offline editor

Yeah , thanks bro..

I had read the problem 1418B - Negative Prefixes for more than 40 min and after that I had read the solution but I wasn't able to understand these lines in block ,can any one help , I think it says we need to find array so that it prefix sum array should be like starting from negative elements and once the positive element came then there should be no negative elements(all elements after that are positive) like eg [−8,−14,−13,−9,−5,2,0] and as given in solution and k is 5 , and we need to reduce the k some and propose a solution ,but that was not the case

Let k be the maximum j (1≤j≤n) such that pj <0. If there are no j such that pj<0, then k=0.

Your goal is to rearrange the values in such a way that k is minimum possible.

thanks in advance

okay,thanks

can some one explain how can i made this code more efficient (pluses and minuses) my submission is 85773685

can any one explain me why i am getting TLE on 5th test case

my sublission is 85516199

Please Someone Explain Why i am Getting TLE in Test case#5

my submission is : 85516199