cry's blog

Codeforces Round 993 (Div. 4)
By cry, 11 days ago, In English

Hello Cowodeforces :D

Art by chromate00

vgoofficial, Lilypad and I are very to invite you to participate in Codeforces Round 993 (Div. 4), which will start on Dec/15/2024 17:35 (Moscow time). There will be $$$8$$$ problems, with one split into two subtasks, to be solved in $$$2$$$ hours and $$$15$$$ minutes. Participate or you'll have to wait another millennium for a Div. 4 round.

The format of the event will be identical to Div. 3 rounds:

  • ICPC rules with a penalty of 10 minutes for an incorrect submission;
  • 12-hour phase of open hacks after the end of the round (hacks do not give additional points)
  • after the end of the open hacking phase, all solutions will be tested on the updated set of tests, and the ratings recalculated
  • by default, only "trusted" participants are shown in the results table (but the rating will be recalculated for all with initial ratings less than 1400 or you are an unrated participant/newcomer).

We urge participants whose rating is 1400+ not to register new accounts for the purpose of narcissism but to take part unofficially. Please do not spoil the contest for the official participants.

Only trusted participants of the fourth division will be included in the official standings table. This is a forced measure for combating unsporting behavior. To qualify as a trusted participant of the fourth division, you must:

  • take part in at least five rated rounds (and solve at least one problem in each of them),
  • do not have a point of 1400 or higher in the rating.

Regardless of whether you are a trusted participant of the fourth division or not, if your rating is less than 1400 (or you are a newcomer/unrated), you may choose to participate rated or unrated.

We want to express overwhelming gratitude to the following orzosities for making the contest possible:

UPD: Editorial

  • Vote: I like it
  • +305
  • Vote: I do not like it

»
10 days ago, # |
  Vote: I like it +66 Vote: I do not like it

guys i think we got a bit carried away while writing this contest

→ Reply
  • »
    »
    10 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    yea fr

    → Reply
  • »
    »
    8 days ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    Always the good round from the goat!!!

    → Reply
  • »
    »
    7 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Will there be an interactive problem ?

    → Reply
  • »
    »
    45 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    This is my first contest in this platform, but it seems my contest has been marked unrated! How could I have appeared in previous 5 contest if I am unrated and why should I? It doesn't seem right.

    → Reply
    • »
      »
      »
      43 hours ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Um no, it's more like your name won't be shown in the standings, but the round will be rated for you I believe.

      → Reply
  • »
    »
    18 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    yes[user:cry]

    Spoiler

    Codeforces Round 488 by NEAR (Div. 1)

    → Reply
»
10 days ago, # |
  Vote: I like it +33 Vote: I do not like it

As a tester, I can confirm that one of the problems was based on Honkai: Star Rail.

→ Reply
  • »
    »
    10 days ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    WOW zrnstnsr tested round

    → Reply
  • »
    »
    10 days ago, # ^ |
      Vote: I like it +14 Vote: I do not like it

    tester leaking contest exposed 2024 caught on camera

    → Reply
  • »
    »
    45 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    As a tester, I can confirm that all of the problems had Tle for me.

    → Reply
  • »
    »
    22 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Which?I can't find that!

    → Reply
    • »
      »
      »
      21 hour(s) ago, # ^ |
        Vote: I like it +9 Vote: I do not like it

      It's C problem.

      Ball is the teacher in Paperfold University

      Ball is teaching $$$a+b+c$$$ monkeys, and he wants to assign as many monkeys to a seat as possible

      → Reply
      • »
        »
        »
        »
        21 hour(s) ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Thanks!I got it,Ricco will teach you to study in the Paperfold University.

        → Reply
»
10 days ago, # |
  Vote: I like it 0 Vote: I do not like it

8 problems in 2.25 hours? time to :cope:

→ Reply
  • »
    »
    8 days ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    It feels weird reading time like that.

    → Reply
»
10 days ago, # |
  Vote: I like it +26 Vote: I do not like it

As a participant, I hope there are no problems based on Honkai: Star Rail.

→ Reply
»
10 days ago, # |
  Vote: I like it +14 Vote: I do not like it

How can I become a testuwuer?

→ Reply
  • »
    »
    10 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You can message me to be considered, but I usually only accept / reply to people that seem active, promising, and honest on a variety of factors.

    → Reply
»
10 days ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

I think I know what is drawn on that picture. It's Gekko's moshpit on budget.

→ Reply
  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    But I think you need to shut the fck up and stop cheating

    → Reply
    • »
      »
      »
      8 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      You are right on time man, the justice kicked in almost a year after my last rated contest. Batman from wish.com

      → Reply
    • »
      »
      »
      8 days ago, # ^ |
      ← Rev. 2   Vote: I like it 0 Vote: I do not like it

      bro's got some anger issues to deal with

      → Reply
»
10 days ago, # |
  Vote: I like it +33 Vote: I do not like it

As a tester, I just want to vouch that Intellegent is very intelligent

→ Reply
»
10 days ago, # |
  Vote: I like it +11 Vote: I do not like it

As a tester, I can confirm that there will be eight problems, with one split into two subtasks, to be solved in 2 hours and 15 minutes.

Additionally, I can confirm that each problem will require you to write up to zero or more lines of code.

→ Reply
  • »
    »
    27 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thank you so much for the valuable information! It will be incredibly helpful not only for this contest but for all my future contests as well.

    → Reply
»
10 days ago, # |
← Rev. 3   Vote: I like it +33 Vote: I do not like it

As a tester, I was tested.

PS Welcome to CP, Shrek Jr :)

→ Reply
»
9 days ago, # |
  Vote: I like it +14 Vote: I do not like it

As a tester, I don't know what kinda brainrot I just created with the artwork

→ Reply
»
9 days ago, # |
  Vote: I like it +9 Vote: I do not like it

As a tester, the art for this contest is beautiful

→ Reply
»
9 days ago, # |
  Vote: I like it 0 Vote: I do not like it

probably my last contest on cf .hoping for good perf :)

→ Reply
  • »
    »
    6 days ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    I analyzed your account.

    Looks like you can reach expert levels in 5 months with good practice.

    Don't leave CP :(

    → Reply
»
9 days ago, # |
  Vote: I like it 0 Vote: I do not like it

As a tester, ChatGPT solves n problems in this contest where n is an integer such that 0<=n<=10

→ Reply
»
9 days ago, # |
  Vote: I like it +1 Vote: I do not like it

As a tester, a few problems of this round took me to nirvana. Hope you enjoy too!

→ Reply
»
9 days ago, # |
  Vote: I like it +13 Vote: I do not like it

As a tester, i have no clue how i got VIP without doing anything

→ Reply
»
9 days ago, # |
  Vote: I like it +20 Vote: I do not like it

is that a lobotomy corporation reference

→ Reply
»
9 days ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

hope i can reach specialist after this round and can anyone predict how much rank should i get for a 100+ in div4?

→ Reply
»
9 days ago, # |
  Vote: I like it +9 Vote: I do not like it

GEOMETRY DASH MENTIONED!!!!11 FIRE IN THE HOLE!

→ Reply
»
9 days ago, # |
  Vote: I like it 0 Vote: I do not like it

After becoming a specialist, this is my first unrated contest in Div. 4. I think it will be fun!

→ Reply
»
9 days ago, # |
  Vote: I like it 0 Vote: I do not like it

we got an orange-ranked lobotomy patient before gta6 thats crazy

→ Reply
»
9 days ago, # |
  Vote: I like it -16 Vote: I do not like it

Would tourist beat John Pork in a 1v1 fight???

MikeMirzayanov please answer this important question

→ Reply
»
9 days ago, # |
  Vote: I like it +10 Vote: I do not like it

→ Reply
»
9 days ago, # |
  Vote: I like it -18 Vote: I do not like it

is auhthority from this contest from russia? cuz im taking notes of words btw!

→ Reply
»
8 days ago, # |
  Vote: I like it -23 Vote: I do not like it

what is point of div4 when ChatGPT exists at this point?

I know, I know rule exists however you know

→ Reply
  • »
    »
    8 days ago, # ^ |
      Vote: I like it +26 Vote: I do not like it

    I don't know why we still have this kind of comment every time. It's about general perception: if we all agree that we must not use AIs during contests, then we just simply need to ignore those who use AIs and don't give credits to them. It's up to the admins how much they can actually catch the cheaters, and there's not much we can do about it. We do contests for our own good, not to perform better than AIs.

    → Reply
  • »
    »
    8 days ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    to let those who don't use gpt improve.

    → Reply
»
8 days ago, # |
  Vote: I like it +25 Vote: I do not like it

As a tester, the problems are very skibidi

→ Reply
»
8 days ago, # |
  Vote: I like it +1 Vote: I do not like it

Wow. Another cry round! <3

→ Reply
»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Wow.

Nice blog!

→ Reply
»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

As a participant I will be giving the contest from this account only.

→ Reply
»
8 days ago, # |
  Vote: I like it +1 Vote: I do not like it

Another div 4 where thousands of indians and bangladeshi will be caught cheating

→ Reply
»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

cool

→ Reply
»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Div Fow!! <3

→ Reply
»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

To every Newbie/Pupil trying to up improve. I wish them All the best.

→ Reply
»
7 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Hope to reach master this round

→ Reply
»
5 days ago, # |
  Vote: I like it 0 Vote: I do not like it

h

→ Reply
»
5 days ago, # |
  Vote: I like it +5 Vote: I do not like it

can anybody tell me where i can practice window function questions in sql ?

→ Reply
»
4 days ago, # |
  Vote: I like it +3 Vote: I do not like it

As a tester, I believe this will be the best Div4 ever! Enjoy it!

→ Reply
»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

60th comment ;D

→ Reply
»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

'Participate or you'll have to wait another millennium for a Div. 4 round.' true that.

→ Reply
»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

As a, I can say this.

→ Reply
»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Stop, wake up bro, fire in the hole is old meme, stop using it

→ Reply
»
4 days ago, # |
  Vote: I like it +6 Vote: I do not like it

Umm, you forgot to mention and orz MikeMirzayanov

→ Reply
»
4 days ago, # |
  Vote: I like it +1 Vote: I do not like it

Wait, how is this emoji or sticker work? I mean how can I use them

→ Reply
»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

How can I become a legendary Grandmaster?

→ Reply
»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

the gd community is getting out of hand, even codeforces isnt safe from lobotomy anymore :sob:

→ Reply
»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

MY TIME TO BECAME A PUPIL .

→ Reply
  • »
    »
    4 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    good luck, for me it is time to became a newbie

    → Reply
    • »
      »
      »
      3 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      ye so do i

      → Reply
      • »
        »
        »
        »
        3 days ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        nah, your rating is growing, so it's more probable that you became a specialist than a newbie

        → Reply
»
4 days ago, # |
  Vote: I like it +1 Vote: I do not like it

what's the deal with vip and vip+ testers?

→ Reply
»
4 days ago, # |
  Vote: I like it +2 Vote: I do not like it

hehe

→ Reply
»
4 days ago, # |
  Vote: I like it +3 Vote: I do not like it

I think they're very "Aoouhhhh!" to invite us

→ Reply
»
3 days ago, # |
  Vote: I like it +1 Vote: I do not like it

Just became green for a week, hope don't gray back this time :)

→ Reply
»
3 days ago, # |
  Vote: I like it +4 Vote: I do not like it

Can you make div 2 next time

→ Reply
»
3 days ago, # |
  Vote: I like it +3 Vote: I do not like it

hope you all get greens and give your 100% with best wishes

→ Reply
»
3 days ago, # |
  Vote: I like it +4 Vote: I do not like it

Barely eligible (flex) :)

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

is this contest rated ?

→ Reply
»
3 days ago, # |
  Vote: I like it +2 Vote: I do not like it

what will be the points distribution ? anyone ?

→ Reply
  • »
    »
    3 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    ICPC rules,no score only number of problem solved

    → Reply
»
3 days ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

As a participant, I hope I can solve the problem based on Honkai Star Rail.

May the journey lead us skyward.

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Only trusted participants of the fourth division will be included in the official standings table. This is a forced measure for combating unsporting behavior. To qualify as a trusted participant of the fourth division, you must:

take part in at least five rated rounds (and solve at least one problem in each of them)

doesn't this kinda defeat the purpose of div 4 contests since most participants are newcomers,and don't really have a lot of experience with contests.

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

I need 200 points to reach cyan,I hope i can do it today.

→ Reply
»
3 days ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it
Spoiler
→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

My first contest!

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

I'm new and haven't participated in any rated rounds. Can I still participate?

thanks.

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Beautiful art by chromate00!

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

As a tester, I can confirm that one of the problems was based on Honkai: Star Rail

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

leaking contest exposed in 2024 caught on camera

→ Reply
»
3 days ago, # |
  Vote: I like it +5 Vote: I do not like it

Knee surgery tomorrow

→ Reply
»
3 days ago, # |
  Vote: I like it -25 Vote: I do not like it

As an unrated participant, I wish everyone good luck and a positive delta.

...and for myself, contribution++. :)

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Codeforces Round 1000-7

→ Reply
»
3 days ago, # |
  Vote: I like it -14 Vote: I do not like it

Never cry, and keep Smile ing.

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Out of my curiosity, does Lilypad come from HIMYM?

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Really confused whether to participate or not....because have an habit messing things around in div3 and div4

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

To be honest, it doesn't make sense to have $$$VIP$$$ and $$$VIP+$$$ testers. $$$VIP$$$ already has $$$very$$$ in its name, so why don't you call $$$VIP$$$ testers $$$IP$$$ (important person) testers and $$$VIP+$$$ testers $$$VIP$$$ testers? Because I'm sure the $$$VIP$$$ testers weren't integral to the round's success, even if they might've helped out a bit. And contributing a problem arguably sounds like a $$$VIP$$$ thing, but I wouldn't call it a $$$VIP+$$$ thing.

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

A Rare & Interesting Div4 Contest :)

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

A div 4 contest? Maybe I could get my rating up finally

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Hoping the problems to be bit easy unlike last div-4 !!

→ Reply
»
3 days ago, # |
  Vote: I like it +1 Vote: I do not like it

Was hoping that I could solve at least 4 problems but have to settle for 3 problems today :-(

→ Reply
»
3 days ago, # |
  Vote: I like it +3 Vote: I do not like it

As a GeometryDash 4k stars player , I feel sorry that I miss this round :(

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Excellent contest! I really liked 3 of the problems.

(Btw an interesting coincidence, the first problem of this contest is named "Easy Problem", there is another problem on CF of the same name 1096D - Easy Problem, which happens to be the first DP problem I solved in my life.)

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

that was a great round

→ Reply
»
3 days ago, # |
  Vote: I like it +4 Vote: I do not like it

Nice Div. 3 round

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

I've added hints and thought process for G1. Medium Demon Problem (easy version) on CF Step

→ Reply
  • »
    »
    3 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    How to do G2 ?

    → Reply
    • »
      »
      »
      3 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Make a directed graph $$$i \rightarrow a_i$$$ and another inverted graph $$$a_i \rightarrow i$$$.

      Spoiler
      → Reply
  • »
    »
    3 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    this problem solve by dp ? :0, I think it is graph problem, but I fail

    → Reply
»
3 days ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Hint for D:

First print unique numbers which appeared in array 'a' in order then print rest of the numbers which does not appear in array 'a' but each of them only once (and take care that 1 <= bi <= n).

ex: 4 5 5 5 1 1 2 1
Ans:4 5 1 2 3 6 7 8 --->(4 5 1 2 appear in order in a)

ex: 1 1 2 2 1 1 3 3 1 1
Ans:1 2 3 4 5 6 7 8 9 10 --->(1 2 3 appeared in a in order)

code
→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

bro why cant i solve more than 3 probs...skill issue ig :(

→ Reply
  • »
    »
    3 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    yeah, 3 months ago, my maximum number of prob I can solve is 2, till now it just increase by 1, but I feel a little bit better, maybe you need to try more 1300-1500 point problem to realize more things rather than around 800-900

    → Reply
»
3 days ago, # |
  Vote: I like it +8 Vote: I do not like it

That was a real mathforces

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Anyone has a neater solution for D ? I solved it using simulation because it is known that a solution exists but I would appreciate a neater solution.

→ Reply
  • »
    »
    3 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You can simply make every number appearing once in the array, then all of them will be mode.

    → Reply
    • »
      »
      »
      3 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Understood.

      Just looked at your performance in the contest. You performed so well. Congratulations !

      → Reply
  • »
    »
    3 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    yes just output the distinct element in their first appearance and continue with the normal output in the rest 12345 so on

    1 1 2 2 1 6 3 3 1 4

    1 5 2 7 8 6 3 9 10 4

    output 1 at 1 2 at 2 6 at 6 3 at 3 4 at 4 rest out the normal remaining out of n

    → Reply
  • »
    »
    3 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    note that the max value of an array element is n, so keep track of the numbers from 1 to n which dont appear in the given array. now, traverse the given array from left to right, if an element occurs for the first time, add that to the answer array, else you add a number that does not occur. Now every element from 1 to n will appear only once, hence the mode criteria is satisfied

    → Reply
  • »
    »
    3 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Print all numbers form 1 to n (which implies all unique number in answer array 'b') but first print all the numbers in order as it appeared in array 'a' and then rest leftovers.

    see this

    → Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

For G1 I thought the process to remove the cycles and count the longest chain , such a shame couldn't Implement it in O(n)

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

the moment i pressed submit F contest over :(

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

I spend more than 1h on F..."Time limit exceeded" is not so beautiful.

→ Reply
»
3 days ago, # |
← Rev. 2   Vote: I like it +6 Vote: I do not like it

Problem F was cool; loved it!

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

How did so many people solve E? I couldn't come up with even a logic that works.

→ Reply
  • »
    »
    3 days ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    Iterating through all $$$n$$$ and calculate $$$k^n$$$. Notice that you only need to iterate till $$$k^n \leq 10^9$$$, and since $$$k \geq 2$$$, it will be at most $$$30$$$ possible $$$n$$$. Then find the bound of $$$x$$$ for each $$$k^n$$$. 296642769

    → Reply
    • »
      »
      »
      3 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Yeah I understand now why n can be at most 32 or so. How would I have come up with such an idea in contest? I get that I need to practice more of those problems.

      → Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

nice E, F

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

My best performance so far, hope to finally reach specialist (still don't know where my G2 went wrong sadly... could've been better).

→ Reply
»
3 days ago, # |
  Vote: I like it +8 Vote: I do not like it
Why are you TLE on F?
→ Reply
  • »
    »
    34 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Nopes , my soln is not varying on O(n*m) still it's getting Tle on testcase 25.

    → Reply
    • »
      »
      »
      33 hours ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Testcase 25 hacks almost all $$$O\left(q(\sqrt{n}+d(n)\log{n})\right)$$$ solutions. It's added on open hack phase.

      → Reply
      • »
        »
        »
        »
        33 hours ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        One of the accepted submission of a friend of mine, when I submitted it through my id , it's now giving tle on test-25, how can this be possible

        → Reply
        • »
          »
          »
          »
          »
          23 hours ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Check out my submission
          Initially got tle on test 25 ,after changing long long back to int, it runs just within the constraints.
          296802950

          → Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Why can't I see anybody's submissions in/out of contest except mine? It says N/A. Please help me out.

→ Reply
»
3 days ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

good contest

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Nice problems F, G1, G2 !

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

why my submission 296750050 gives tle, i am not able to handle overflow may be.

→ Reply
  • »
    »
    23 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Try Binary Search to find the first element within the range in stead of Brute forcing two nested loops.
    296676561

    → Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

E took me over 1hr because finding overlapping ranges is the hardest thing in the world.
I'm just bad man (╥﹏╥)

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

I'm not sure why my submission for G1 is getting TLE, any help would be much appreciated. Thank you!!

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

for G!, can someone point out why am i getting TLE: https://codeforces.me/contest/2044/submission/296745366

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Oh my god. Who could have imagined how angry my stupidity makes me(

→ Reply
»
3 days ago, # |
  Vote: I like it 0 Vote: I do not like it

As a geometry dash player, I loved this round XD

→ Reply
»
3 days ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Sometimes i get scared by my own stupidity, lost 1+ hrs debugging E, where i just had to include n = 0 as well, was so close on g2 but couldn't complete under time. Anyway great round as always. Thank you

→ Reply
»
2 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Any explanation for the image?

→ Reply
»
2 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Happy to have solved 6 problems in a Div. 4 contest for the 3rd time! Yay!

→ Reply
»
2 days ago, # |
  Vote: I like it 0 Vote: I do not like it

It was the FIRST div for cry that I didn't suffer in it, please keep going like that ♡

I wish the best for you all <3

→ Reply
»
2 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Nice Problems

→ Reply
»
2 days ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

296729877 I wrote this program for harder problem and i understand that it has time complexity issues but i have no idea how to make the code more time efficient with the approach I used, would greatly appreciate any help

→ Reply
  • »
    »
    2 days ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    You had the right idea to realize that by simply permuting the order of numbers 1 through N to prioritize the numbers that showed up first. This would result in an array where all of these numbers would be considered as a mode (count == 1).

    I believe the really slow part of the code is the nested for-loop you have for appending the numbers that don't show up because it would run an O(n) search for every number 1 through N, for every index until it fills the array. To fix this, you could have a lastSeen variable to track the last i that you appended to the array, so that instead of looping from 1 through N, you would cut it short to i through N.

    To make it cleaner, you could use sets instead. Create a set (straight from the input) of all numbers that show up in the original array. Use set_difference or similar method to obtain all the numbers that didn't show up. Then, combine these two by appending the second to the first while maintaining the order of the set. That way, you don't have to spend O(n) every time you test for whether a number has already appeared.

    Hope this helps! :)

    P.S. Here's my submission and implementation of the above. It's a bit messy though since I'm a noob :P 296684484

    → Reply
»
2 days ago, # |
  Vote: I like it 0 Vote: I do not like it

when ratings would be given for this contest???????????

→ Reply
  • »
    »
    2 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I too have the same doubt.

    → Reply
  • »
    »
    2 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Edu-style rounds (including Div 3 & 4) will go like this:

    • Coding phase
    • Open hacking phase (12 hours)
    • (a few hours break)
    • Rejudging (all solutions are rejudged with hack inputs)
    • (a few hours break)
    • Ratings are updated

    When ratings are updated, the "RATING CHANGES" link is added to the contest standings page. If there's no such link, the ratings are not updated yet. Just wait until the ratings are updated.

    → Reply
»
2 days ago, # |
  Vote: I like it 0 Vote: I do not like it

I have a doubt will this contest will be rated for me or not ? I have a contest rating of 750 ..? The contest is completed but my rating is not updated why ?

→ Reply
  • »
    »
    2 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Because System Testing is going on.

    → Reply
    • »
      »
      »
      2 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Nope it is Showing that Finished.

      → Reply
      • »
        »
        »
        »
        2 days ago, # ^ |
        ← Rev. 3   Vote: I like it 0 Vote: I do not like it

        According to my experience, for the contest that has an open hacking phase (e.g. Div. 4), its system test will begin after ~15 hrs after the end of the contest.

        The system test often lasts 2~3 hrs, then the ratings will be updated within half an hour.

        So, just wait for about 3~4 hrs (sometimes longer, if the contest has a lot of participants)

        → Reply
        • »
          »
          »
          »
          »
          2 days ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Ok Thank u. Any suggestions for me so that I can reach pupil ?

          → Reply
          • »
            »
            »
            »
            »
            »
            2 days ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            No shortcuts — just step out of your comfort zone and start solving problems slightly beyond your level.

            Specifically, if your rating is X, then aim for problems with a difficulty level of X + 200.

            You might feel frustrated at the very beginning, but as we all know, practice makes perfect!

            → Reply
»
2 days ago, # |
← Rev. 7   Vote: I like it 0 Vote: I do not like it

First blog in which there was not a thanks to MikeMirzayanov

→ Reply
»
2 days ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

why i can not rating

→ Reply
»
2 days ago, # |
  Vote: I like it 0 Vote: I do not like it

if i want rating,should i chose which one so that i can rating

→ Reply
»
2 days ago, # |
  Vote: I like it 0 Vote: I do not like it

would the newcomer have rating???

→ Reply
»
2 days ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Could anyone help me with my code? https://codeforces.me/contest/2044/submission/296745472 Codeforces said it has runtime error on test case #10 . But when I try the code and the test case #10 on my pc, also on ideone ( https://ideone.com/eVDhX0 ), I found no error. Is there a fix for my code? I just can't find the error.

→ Reply
»
2 days ago, # |
  Vote: I like it 0 Vote: I do not like it

has the rating come out for this contest?

→ Reply
»
47 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

fire in the hole

→ Reply
»
46 hours ago, # |
  Vote: I like it +8 Vote: I do not like it

At first, I apologize for registering an alt. But it's an necessity because my account Transparent_heart was banned while participating in the Div. 4 contest.

And I can't send message to cry.

Hi cry, I participated in the Div. 4 contest yesterday. The problems were awesome and I really enjoyed the contest. What's more exciting was that I was on the first page of the standing! I really appreciate you and other authors as well as the coordinator for preparing such an fantastic contest!

However, everything changed at the time I submitted my solution of problem F. I'm really shocked that I was banned! I don't know why. I should have been reached my best performance but now my account is disabled!

All the idea is from my mind and the code was written by myself. You can see my submissions to prove it.

Do you know the reason why I'm banned? I just want an explanation because that account is very important to me. I VPed 30+ contests using it!

I may be a little radical. Please forgive me. But I'm really frustrated and confused. Sorry :(

→ Reply
  • »
    »
    46 hours ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    The most difficult thing now is to get the admin to see my comments lol

    → Reply
    • »
      »
      »
      45 hours ago, # ^ |
        Vote: I like it +8 Vote: I do not like it

      Hi Vladosiya, sorry for disturbing but can I have a few minutes of your time to get a reason?

      → Reply
      • »
        »
        »
        »
        42 hours ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        A day goes by. Messaged admins, got no reply, talks unread, account still blocked... Time flies, desperate deepens.

        No one had ever sent me a word about this. It's just blocked. All of a sudden. At the same time I realized I have reached a 2700 performance, although it's provisional and vanished the next second.

        → Reply
        • »
          »
          »
          »
          »
          41 hour(s) ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          I have just received Vladosiya's message. He said I'm innocent and would remove the penalty later. I'm very excited because I finally got a fair shake after a day of waiting. Thanks a lot Mr. Vlad, may I express my sincere gratitude to you.

          → Reply
»
46 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Will i get rating from this contest because i only have done two contests before this one.

→ Reply
»
46 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

296697987

This is still in queue I am not sure why? I submitted this during the contest.

Will it not count?

→ Reply
»
44 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

pupil again!!

→ Reply
»
44 hours ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

This was my first contest. My rating hasn't updated. Any idea :(??

→ Reply
  • »
    »
    43 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I created this account years ago but didn’t participate in any contest. Should i create a new account???

    → Reply
  • »
    »
    42 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    ratings are updated already, you participated as an unrated participant in last div 4

    → Reply
»
43 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

I have entered rated in the contest but still my rating in contest is showing N/A can any editor have look on the issue?

→ Reply
»
43 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Hey @cry , @vgoofficial, @Lilypad Question D my python code runs in O(N) however it gets a TLE after hacking while the same code in C++ got accepted Is there anything I can do about this ?

~~~~~~~~~~~~~~~~~~

tests = int(input()) for _ in range(tests): n = input() arr = list(map(int, input().split())) # print(arr) # future = set(arr) ans = [] nums = set()

for item in arr:
    if item not in nums:
        nums.add(item)
        print(item,end=' ')

for i in (set(range(1, len(arr) + 1))-nums):

    print(i,end=' ')

print()

→ Reply
  • »
    »
    43 hours ago, # ^ |
      Vote: I like it -8 Vote: I do not like it

    if item not in nums:

    This actually runs in $$$\mathcal{O}(n)$$$ now your code runs in $$$\mathcal{O}(n^2)$$$ which is not good , do it like me , maintain an array $$$done$$$ and check for each index normally , instead of searching.

    → Reply
    • »
      »
      »
      40 hours ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Nums is a set tho and searching in a set is O(N), also I retyped the exact same code in c++ and it got accepted

      → Reply
      • »
        »
        »
        »
        40 hours ago, # ^ |
        ← Rev. 2   Vote: I like it -8 Vote: I do not like it

        because searching an element on set on C++ is $$$\mathcal{O}(\log(n))$$$ which is fine constant factor ($$$\approx 20$$$) , but in Python it's $$$\mathcal{O}(n)$$$ is too much making it quadratic.

        so $$$\mathcal{O}(n\log(n)) \approx \mathcal{O}(20n)$$$ is much better than $$$\mathcal{O}(n^2)$$$

        $$$n=|s|$$$

        → Reply
  • »
    »
    37 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    you got hash hacked, refer to this. For this problem i would recommend to use a boolean array tho.

    → Reply
»
43 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

So one of my solutions got flagged as some user Ravi_sonamani01 had some portion same. I was was the first one to code my solution and i dont know this user. I ensure that i have not leaked my solution. can you please help me how i can solve this issue as i am near to reaching pupil

→ Reply
»
42 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Query About Unrated Status in Round 993 (Div. 4)

Hello, I participated in Codeforces Round 993 (Div. 4) as jatin_23, with a current rating of 351, and expected to be rated in the contest. However, my registration was marked as unrated, even though my rating is below 1400.

Could you clarify if this was due to an error during registration or another reason? I’d like to ensure I’m correctly registered as rated in future contests.

Thank you!

→ Reply
»
41 hour(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

This was my first contest, and I solved three problems. Will I get a rating? If so, when will the rating be updated?

→ Reply
  • »
    »
    41 hour(s) ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Seems like you do not meet the criteria for the trusted participants stated in the announcement. That's why you are not rated.

    → Reply
»
40 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

what is hacks it ruining my submissions..

→ Reply
»
37 hours ago, # |
← Rev. 15   Vote: I like it 0 Vote: I do not like it

How is it possibile that I got accepted during the contest on problem F and now it gives me TLE on test25. I wrote the solution with the maps and also in the editorial it is a optimal solution for this problem.

Using unordered_map instead of map change the result to accepted. If during the contest it would have given me TLE I would have changed it and got accepted. It doesn't seem fair.

→ Reply
»
37 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

296865335 296893248 The two are very similar codes and I feel they are actually the same but the give a very diff runtime with the first working in 2s and the second in 4s , what might be causing that ?

→ Reply
»
30 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Help needed. A newbie here I did submit 3 problems but my rating fell down, Anyone know why

→ Reply
  • »
    »
    16 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I believe that rating change depends on two things:
    1. Your expected ranking before contest based on your ranting
    2. Your ranking after contest based on your performance
    if 1 = 2, then no change
    Your rank was 19059 but you were expected to have higher rank.
    Good luck next round

    → Reply
    • »
      »
      »
      16 hours ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Thank you. You mean to tell i shld have solved few more problems.

      → Reply
»
28 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Hi everyone,

I have attended this contest and solved 5 question but it shows me unrated for some reason, I am pretty new to codeforces (I have given like 5-6 contest 2-3 years ago), can anyone help me understanding why I am unrated for it even though my rating is <1400

→ Reply
»
27 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

FIRE IN THE HOLE!

→ Reply
»
21 hour(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

https://www.urbandictionary.com/define.php?term=testuwuer&defid=18369015

please use this

→ Reply
»
20 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Guys, its me.

→ Reply
»
3 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

I did not release my code snippet to anyone, I might have used ideone.com but I have not shared the code snippets nor they have shared me their code snippets.

→ Reply