Ashishgup's blog

Codeforces Round #648 (Div. 2)
By Ashishgup, 5 years ago, In English

Hi everyone!

I would like to invite you to my fifth Codeforces Round, that I set with my friends FastestFinger, Vivek1998299 and ridbit10.

We are excited to bring another contest within a week :D

With that said, I bring to your attention our new Codeforces Round 648 (Div. 2) that will take place on Jun/07/2020 17:35 (Moscow time). If your rating is less than 2100, this round will be rated for you; otherwise, you can participate out of competition.

I would really like to thank:

You will be given 7 problems and 2 hours 15 minutes to solve them.

Good luck! :D

The scoring distribution will be: $$$500 - 750 - 1250 - 1500 - 2000 - 2500- 3000$$$

Upd: Quick Editorial — Hope you guys enjoyed the contest :D

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

Comments Comments (321)
| Write comment?
»
5 years ago, # |
  Vote: I like it +1173 Vote: I do not like it

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it +129 Vote: I do not like it

<tester's-comment>

As a tester, I found the problems diverse and very interesting to solve. I think this is will be a fun round for many. Participation is recommended :>

</tester's-comment>

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

    I second this, problems are genius

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

      Usually I would upvote the announcement after the round but this time I will take your word for it. Legendary lineup for problemsetters

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

      As someone who is neither a tester, author, coordinator, friend, or involved in the preparation of this contest at any level, I can confirm problems are genius.

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

        So I guess "genius" is a keyword!

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

        Monogon when will you host your next round?

        Your first round was genius, although it was destroyed due to long queues :(

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

may be the fastest scoring distribution ever

→ Reply
»
5 years ago, # |
← Rev. 3   Vote: I like it -94 Vote: I do not like it

Deleted

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

    Ah, shit. Here we go again.

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

      This blog is still not in home page, I wonder what happen after couple of hours :P Comment box will be flooded with those "proud" comments like previous round xd

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

      Ah shit. Here we go again!

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

        plagiarism detected :P

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

        Yes that level of spam will happen here xD

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

          Definitely, I think I will come back every few hours just to look at the comments lol XD

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

        Hahaha, honestly didn't notice this.
        I just thought it to be an appropriate meme to comment, so I did. :)
        Btw, why will I farm contribution even after this? :)

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

          I did not want to accuse you of plagiarism or contribution farming. All I was trying to say was, the recurrence of "Ah shit here we go again". aaargh. nevermind. All fun is lost when you have to explain the joke.

          → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it -9 Vote: I do not like it

      i dont know why but whenever i read this line anywhere Gta San Andreas music sound starts playing in mind

      → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it -49 Vote: I do not like it

    Seriously your dream was having 2 Indian rounds in a week ? Congratulation in that case.

    → Reply
»
5 years ago, # |
  Vote: I like it -78 Vote: I do not like it 
even Div. 1 participants should find some of the tasks interesting

If that is the case, why not take a div-1 round in parallel with 3 shared tasks (Div.2 C, D, E) ?

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

    They need to get Div1 D,E,F then. Which is not easy to make

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it -90 Vote: I do not like it

      They already have 7 problems. Both Div-2 and Div-1 would have 5 problems each with 3 shared.

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

        That fits the contest problem-count wise. But what u are asking for is making the last 3 problems of div2 (which authors think are fine for div2) to last 3 problems of div1. They obviously won't be difficult enough.

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

        I have solved C, D, E. I am not at that level so I can solve Div1ABC, so for Div1 this problem would be very easy.

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

          I regret saying what I said. He said the tasks would be interesting for Div-1 users so I thought that maybe they would be hard. Turns out it was a speedforces with an easy F..

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

Is it just me or are others too wondering where Ashishgup and friends have been during the last few months?

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

Was confused how did the comments from last Ashishgup's contest announcement changed only to find out it was a new contest XD

→ Reply
»
5 years ago, # |
  Vote: I like it +115 Vote: I do not like it 
even Div. 1 participants should find some of the tasks interesting

goodbye rating.

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

    But it will be tough for everyone so it should not affect your raking as it is relative, what was the point as if it is only tough for some, not all

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

I'm so tired and sleepy right now that I read it as..

You will be given 2 problems and 7 hours 15 minutes to solve them.

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

Why is this blog still not on the main page yet?

I want my daily dose of cringe (from the proud Indians in the comments) and i cant wait any longer!

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

    You're looking for quality cringe in the wrong place. Better search TikTok for quality cringe.

    → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it -71 Vote: I do not like it

    .

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

      Wait what? How does Ashish come into the picture? I am talking about the cringy Indian comments on his blog the last time around, and it has no relation with the points you are making.

      Improve your comprehension skills, and have the courage to put your name and college on your profile.

      PS — I am proud of Ashishgup on what he has achieved, being his wingmate and batchmate for 3 years and watching him grow was a pleasure. So sit down, online troll.

      → Reply
»
5 years ago, # |
  Vote: I like it -52 Vote: I do not like it

that C looks hard

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it +11 Vote: I do not like it

Thanks Ashishgup and Team For this effort.

→ Reply
»
5 years ago, # |
  Vote: I like it -15 Vote: I do not like it

We are also excited to see another contest within a week :D Thanks

→ Reply
»
5 years ago, # |
  Vote: I like it -35 Vote: I do not like it

I hope after the contest Ashishgup will be one the top ten contributors(as he has +155).

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it -102 Vote: I do not like it

[retracted]

→ Reply
»
5 years ago, # |
  Vote: I like it -94 Vote: I do not like it

Ashishgup be like : "yalgaar ho"

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

Does that score distribution mean that it will be a speed-forces? With an easy D?

→ Reply
»
5 years ago, # |
← Rev. 3   Vote: I like it +9 Vote: I do not like it

Eagerly waiting for the div 2 A. It was pretty nasty and amazing at the same time, the previous contest by the same authors.

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

Also this time we expect memetorials.

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it +38 Vote: I do not like it

CF-Community

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

"We are excited to bring another contest within a week :D" Cool.

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

Truly said — I become more excited when I see the score distribution like this way..

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

Is score distribution related to the rating of the problems ?

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

    Since you seem to be an old CF contestant, this question is a little bit of weird!

    → Reply
»
5 years ago, # |
  Vote: I like it -34 Vote: I do not like it

ohh god..once more contest prepared by[user:Ashishgup]...amaizing previous contest #646 ...does anyone remember "Guess The Maximums" problem ?... a very tricky one...hope to see more good problems this time also...

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it +37 Vote: I do not like it

Back to back Ashishgup rounds, nice :D. You are a nice motivation for me to prepare nice contests.

I'm so curios, how many hours a day you spent for your contest? And so, how many hours it took to prepare this one?

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

    Can i please test your next round?

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

      Hi! I estimate that it took us an average of $$$2$$$ hours per problem to come up with it, and roughly the same amount of time to prepare it on Polygon :)

      So around a total of $$$4$$$ hours per problem

      @Testing, sure! We'll invite you to test our next round :D

      → Reply
      • »
        »
        »
        »
        5 years ago, # ^ |
        ← Rev. 4   Vote: I like it +36 Vote: I do not like it

        Wow man, you guys have FastestFinger s, it took about 40hours for me to prepare my problems (probable because i checked everything 4-5 times at least). Thank you ^-^.

        → Reply
        • »
          »
          »
          »
          »
          5 years ago, # ^ |
          ← Rev. 2   Vote: I like it -16 Vote: I do not like it

          That's the case!!! You have to give good enough time to make balanced contest, with 2 hour you make E sillier than A,B.

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

          DeadlyCritic Hey man,

          Are we expecting a Div 2 round soon for the problems which you prepared?

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

Can somebody please tell me what information can we infer from the scoring distribution?

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it -44 Vote: I do not like it

Please make a contest like last time.

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

Namoosan vote up konid

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

MikeMirzayanov- I think you are about to add another standing to CF's home page called most hated users. — You know, every single comment of mine is disliked for at least 30 times by default — And also CF has blocked me from commenting twice :) — However I'm too polite :/

→ Reply
»
5 years ago, # |
  Vote: I like it -454 Vote: I do not like it

6 years back a visionary leader by the name of Honorable Narendra Modi democratically became the prime minister of the world's biggest democracy. His vision of Digital India to transform India into a digitally empowered society has certainly lead us to this proud moment where an Indian becomes the first person to hold 2 rounds within a week. Certainly its a proud moment for all the Indians on codeforces today. So excited...Jai Hind !!!

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

    Just Shut up.

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

    As a fellow Indian, I request you to pls stop posting cringe content on CF. It only degrades everyone's opinion about us

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

    This was cringy af.. to the next level..

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it -44 Vote: I do not like it

      I'll take that as a complement.

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

        Indeed. The best thing a quality cringe provides is the firm belief in itself. You embrace it and take everything said to as a compliment. Thanks for THAT quality of cringe. Now I'll make myself believe that I indeed gave you a compliment and then replied with a greater cringe just to show you what cringe of the first water can do to someone. No Offense.

        P.S. I think I failed with the quality of cringe but nvm.

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

          Wow, I didn't get that but I liked that.

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

            Wow, I didn't get that but I liked that.

            I feel the exact same when I read the explanation and code of some F or G.

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

              Lol. I'll suggest writing down an array and trying the shifting operations. Understanding how it can be done in 3n/2 operations is definitely difficult, rather first try to understand if it can be done. For G, initially don't think much about what a submask/mask is (those words are heavy and intimidating for me too). Just try to think about what bits are different. In the last part, they have said about using 6 bits, which might further intimidate you. But if the explanation were to be more complete, it isn't that difficult to understand. The reason is that there are 13C6 numbers which have 6 bits on and no two could be submask of each (note that the submask thing is necessary only for the second approach, not for the suboptimal one).

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

                Welp.. I think u took it too far.. But thanks tho.. ur explanation is GREAT and I'm looking forward to solve that question with this. (y) Cheers mate!!

                But what I meant there was just an analogy to SOME F and G :)

                Have a good time. X

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

        .

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

    Cringe on CP platform is just something to be cherished. Cannot find it anywhere else!

    → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it +13 Vote: I do not like it

    we dont't do andh-bhakti here....(Indians can relate)

    → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it -12 Vote: I do not like it

    Damn. The bhakti is strong af. Never knew we had middle-aged Indian uncles joining CF.

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

      Never knew we had dumb kids who cant understand sarcasm joining CF.

      → Reply
»
5 years ago, # |
  Vote: I like it -13 Vote: I do not like it

Nice Score distribution .

→ Reply
»
5 years ago, # |
  Vote: I like it -54 Vote: I do not like it

Excited for the Indian Round!!

→ Reply
»
5 years ago, # |
  Vote: I like it -6 Vote: I do not like it

The scoring distribution makes me happy and afraid at the same time!

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

Contests of Ashishgup always offer really good graph problems!

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

Ashishgup is now in top 10. Great!

→ Reply
»
5 years ago, # |
← Rev. 3   Vote: I like it -11 Vote: I do not like it

Is there something wrong with problem's div1D checker? I got AC, but when i look at test logs i see stuff like this in several tests

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it -9 Vote: I do not like it

    82738980 -> link to my submission

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

    It's okay. The relative error, which is $$$|1 - \frac{pa}{ja}|$$$, where $$$pa$$$ is the participant's answer and $$$ja$$$ is the jury's answer, is indeed less than $$$10^{-6}$$$.

    → Reply
»
5 years ago, # |
← Rev. 4   Vote: I like it -45 Vote: I do not like it

[DELETED]

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

→ Reply
»
5 years ago, # |
← Rev. 3   Vote: I like it -13 Vote: I do not like it

Untitled

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it +36 Vote: I do not like it

That's a truth...

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

Congratulations to Ashishgup.I think you are first Indian to be in top 10 in contributors in code forces.

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

    Not the first time for him.
    He was among top 10 contributors ~19 months ago.

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

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

    Шутка смешная, а ситуация страшная.

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

How is contribution calculated , i mean Ashishgup has +162 and BledDest has +126 ,But BledDest has authored many contents than Ashishgup

→ Reply
»
5 years ago, # |
  Vote: I like it -38 Vote: I do not like it

is it rated?

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

Is it only me who feels that 1st question is comparatively difficult to other Div2 contests when there are Indian setters!

→ Reply
»
5 years ago, # |
  Vote: I like it -30 Vote: I do not like it

Hello, MikeMirzayanov my net connection got lost. So, I can't compete now fluently. Moreover, I have submitted A and B. Please make the round unrated for me

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

    What you want ,, Actually not possible .. Many people also face this problem regular .

    → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it +17 Vote: I do not like it

    "Hello, MikeMirzayanov,my girlfriend broke up with me in the middle of the contest.So,I couldn't concentrate. Morever,I have submitted A.Please make the round unrated for me."

    If he replies,please forward my message too.

    → Reply
»
5 years ago, # |
  Vote: I like it -140 Vote: I do not like it

Ashishgup you should stop making contest. Your constest aren't good at all. It contains very weird questions. Please codeforces don't let your status go down because of them. Many people registered for the contest but a lot of them just backed off. This is sad. Your Div 2 problems are interesting but it doesn't qualify for the real contest maybe a unrated one (practice round) would be better. :)

→ Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it +49 Vote: I do not like it

    Div. 2 contests are targeted towards somewhat experienced programmers. If you feel like div. 2 is too hard for you, there's no shame in starting off in a lower division. I recommend participating in the division you can comfortably solve at least 2 problems during a contest (if you want some challenge) or the lowest division that is still rated for you.

    Regarding practice contests, you can always participate in old contests virtually (basically a simulation of the real contest) or just solve old problems until you feel like you are ready to take on div. 2.

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

      I am seeing Experts with 1800 rating and CMs not being able to solve A in my friends list. While the entire contest may be good, A is certainly overkill for a div2.

      Personally, I have not been able to solve a single question till now. While I cannot claim to be good at CP, I have generally been able to solve AB in div2 at least.

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

        A is not overkill. its just difficult and require more logical thinking than other As. What is the point if all the Div2 As are cakewalks ?? sometimes its refreshing to see questions which are just not speed test and requires you to think for some time.

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

        Sorry, but contest was too easy for div2, i think it's div3 level. if u cant solve so easy problems u should just practice a much better

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

Hi!

Unfortunately, CF-Predictor may not be able to handle as many contestants/users as we have today. I have an idea for the optimization that should resolve the issue, but

  1. I need time to implement it.
  2. I'm not 100% sure it'll help (because I'm using a free heroku account and it has bunch of limitations).

If the extension or usual website (http://cf-predictor-frontend.herokuapp.com/) go down today, feel free to use another replica

→ Reply
»
5 years ago, # |
  Vote: I like it -36 Vote: I do not like it

This round sucks!!!

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

Wired Contest. I can solve ACDEF, but just can't solve B.

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

This round will teach most of the new comers that logical thinking is the first step in competitive programming, not the knowledge of all the data structures and algorithms. The first thing you need to develop is logical thinking. The one contest comes where you need to think instead of use some tricks or data structures, do not complain about the lack of it. Logical reasoning and thinking is an important part and should be treated at such.

Also the problem difficulty is increasing uniformly, which has somewhat become rare in recent contests. Kudos to setters !

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it +4 Vote: I do not like it

.

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

Can someone tell me whats wrong with following logic for D ?

I take count of bad and good and if good person are zero, answer is always yes.
If bad persons are zero, check if all good can reach the end or not.

Now I check if any Bad person has a good person immediately next to him. If yes, then they cannot be blocked and answer would be No. If all the bad persons can be blocked, I block them and then check if all the remaining good persons can reach the end or not.

Any idea what I can be missing ??

→ Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it -6 Vote: I do not like it

    WRONG EXAMPLE

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

      This is an invalid example, because the statement says 'It is guaranteed that the cell (n,m) is empty'

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

    Yes thats what I also did and it passed pretest. I block by putting wall on 4 side of B.

    → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 3   Vote: I like it +13 Vote: I do not like it

    Your idea is right but you did something wrong on implementation.

    dx should be {0,0,1,-1}.

    ll dx[] ={0,0,1,1};
ll dy[] ={1,-1,0,0};
    → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You have to block all neighbours of bad persons also. This is clearly necessary, and we can prove it is sufficient.

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

    Maybe you made the same mistake I did. I didn't notice that if a cell has a bad person then you can't block that cell.

    → Reply
»
5 years ago, # |
  Vote: I like it -28 Vote: I do not like it

After E:

→ Reply
»
5 years ago, # |
← Rev. 4   Vote: I like it 0 Vote: I do not like it

.

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

After knowing E solution:

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

How to solve E??? I know maybe it uses greedy strategy, I tried something with choosing numbers with highest bit set and then choosing atmost 2 more, just random submission. So someone give a subtle clue please!

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

    Just choose maximum or between 3 vals.

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

    There always exist an optimal solution with $$$k <= 3$$$

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

    $$$n = 1$$$, ans = $$$a[0]$$$.
    $$$n = 2$$$, ans = $$$a[0]$$$ | $$$a[1]$$$.
    else ans is triplet with maximum or.

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

      Can you show example when we need triplet, not just maximum element?

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

        If I understood you correctly.

        3

        1 2 4

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

          Oh, maybe I misunderstood the question. What output will be for this example?

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

            Should be 7 which is the OR of the 3 numbers.

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

              But we can just take the k = 1 and sequence {4} for this example, and we get the same answer, no?

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

                I think you misunderstood the question. If we take just the 4 answer will be 4.

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

        In the case of 3 numbers with "independent" bits, like $$$2^0$$$, $$$2^1$$$, $$$2^2$$$ it is optimal to choose all 3.

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

      How to find the triplet with maximum or?

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

        Brute force, O(n^3)

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

          Umm, then I want to die.

          This don't pass.

          Spoiler
          → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +19 Vote: I do not like it

    the best way to make a set is using K=3 or 2 or 1:

    if u choose 3 number and trying choose 4th number to change anything, 1st 2nd or 3rd must constain some bit that u find in 4th number. but u already have this bit, so u dont need k > 3

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

      Oh my god I was thinking about that max(1, k-2) condition and choosing 3 but thought $$$n^3$$$ wont pass. Maybe it can be done in $$$O(n^2)$$$ but I get your point, nicely said.

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

        O(N^3) will pass

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

          Mine did not :thinking:

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

            I looked at your code, you should simply have used or operator | rather than looping over 60 or so bits! I guess that lead to TLE.

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

          Oh yes you are correct I calculated operations as $$$500^3 \times 64$$$ (64 for the bits of numbers) but I think its not like that

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

        to don't get this mistake again u can calculate time of work (kinda), if u have n'3 with n = 500, code will make 1,25 * 10^8 operations. we have very weak operations and c++ can make 4 * 10^8 of weak operations (if u use pragma u can reach 10^10 op.). c++ can make 10^8 of big(idk how say it) operations (like n log of segment tree). => u code will pass the pretest in this problem

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

      why is this true?

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

What is the solution for G?

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

any hints for A and B?

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

    For A
    take all the rows and columns which are all zeros.
    now whenever you make a move, one row and one column is reduced. so the max number of moves possible are minimum number of available rows or columns. That numbers decides who wins the game.

    For B
    If there is atleast 1 element with b_i 0 and 1, you can always sort the array. Other wise check if it is already sorted or not.

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

      Can you sort this test case by your approach ? 3 2 1 0 1 1

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

        Swap 3 and 1 since they both have different b_i values.

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

The worst round i've ever seen. ABEF — is like A, but many participants can't solve just because it's E,F and can't be so stupid. ABEF is much easier than CD (bcs here u need some brain)

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

    Exactly!!! Again disappointed with this guy!

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

    I solved C faster than A and B. But got stuck in E, was not able to see the simplicity.

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

I got two WA in A and one in D -_-

Nice problems!

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

May be Fastest Editorial overall ..Thanks

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

Took me 6 attempts to realize.. Just one dfs call was required in D. facepalm

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

Great round! Excellent variety of problems. Finally doesn't look like mathforces/bitforces and real algorithmic round.

→ Reply
»
5 years ago, # |
  Vote: I like it -17 Vote: I do not like it

Though I did not give this contest I can tell that this is the best div2 round ever.Ashishgup orz

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

Whats-App-Image-2020-06-07-at-1-03-53-AM

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

Definitely one of the best rounds I have ever participated. I really enjoy these problems which emphasize the process of thinking and proving special properties, instead of the boring implementationforces.

→ Reply
»
5 years ago, # |
  Vote: I like it -12 Vote: I do not like it

F was so easy for me, and was a 2-liner, why was it kept before E? I would've got F much earlier but I couldn't get E and so went on to G as it was interactive, and read F only at the end of the contest. So unlucky :(

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

WTF was testcase 38 in F?

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

    I think in that we needed to check that array a and b are actually permutation of each other, i.e. no extra element is present.

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

    My solution also failed at test 38. I was using a set. Got AC by changing it to multiset

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

      that's what I suggested in comment above from 6 hours before your :-)

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

Was G something like there are only 63 elements we care about at most so pick random subset of half the remaining elements to narrow down where it could be? Only other idea I had was parallel binary search but couldn’t narrow down past 20 queries with this

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

    Yep, i guess it should work, i was trying to code it but unfortunately i couldn't come up with a good implementation, so i ended up with half of a spaghetti-code.

    → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 3   Vote: I like it +3 Vote: I do not like it
    This solution for G is wrong
    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it +5 Vote: I do not like it

      Right this is the parallel binary search I mentioned. I actually don’t think you can do better than 20 queries with this method, but I could be wrong. One way to describe your queries is that the i’th query contains all elements with the i’th bit set to 0. I think the problem is that you only get information for the entries that you didn’t query. So if the first element has a lot of unique bits then they won’t be detected ever, I believe. So I think it is possible to create some adversarial cases that force you to use more queries. You might be able to prevent this through randomization, but not entirely sure.

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

        You are right, other entries can mess with answer, thanks for finding the mistake

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

Whats-App-Image-2020-06-07-at-1-01-35-AM

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

Nice contest. I enjoyed solving all :p

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

Hey nice problems, thanks!

But one suggestion. In A text goes like "...and does not share a row or column with any...".

The usual wording is more like "Does not have a row or col in common". The word "share" is most of the times used to denote borders of cells next to each other. Since as a problem that would make sense, too, it is missunderstandable.

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

    Guess who wasted 1 hour interpreting the question like that?

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

    My whole contest got fucked up due to that. It mislead me that they do not share a common edge. Now i realised he means that cell(i.j) can be occupied if and only if ith row and jth column is unoccupied.

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

      And the edge problem is much harder... ;)

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

      You can always ask the problem setters to clarify during the contest.

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

        I you missunderstand something you can not ask, because you do not know that you did missunderstand it.

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

        Bro how can i know if i would have known i could have solved other way around. I know about this feature i knew if after i read editorial.

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

    Both phrases are synonyms of each other. It is mathematically correct to use either.

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

How do you downvote an announcement after upvoting it :-/

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

I really liked the problems, nice job Ashishgup, indeed it was never a normal div2 round, i think they were very nice for IQ/creativity test. They were like problems in first round of Computing Olympiads in Iran, but indeed they were way harder. Thank you all(authors, coordinator and etc) for such nice problems.

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

    Statement of A could have been more clear else i like the contest

    → Reply
»
5 years ago, # |
  Vote: I like it -13 Vote: I do not like it

After a lot of wrong answers,the pretest passed in last 12 seconds for D xD

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

may be swap(A,B) better ..i think B is more easy than A.. :3

→ Reply
»
5 years ago, # |
  Vote: I like it -17 Vote: I do not like it

Adhoc Forces How to downvote an announcement please say

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

    Observation Forces I'd say

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it -31 Vote: I do not like it

      Ya every problem involving a lot of observation Observational Problems till A and B are OK but when C and D and E involve it then it becomes shit ,hope setters in fututre will keep it in mind!

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

        The what, so all div1 contests are shit because their DEF div1s usually involve a lot of observations and that should only be limited to AB div 2s instead?

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

Can anyone explain E for test case 2 1 1 4 1 8 how can we get 14 , if i take both 2 and 8 there will be 3 ones which don't have their 2nd and 4th bit-set so how is the condition "at least max(1,k−2) (max(6-2,1)=4) elements of the subsequence have the i-th bit set in their binary representation" is satisfied for the 2nd and 4th bit?pls explain

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

    choose the triplet $$$2$$$ $$$4$$$ $$$8$$$.
    0010
    0100
    1000
    bits with i = 1, 2, 3 can be taken since they have atleast a one in their binary representation and since k = 3, we need atleast just 1 bit so our answer will be 14.

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

    Take 8, 4 and 2. Then k = 3.

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

    k is the length of the chosen subsequence (k = 3), the length of the main sequence is n (n = 6).

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

Nice problems! Sorry to bother, but could someone please help me understand why I got a runtime error on prob A pretest 1 82790397? I see nothing wrong with it, also it runs fine compiled on my machine. I ended up rewriting the code in python to make it work. Thanks

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

    I think it should've been "col(m), row(n)" instead of "col(n), row(m)".

    (Since vectors reserve a bit more space than you asked for to allow amortized O(1) pushback, making this mistake doesn't necessarily cause a Run Error (I think), that could be why it worked on your machine but not on the server.)

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

      ... aaaand you are right. Embarrassing mistake. Thanks a lot for checking!!!

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

Problem E i submitted it using DP with 500*3 instead of BF (500)^3 but it gave me WA on TEST 6 can anyone explain please the code

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

Nice problems but I feel like the difficulties (from problem to problem) could have increased a bit faster — with such small increases it felt more like Div. 3 to me (that is, more stressful than Div. 2 due to needing to solve more problems to stay in the "positive rating change"-range).

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

Problem D video editorial: sOlUtiOn

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

My idea for the solution to D is check if the bad guys can reach the end, if yes, then block all the neighbouring cells. Then check if all good guys can reach the end. Why does this fail on pretest 7?

Link to my submission : https://codeforces.net/contest/1365/submission/82872417

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

    If there is a bad guy in a neighbour of the destination cell, then your code is blocking the destination cell. In such cases, if there is a good guy in a cell reachable from the destination cell, the answer should be "No", but you code prints "Yes". See this case for example: 

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

      There's a typo in my code. That's why it fails. But for your case the answer is YES right? because you can build a wall above and below the bad guy.

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

        Yes, for this test case answer should be Yes.

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

A request to future problem-setters, please try to break a long sentence into several sentences. For example this one:

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

    Yep for the first 20 mins I was like I need to do summation of 2^i for each element or essentially the sum

    → Reply
»
5 years ago, # |
← Rev. 3   Vote: I like it -40 Vote: I do not like it

The whole contest gets ruined if the first problem does not go as planned and the statement was quite misleading. I solved the whole time considering border should not be shared for each cell. Even any announcement was also not made to clarify the statement. Is it enough reason to make round unrated as a lot of participant wasted a lot of time on this which was rather a very easy problem ? PS — I completely understood the problem only after reading editorial otherwise it was a mystery to me.

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

    There was nothing misleading in the statement. It was written that you can only claim cells which do not share a row or column with any already claimed cells.

    There was no announcement, because there was no need of an announcement.

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

C-Constructive

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

Does failing on sample tests counts for penalty??

If not then for me, It's showing 3 penalties even though one of the wrong attempt is wrong answer on pretest 3 (last sample case)

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

No hacks at all in this contest O_o

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

Ashishgup contest exist !

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

For those who didn't solve, you just had to go through all the possible triples (x, y, z) and look at the maximum among x | y | z.

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

I hope for a div. 3 round before the next educational one or in place of it. Anyone agree with me?

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

Very nice problems and strong tests, congratulations!

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

To not keep you waiting, the ratings updated preliminarily. In a few hours, I will remove the cheaters, fix wrong division cases and update ratings them again!

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

Any idea why i am getting TLE on this? It is the same idea as in the official solution...

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

    For every 'G' you are Calling bfs i.e. at max n^2 times. But what you should be doing is calling bfs one time from the final cell and count how many 'G' can be reached from there.

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

      yah..figured it out afterwards.. thanks anyways.. but btw i could run bfs from every g if i would use dsu :)

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

    I think u have the same problem that I had on contest. You have to mark cells you were and don't start bfs from all good persons "G" (if you elier were in this cell "G" and you could arrived to cell (n, m) you don't should to check this again).

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

      yah... this is one way to optimize.but it is not optimal i will implement tomorrow both dsu and bfs from (n,m) :))

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

Can anyone tell me why my code gets "Memory limit exceeded on test case 8". I first mark walls around 'B', if there is a 'G' sharing a side with 'B' code outputs 'No'. Then do a reverse traversal from destination (n-1,m-1) using bfs and mark all reachable nodes. If a node is 'G' and not reachable i output 'No' else 'Yes'.

Link to my submission — https://codeforces.net/contest/1365/submission/82880705

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

_Nice problem set.I hope everybody enjoy this round _

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

Enjoyed the contest, thanks!

Of the problems I worked on: A, C, D were very good. I did not like B. In general I hate these problems with one-line solutions. Anyone else?

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

Isn't it allowed to hack a solution after the end of contest? When I click on hack it! The page shows "You can not hack the submission".

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

can anyone help me with why my algo for prob E is wrong-

we need to take only 3 elements to maximize the value, so for first element we will take the maximum one as it will give the best result,now we need to care about all the unset bits of the first element as the set bits will be set in our final answer too, so we change the rest of the numbers of the array such that for any number in the array, at position i if it is set in our choosen first element and it is also set in the number of the array we unset it.

In this way we will get an array which will be devoid of all the set bits of first choosen element then from that array we can again take the maximum element as it will be the biggest contributor, again we can do the same operation to take the third element.

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

@Ashishgup

Test cases for F is not strong enough.

I believed I hacked some AC submissions using this data set. Obviously the right answer is No, but they all returned Yes.

1 3 8 9 8 9 8 9

Submissions:

https://codeforces.net/contest/1365/submission/82823958 https://codeforces.net/contest/1365/submission/82854157

→ Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 3   Vote: I like it +13 Vote: I do not like it

    I remember as a master you can hack other's solutions after contest.

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

      I tried and the verdict is the inconclusive "Unexpected verdict" :-)

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

    Became Candidate Master. Wait! that may have already vanished while you are reading this or soon going to be.
    Solved 6 questions. Pretests passed. Not celebrated, as I miss corner cases many times :|.
    System testing passed! Still waited for rating updates.
    With gain of 93 points, became Candidate Master for the first time. Celebrated hard!!
    Now, I came to know that I missed a test case, which was probably missed by author too.
    Tragedy!!
    That's fine, I'll try my best next time! ;D
    At last, good questions. Kudos to the setters and also to the one who pointed out the mistake!

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

      Likely you will be fine. This is an "uphack" so history won't be rewritten. Best of luck!

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

greedyforces

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

For problem D, something seems wrong with the judge. The solution that I submitted shows few accepted test cases(as it eventually gives a TLE). However, those test cases should also not pass as the output of my code is completely different.

Judge — https://codeforces.net/contest/1365/submission/82901062
Ideone:
- Test Case 3 — https://ideone.com/Rfss7o
- Test Case 4 — https://ideone.com/heJHCG

Can someone help me in understanding is something actually wrong, or it is just me.

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

    Can you explain what type of difference you have noticed?

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

    Input data is not enough. You can see that the three dots at the end are not part of the input.

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

      Sorry, I didn't pay enough attention. I thought dots are the last line of the input(since dots represent blank spaces).

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

Anyone solved E by DP ?

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

    I tried but stuck in time limit that its is taking O(n^3*64) which is not acceptable

    My idea is store dp[i][j][k] where the i is index that till ith index what is the maximum value of length j and for the corresponding bit k.

    But this is 64 times more slower for this problem

    → Reply
»
5 years ago, # |
  Vote: I like it -68 Vote: I do not like it

Hope you guys enjoyed the contest :D

Ashishgup are you an ididot or what

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

Problems are really enjoyable to solve

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

Is it just me or does anyone else also feel that problem C is the new B and Problem D is the new C in the recent rounds?

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

It's enjoyable round.But,I couldn't solve any of this :( Will try next to do more better :) Anw,Should i learn C++ or keep going with python3?

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

    This round, I did everything in Python 3 except E. Last round, Python 3 was too slow for A which really messed me up (I could have just translated it to C++, but I was too stubborn).

    If you don't know C++ yet, it never hurts to learn. But use the right tool for the right job: if time limits aren't tight, a package like itertools can save you a lot of programming time.

    → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it +1 Vote: I do not like it

    Learn C++ and quit python as early as possible.

    You might not understand why I say so and python might seem very easy to code rn but you will sure face difficulties (like recursion limit in python or TLE with same logic that gets accepted in cpp) as you continue to grow. Although you can get it accepted in python as well but it becomes very troublesome and requires some extra effort. Also, there are some questions with zero accepted solution in python. I wrote the same logic in cpp and it worked but no one could get it accepted in python because of TLE.

    So, why not just write in cpp and avoid many issues. Speaking from personal experience. Good luck :)

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

      I agree with your points, see I have only used Python till now in contests but now I am converting myself into CPP bcoz it's the best tool for Competitive programming. My strategy in contests is to use Python for constant time or linear time algorithms and switch to CPP for tree and graph-based problems.

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

D solved using dsu (disjoint set union) if anyone needs it : SoLuTiOn

→ Reply