postscript's blog

By postscript, history, 6 weeks ago, In English

Greetings Codeforces Community!

We invite you to participate in Code Ensemble, running this Wednesday, 19th August, from 9:00 pm — 11:30 pm IST. The contest is hosted by DotSlash Community of Indian Institute of Information Technology, Nagpur.

The contest features 7 problems of varying difficulty and is 2.5 hrs long. The contest is Rated for Div. 2 on Codechef. However, Division 1 users can participate unofficially in this contest. That is, Division 1 users will be able to submit in the contest, but will not feature in the Live ranklist, and nor will their rating be affected.

The problems in this round are prepared by Aman postscript Dwivedi, Arun qazz625 Das, Sarthak sarthak_eddy Shukla, Saurabh saurabhshadow Yadav.

Huge thanks to:

  • Jatin jtnydv25 Yadav for being the round coordinator on behalf of Codechef and also for an initial review of the problem ideas.
  • Jatin nagpaljatin1411 Nagpal for high-quality testing and valuable advices.
  • CodeChef Team for their invaluable help and great platform.

We hope u'll have an amazing time. Good Luck & Have Fun!!!

UPD: The contest time has been extended by 30 minutes, now the contest will last for 2 hours 30 minutes (21:00 — 23:30 IST)

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

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

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

»
6 weeks ago, # |
  Vote: I like it +2 Vote: I do not like it

people! this is exciting okay! cool period.

»
6 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

Finally the long wait is over. Excited for the round.

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

Another feather to the club...Excited

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

Do participate

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

Love the contests organised by the community. Eagerly waiting for this one too!!

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

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

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

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

»
5 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

Reminder: Contest starts in 15 minutes.

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

How to solve Priya and Parity?

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

    Just solve for odd and even components beforehand (answer_of_odd and answer_of_even )and at the time of query,

    if popcount(K) is odd : for odd print answer_of_even and for even print answer_of_odd else : reverse of above

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

      Thanks man :) But now I'm feeling so stupid :(

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

        Welcome , It happens quite often .. I was also stuck on third problem today which was extremely easy .

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

      Can you please tell why while creating adjacency list we need to check for equal number of set bits in both u and v? I saw many solutions , did everything same apart from that got WA.

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

        Its not equal but same pairity .. As mentioned in the question the connected subgraph must be reachable from each other node and if there is a different pairity it blocks the path and therefore disconnects it..

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

          A group of cities is said to be connected if we can go from one city of the group to any other city of the group without passing through any city that is not in the group. A group with one city is considered as connected. Are you referring to this?

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

            Yup

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

              thanks for help, I did not understand this statement clearly and could not solve this even after coding every other thing correctly. anyways, thanks!

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it -7 Vote: I do not like it

    Refer to editorial.

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

      Yeah .. quite fast editorial

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

      Please also share the editorial for Problem code B

      • »
        »
        »
        »
        5 weeks ago, # ^ |
        Rev. 2   Vote: I like it 0 Vote: I do not like it

        Will post the editorial by tomorrow. Sorry for the inconvenience, but problem B was not prepared on time.

      • »
        »
        »
        »
        5 weeks ago, # ^ |
        Rev. 2   Vote: I like it +23 Vote: I do not like it

        Almost Identical Problem

        Code
»
5 weeks ago, # |
  Vote: I like it +18 Vote: I do not like it

Cherry and Pyramid was much easier than it looks by the number of solve.

»
5 weeks ago, # |
  Vote: I like it -8 Vote: I do not like it

Enjoyed the contest ......how to solve Cherry and Bits, i tried in O(q*N) but time limit had been exceeded

»
5 weeks ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

Please find the editorials here. :) Edit — What the hell is the problem with the community. What is the reason of downvotes? Is it because of how a specialist made a question in contest or it's just the mentality that a specialist can't do anything?

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

please anyone explain, How to solve Traversing trees (I am not able to understand the editorial).