its_Atrap

your wife is hot man

U should have wished for positive upvotes in comment section.

Let this be the first!

They think div3 contestors like us are inferior

Upvoted. I think you have a lot of work to do. You made a few mistakes with this comment, such as not posting it immediately after the announcement comes out. Also, in this comment you state that you have a particular goal and people should upvote you to help you reach that goal. Unfortunately, this will isolate people who are willing to upvote you for different reasons. So, you should not state any reasons or argument for why the reader should upvote you. Instead, just directly command them.

I just asked a simple question. Why downvote me?

I am banjobyster

One who dislike this post doesn’t love his/her mother!!

Why go on mother, you could have gone on anything like keyboard, mouse, CP, electricity, Edison, etc. but don't comment such to just gain some upvotes, PLEASE!!!

where to click?

Enjoy getting downvotes with your pizza.

wish you the same

Comeon Man, this isn't fair... Your video was posted way before the contest was gonna end... Atleast could have waited for the contest to end! Your videos must be source of logic and thinking for upcoming coders, not a way to help them seek an easier way to just copy and paste

If some number occurs x > floor(n/2) times, then, it is 2x — n. Else, its 0 or 1 depending on the length of the array

I wanna know abt D... It took so much brain power and idk why but i feel it's gonna be damn easy

Try using stack !

Try using left.lower_bound()

I didn't go through your code but I had used priority queue for this question and it got accepted (at least in pretests).

Submission: https://mirror.codeforces.com/contest/1506/submission/111027634

A massacre

yes for set its the right way -> st.lower_bound(val);
and it totally wrong ->auto itr = lower_bound(st.begin(),st.end(),val);

i once faced that.

Hey, MikeMirzayanov Just wanted to bring before you plagrism of two users

cyborg_7459 and cyborg7458

Both of these Users don't know whether same persons or different has submitted solution of Problem A and B with minor Changes. Please Do look at their submission. Even their template is same. Since Even submitting Solutions from alternate account is clear voilation of policy please Review their submission. Maybe they would be same person just submitting solution from one account to confirm its correctness and escape penalty, which is voilation of Rule and needed to be punished if really found guilty.

Their Submissions:

Problem A: 110996666 and 111008607

Problem B: 111007814 and 111006918

I wish that could be prevented but I wonder how especially that deciding if a comment should be downvoted or not is an opinion

I will

It wasn't phrased as "find longest common substring" so the task was really figuring out that lcs was optimal. And constraints are low enough to brute force.

There is no specific reason because it isn't true.

The reason.

Probably because you are printing Time elapsed at the end which is causing TLE

		F(int, i, 1, cnt) {
			x = a[maxi[i]];
			F(int, j, maxi[i] + 1, maxi[i + 1] - 1) {
				while(vis[x]) x--;
				ans2[j] = x, vis[x] = 1;
			}
		}

see you are deccrementing x and then finding the max avaiable number there is to fill. maybe this is causing tl in some very specific testcase.

for example lets read

N=8

5 5 6 6 7 7 8 8

answer is 5 4 6 3 7 2 8 1

now see to get to 4 at index 1 you decremented x 1 time

for index 3 you decremented 3 times

for index 5 you decremented 5 times

for index 7 you decremented 7 times

total complexty is 1 + 3 + 5 + 7 + 9 + 11 + ... n (sum of all odds upto n). this looks like n^2. and exactly where tl is coming from.

Yes,I used his computer because of this easy round.

Same I too got TLE on 8th case in problem D this is because the value of a[i] can be 1e9 if in any case there are more values greater than 1e8 then it will form chain structures to hold key-value pair so instead of O(1) per query the amortised complexity may be O(n) resulting in O(n^2) overall. So better to use map which has constant factor of O(log(n)) it won't hurt you!

will be updated soon! have patience.

and congrats for positive delta!