NegativeElo's blog

Code Cauldron 2.0 Inter College Coding Competition (Prizes worth 8K INR)
By NegativeElo, history, 13 days ago, In English

Hello Everyone!

Coding Club NIT Silchar is back with Code Cauldron — Brew Your Code, the flagship event of our coding week, Townhall. So team up and get ready to cook up some intriguing solutions and munch on some tasty problems.

The coding competition is open to all undergraduate and dual degree programmers in India, although everyone is encouraged to participate in it. The contest will be based on ICPC guidelines. The top 3 teams will be eligible for prizes from a prize pool of 8K INR. There will be 8-9 problems, and you will be given 3 hours to solve them.

Rules:

  • A team of 2-3 members from the same college must participate in the contest.
  • An eligible individual may join only one team.
  • A team must be created in Codeforces composed of the members.
  • You should register for the contest using the formed team.
  • The team must also register using the link provided below. Not adhering to this requirement will make the team ineligible for winning prizes.

Contets Time: The round will be on 22nd April 2024 at 18:00 IST of duration 3:00 hrs.

Registration Link: https://forms.gle/Ny55RRtwwgU8WaFj7

Contest Link: https://codeforces.com/contestInvitation/1c56b1ba705d9b470690030c8644fd3182b7b097

The problems are written and prepared by Indrajit, jisangain, manikiran949, CipherSphinx_Raj, LikithReddy123, kanika119 and me (NegativeElo).

We would also like to thank :

And You for participating!

UPD1: The contest has been postponed to 22nd April due to clash with the CF round #940.

UPD2: Solution Files : https://github.com/Sids-03/Code-Cauldron-2.0/

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

»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by NegativeElo (previous revision, new revision, compare).

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

Excited

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

how hard would be this contest in terms of a codeforces contest?

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

Excited!

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

can we take participate in preliminary contest from bangladesh

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

It would clash with the upcoming Div 2 :/

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

Most Awaited contest!!

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

excited!! but yeah timing will clash with div2 contest

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

Is it possible to postpone the date of the contest?

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

Auto comment: topic has been updated by NegativeElo (previous revision, new revision, compare).

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

i am new for team contests. can you explain a little , how will it work ?? like we all 3 have to solve the questions in different systems or only one systems??

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

    You can attempt the contest from different systems ... Basically, there will be 9 problems, and your team will have 3 hours to solve as many as you can.

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

      ok got it . so how will you figure out , which team has solved how many questions?? if we use same system , its good... but if we uses different system , we all have different scores , u will never know the excat questions, if we solve in differ system and then copy paste to another one , will we get taken we codeforces , checker as cheating??

      how will u contact the winner teams?? like u only taking name not codeforces username.

      its just my opinion , u should create a whatsapp group or telegram group for results or annoucement discussion .

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

        You will have to make your team on codeforces and register as a team ... As for the identification everyone is asked to register with the team name that they have registered in the google form

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

Hope you like what my friends have cooked

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

I think You should have taken team members Codeforces profiles in the google form.. nvm

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

Why is Team Member 3 necessary to register through the Google form?

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

    Only teams of twos and threes are eligible for prizes, though all are welcome to participate. Team Member 3 is no longer necessary. Sorry for the trouble.

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

Excited

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

Excited for the contest

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

I want to give this contest, but stuck in a "chutiya" session

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

That's going to be awesome

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

Exciteddddd…

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

Is the desired complexity of D, $$$\mathcal{O}(Q \cdot \sqrt N)$$$ ?

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

    TC — $$$O( nlogn + q * ( n^{2/3} + sqrt(n) ))$$$

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

      Oh, I guess I overlooked the updates. 3D Mo's will do then.

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

Is it possible to check other's code or will there be an Editorial of this contest?

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

it was a good contest , i am just too dumb !is there going to be editorial ?

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

How to F2?

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

    Its DP

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

      What are the states ?

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

        You can check out the solution here https://github.com/Sids-03/Code-Cauldron-2.0/

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

          I did actually but i wasn't able to understand what he was doing. So please just mention the states so i can try on my own.

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

            $$$dp[i][m][j][k] =>$$$ currently at index $$$i$$$ ,have $$$m$$$ vaccines ,previous state $$$j$$$ and current state $$$k$$$

            $$$j$$$ is at most four because the grid has two rows ... corresponding 00,01,10,11 — 0 means uninfected, 1 means infected, the first bit means row 0, and the second bit means row 1

            In my implementation, $$$k$$$ is at most 5 ...

            $$$k=0->$$$ The construction of my previous states forces me to keep the current state 00, and then I transit accordingly.

            $$$k=1->$$$ The construction of my previous states forces me to keep the current state 01.

            $$$k=2->$$$ The construction of my previous states forces me to keep current state 10.

            $$$k=3->$$$ The construction of my previous states forces me to keep current state 11.

            $$$k=4->$$$ The construction of my previous states doesn't impose any restriction on current state, so I can indeed consider all the previous four cases for this state and transit accordingly.

            Although its possible to reduce some of the states here.

            → Reply