yse's blog

Codeforces Round 1096 (Div. 3)
By yse, 4 weeks ago, In English

Hello, Codeforces!

I am super excited to invite you to participate in Codeforces Round 1096 (Div. 3), which will take place on Apr/30/2026 17:35 (Moscow time). You will be given $$$2$$$ hours and $$$30$$$ minutes to solve $$$8$$$ problems. All problems were authored and prepared by me.

The round will be hosted by rules of educational rounds (extended ICPC). Thus, all solutions will be judged on preliminary tests during the round, and after the round, there will be a 12-hour phase of open hacks. After the open hack phase, all accepted solutions will be rejudged on successful hacks. Also, note that there is no score distribution but the usual penalty of 10 minutes for each wrong submission, following the rules of educational rounds.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participant of the third 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 rating of 1900 or higher at any moment in time.

Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you (unless you register unrated).

I would like to thank the following people for making this round possible:

Good luck, and most importantly, have fun!

UPD: Tutorial

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

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

So excited

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

As a member of the Sunphis fan club, hope I become an expert.

→ Reply
»
3 weeks ago, hide # |
 
Vote: I like it -6 Vote: I do not like it

As a VIP participant of cf rounds,I've fully prepared to solve div3 problems.

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

Finally after months!!!

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

The best, as usual

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

why isnt carrot working in recent contest? Can something be done about it?

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

this is my last chance to become an expert before my finals

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

Wish my friends wwwqwq,whopassby,yiren and mikasa_kira can improve their rating this round

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

Mandatory Comment

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

hope to AK the round and get back to my peak!

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

I am ready to participate in this contest.

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

Hope to reach specialist level in this contest. Let's gooooo

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

HELLO

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

Hoping for some Interactive Problem:)

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

Don`t trust pretests this round.

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

Open hacking phase will likely change final standings significantly.

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

someone call me when the contest starts +78129254848, i'm going to take a nap

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

    As long as I call your phone, I will receive a billing notice shortly, because we are in different countries.

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

my first contest, super excited!

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

pupil

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

excited

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

Will participate in a round after 1.5 years.

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

_nsa_ is a cheater, he cheats at every contest using AI

→ Reply
»
3 weeks ago, hide # |
 
Vote: I like it -10 Vote: I do not like it

Hello everyone, my account is disabled by adminstrator by no reason, and I did not get any notification. What do I need to do? Can anyone help me please to get my account back. In my own account I am Candidate Master, so I need that account

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

codeforces

→ Reply
»
3 weeks ago, hide # |
 
Vote: I like it -10 Vote: I do not like it

Div. 4 pretending to be a div. 3 :)

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

Interesting problems! My first All Clear cooked by greedy in H

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

Best Div 3 of the year?

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

It All Went Sideways (my rank on the number line) after seeing the problem E.

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

Prefsum-forces

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

Can someone tell me what's wrong with my solution to problem D? https://mirror.codeforces.com/contest/2227/submission/373151513

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

    Can't understand your code... what's your idea?

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

      the same as the editoral

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

        I think you are calculating mex3 without checking if the [i..j] is palindrome where i<j and A[i]=A[j]=0

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

        Ohh Okay... Now as I read the editorial, my solution is completely different from it and completely relies on the nature of the given data.

        I basically just started expanding palindrome of even and odd length and insert the given elements into a set, once I have a palindrome of a fixed length i just check which element is missing and that is my mex and then I update the answer. The only reason why it work is because there can be at most two duplicate number thus the inner and outer loop will consider an element at most 4 times. So it is sort of O(4n)

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

    You have to have the loop for finding mex3 inside if(palin) block. Else you might not have palindrome in l to r (as also mentioned by vanshgambhir) but still have updated some values in Esta3 vector.

    Accepted

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

    You messed up with brackets. Look carefully though you are expanding on outer end when inner subarray is palindrome but you calculate mex3 regardless of if inner is palindrome or not. Just shift your for loop inside if(palin) block and it should work fine.

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

H is a really cool problem, but how to solve G? Really good contest, thanks to authors

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

I got so lucky to guess the invariant in $$$G$$$! and then it was just a simple counting problem after that.

→ Reply
»
3 weeks ago, hide # |
← Rev. 4  
Vote: I like it 0 Vote: I do not like it

Bruhh

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

I really liked the problemset

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

Thanks for bringing to my attention the Egyptian Koshari dish, I will try!

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

is this contest easy or its just people with AI made the standard of this contest lower ? or am i noob ?

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

Very nice problems!

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

hello world

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

although I only solved A,B,C . it was a good contest ! hope I make it in the next few rounds ISA

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

Problem authors definitely made the hacking interesting this round. Having a lot of fun!

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

wonderful contest, fun problem without mind boggling math tricks and complex data structure.the best div3 and wish more nice contest like this

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

uhh how long would it take for changes in rating

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

It was a great contest!

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

great contest,but the sample explanation of C has some mistakes

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

In how much time will results get announced??

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

It was my first contest in almost a year , felt afetr solving 3 problems

Doubt: When will the rating change happen if at all there is?

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

Hi, this contest appears unrated in my profile, is it because of the C problem statement correction? Can anyone help me with this?

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

on no I missed it AGAAIINNN

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

I'm new here. Wanna ask if this competition doesn't have a rating, right? What should I play if I wanna improve my rating?

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

i did'nt got rating why this is my first contest

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

good experience

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

Hey, I just had given 4 contests and this was my 5th one, and I got a rating jump, while I think the contest must be unrated for me. Can anyone help me

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

    From the contest announcement:

    Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you (unless you register unrated).

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

I love this contest. ANd I got 370 ratings. And problems are very interesting and exciting for me. I love all.

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

Hello,

I received a warning that my solution is similar to others in this round.

I want to clarify that I solved the problem on my own during the contest. I did not copy any code or communicate with anyone.

My solution comes from my own understanding of the problem. I wrote the code from scratch and followed my usual way of solving problems.

I understand that similar solutions can happen, especially when the idea is common, but my work was completely independent.

If needed, I can explain my solution step by step.

Thank you.

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

Hi,

I received the plagiarism warning for my submission for problem G, and all of my submissions in the contest are marked skipped. I would like to clarify that I did not intentionally copy anyone’s solution. I solved the problem independently and had no intention of violating the contest rules.

Unfortunately, I do not have editor history or other proof saved that could clearly demonstrate my solving process. I understand the seriousness of this matter and respect the efforts taken to maintain fairness in contests.

I am not trying to argue with the system; I simply wanted to honestly state my side.

Thank you for your time.

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

good

→ Reply