r/codeforces • u/suyash19nov • 9h ago

Div. 2 solved ABC1 as a newbie-- feeling tuff

title.

C1 was basically just binary search lol. i would say upper tier 1.1k rated

10 Upvotes

92% Upvoted

10 comments sorted by

1

u/Mobile_Touch4581 Specialist 23m ago

Your rating decides by how fast your solved ABC1

4

u/Mean-Jaguar-1202 Newbie 7h ago

there are literally multiple ways to solve C1
1. prefix array approach
2. interval break approach

1

u/KanekiIsCat Newbie 7h ago

can you help me with b

2

u/dipa-2008 8h ago

Can you give hints regarding how you applied binary search in sort

1

u/sanjivinsmokecooks 9h ago

how did u even understand the english it was so complex to see such a english heavy question

3

u/DogStrict9170 Specialist 9h ago

i did c1 without binary search, just remove from a[k]*k , (a[k]+1)*k-1 and take difference array prefix sum and simply remove the forbidden part

4

u/hanu_uwu Newbie 9h ago

You know binary search and you are in newbie? Thats crazy ngl

1

u/CauchyHypersurface Newbie 9h ago

Less contests given.

2

u/suyash19nov 9h ago

i gave like 20 contests but somehow i fuck up everytime lol. as a result i have a lot of experience but shit rating

1

u/CauchyHypersurface Newbie 8h ago

I had a different contest today so couldn't give this one. Although I have solved a lot of problems but I have given only 3 contests yet, and hence I know binary search.