Comments
On teraqqqHello 2025 by T-Generation, 15 months ago
0

It's not guessing .. if u have done the problem of finding bitwise and/or of a range , the problem won't be much of a pain

I just noticed I made a slight error.. I mistakenly wrote x instead of abs(x) at one point and got the entire problem wrong .

:(

what changes did u make to pass the tc 4 ?

On BledDestCodeforces Round 995 (Div. 3), 16 months ago
0

my code had same issue even though I fixed this issue when considering a[i] as my price , idk why I missed this when considering b[i]s..

On BledDestCodeforces Round 995 (Div. 3), 16 months ago
0

That's the same test case where my code fails ..35th token from tc 2.. if u get where exactly your approach fails , pls post here

means a lot! Glad I could help :)

same.. it showed a TLE on tc 8 for me first.. then after I refreshed , it showed ac ..

+9

Seems like they got to know that u r a master at using chatGPT :)

0

IK...i submitted the same way at the end ...But why is long double giving a precision error ? The values aren't even large..

0

only possible when the number given in the query is n..in that case *it2 would be the last element or n... the answer would simply be the last element of the time array

0

why was my submission for E failing when I was calculating the speed in long double ?

260353980

please go through once

Can someone tell me what am I missing in C problem ? I sorted in increasing order of b and found the required time for n messages , then I removed the messages one by one , checking which would reduce the time by maximum .. as soon as this sum was getting less than l , I was printing the current number of messages in the set...

249827661

I submitted E when there were 10 seconds for the contest to finish and my submission got vanished...

why so ?

Someone pls help me with my submission for C div 2 ... pls help me with the test case being failed ..

i am just checking for every character till kth place , ahead of its first index there must be present at least n-1 characters of each type for an answer..

243690556

even I got stuck at the gcd approach , the answer would be 2*(gcd of differences of successive terms)

i was trying a similar approach but got stuck...please explain

In problem B how come the answer is gcd of differences between the numbers multiplied by two ? gcd would give the number which would make entire of the array same , but how come it being divided by two is the ans?

C got accepted 30 seconds after the contest :(

thanks a lot.. It got an AC :)

Can someone pls see why my code for problem C fails for 1043rd numbers on test case 2 ? 237554366

237554366

pls see whats wrong in the code

0

ya..i get it..

was just being dumb and thinking that only leaves attached to a single node could be grouped in pairs of two...didn't realize that all the leaves present could be grouped in two...

every time i got an element grouped with more than 2 , I was calculating its ceil(connections/2)...my bad

0

someone explain me the proper logic behind B please

still couldn't find myself :(

Why can't i find my name in the common standings ? Why am I an untrusted participant ?

I find that a lot of ranks , including mine have been skipped in the official standings .. i don't think that friends mode is bugged

also i can not find my name in the common standings

but 17k participants are being shown officially , when u check in friends only mode

When I check the total number of participants who officially solved the problem A , it shows there are about 10k such participants , when I see the official participants who solved problem A , it shows there are about 17k of them .. so ideally , there should be about 17k people who have appeared for the contest , not near 10k...asking it because it would affect my rating..

can someone pls explain ?

Can anyone explain me how would we implement the logic of B problem as explained in editorial , like its easy to maintain cnt_1 and sum_1 but how would we find cnt_1 number of zeroes after every index ? I tried storing the indisces in a vector and then find the sum of first cnt_1 for every index but that gave me a TLE. Someone pls explain

The test case XXX XXX ... shouldn't even exist in a classical game of tic-tac toe..this is the very case where my code fails as I assumed 2 rows couldn't be exactly same...

my code also failed here...I assumed that two rows or columns couldn't be same and the code got accepted as well...

XXX

XXX

...

This test case wasn't included while contest and my code got accepted as well...a day later it says it fails on this one...

Same happened with me , my code in B problem got accepted during the contest and now it says it has failed on a certain test case . It should've informed me earlier and said that the solution won't get accepted on a certain test case.