pa.n.ik's blog

By pa.n.ik, history, 9 months ago, In English,

Hello, CodeForces community,

UPDATE All Individuals having rank less than equal to 364 have been selected for onsite enigma round. They would be contacted soon. If you do not receive a call feel free to contact Nikhil Gogia — 8529832077 or Vishesh Sharma 7073901183 This cut-off is tentative. It may increase depending on the reponses.

Tired of searching for the perfect teammates in every competition? Want to prove your worth as a solo coder? Looking for the perfect platform to display your skills?

This solo coding competition is designed for the masterminds who think they perform best alone.

Interested? Wanna find out more about it? No Problem! Plinth in association with Aavas Financiers Limited has a rated contest on CodeChef waiting just for you!

The contest shall be a great opportunity for students to test their programming aptitude. This national level programming contest shall assess the intelligence of participants through various rounds. It is an Online Qualifier Round for the Onsite Round to be held during Plinth'19.

There will be 2 rounds to decide the winner:

  1. First Round: Online Qualifier for onsite will be held on 10th January 2019 on Codechef which is a rated round(Div1+Div2).

  2. Second Round: Onsite round will be held at The LNM Institute of Information Technology, Jaipur on 20th January. More details will be announced later.

The Contest details of Enigma'19 are as follows:
- Contest duration will be 3 hours.
- Solo Coding Event
- Start time: 10th January 2019, 21:00 hrs IST
- End time: 11th January 2019, 00:00 hrs IST

Contest Link: Click Here

Prizes:
For Online Qualifier:
For Indian participants:
Top 10 from ranklist will receive 300 laddus.
Additionally, they get bonus laddus (Bonus = n — contest rank) where 'n' is 11 for short contests.
For Global Participants:
Top 10 from ranklist will receive 300 laddus.
Additionally, they get bonus (Bonus = n — contest rank) where 'n' is 11 for short contests.
For Combined Participants:
Random Laddus to any 5 users: 200 laddus.
First to solve each problem individually: 100 laddus.
Country wise participation: Top 10, 20 and 30 will get 30, 40 and 50 laddus as per participation.
Country wise performance: 200, 250,300 laddus as per performance.
For Onsite Round, Cash Prize worth 20,000 INR and Goodies powered by CodeChef and Github worth 15000 INR. Total Worth 35,000 INR.

Problem Setter: xodiac pa.n.ik aditya10 titan_12

Good luck and have fun!

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

»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Please change the end date it's written 7th Jan

»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Don't Forget to register for the event so as to be eligible for Getting Selected in Enigma Onsite Round. Registration link: Click Here Hope you Find the problem Set to be Challenging enough.

»
9 months ago, # |
  Vote: I like it +4 Vote: I do not like it

killjee and rhezo used to make the previous editions, right?

»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

cutoff can be clear.

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

    cutoff rank will be declared after the contest. It depends on the no. of participants agreeing to come to onsite.

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

      but the number of seats may be clear.

      • »
        »
        »
        »
        9 months ago, # ^ |
          Vote: I like it +6 Vote: I do not like it

        200

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

          ok, thanks. It means top 200 from registered user get qualified for the onsite round.

»
9 months ago, # |
  Vote: I like it -8 Vote: I do not like it

Contest starts in 35 minutes . Good luck .

»
9 months ago, # |
  Vote: I like it +13 Vote: I do not like it

Do let us know your Feedback about the Problem Set. Editorials will uploaded by tommorw 6pm on codechef Forum. Happy Coding!

»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

So, Have you people decided the cutoff rank yet???

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

    We would be personally calling the teams selected, I hope you have filled the registration form.

»
9 months ago, # |
Rev. 2   Vote: I like it +3 Vote: I do not like it

Can anyone help in problem GARGOYLE. I have done same thing as mentioned in editorial but still gets wrong answer. I am not able to find the bug. Submission

  • »
    »
    9 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    I believe it's the same mistake I made initially. Your ans is set to 1. It should be 0, because if no one agrees with anyone, no one is speaking the truth

    • »
      »
      »
      9 months ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      Mindjolt I did the same as mentioned in the editorial. Also, I've set the answer equal to 0, still getting a WA. LINK TO MY SOLUTION

      PLUS The Tester's solution mentioned in the editorial, is also getting WA.

      pa.n.ik Eagerly waiting to know the mistake, as if there is any, it is seriously a very nice problem.

      • »
        »
        »
        »
        9 months ago, # ^ |
          Vote: I like it +3 Vote: I do not like it

        Sorry I attached the wrong solution of the tester, the link has been updated please have a look

  • »
    »
    9 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    set ans =0

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

      pa.n.ik What about my solution then?

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

        Actually I am not a c++ coder, so I am having trouble decoding it. I have notified my team memeber, we are on it and would let you know by today.

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

          Test Case: 4 T T F T T T F F F F T T F F T T Answer should be 2.

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

            And that is what the answer is 2;

            link

            Don't tell me you entered this test case in just one line as in your comment. :P

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

        Getline function is not working properly.Try to avoid it.

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

          Getline function is not a problem here. I don't think there is any problem now.

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

    Can I please get link to editorials ? I am not able to find them. They are not attached with the problems and the link is not available on contest page.

»
9 months ago, # |
  Vote: I like it +3 Vote: I do not like it

When will the onsite qualifiers be announced?

»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Everyone interested in knowing the cutoff, Just make sure you have filled the registration form.

»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

For the Codeforce community I have one bonus question. I hope you have read the question NINENINE if not, here is the link : https://www.codechef.com/PELT2019/problems/NINENINE

Bonus question: What if I remove the statement that the graph must be connected at each step and replace it with that the final graph should be connected which means that the graph can disconnect during deletion but later during insertion has to become connected again. Personally, I was not able to find a solution to this question. Let's discuss this in the comment section. I would seriously like to know the solution to this problem.

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

    grumpy_gordon step_by_step since you guys were able to solve NINENINE, try this question

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

    Built bridge tree and use dsu on trees on bridge tree to find answer for bridges.

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

      Sorry I was not able to understand your solution, can you please explain a bit more.

      • »
        »
        »
        »
        9 months ago, # ^ |
          Vote: I like it +6 Vote: I do not like it

        Build bridge tree. Now you should put edge from subtree of bridge removed to other component. For that we need degree counts in that subtree and other side. If we have these degree counts it's O(1) per bridge. To maintain these degree counts we need to use small to large trick(dsu on tree) . Also here each vertex of bridge tree is weighted with number of vertices of original graph in it. So subtree size here means sum of wts of vertices. And for the other case of non bridges , it is same as the original question.

        When we saw this question. We felt sad because it was very good without that constraint.

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

        Also since I do not see the editorial for the last problem. Is it sqrt decomp + dynamic convez hull + treap(I think treap can be get rid by using an offline solution).

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

          Hi, tejas thanks for the solution. Yeah I know that this was a good question, but was not able to think of this solution. Hey all the solution were uploaded yesterday. search for PELT2019 for finding all the editorials.

»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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