sinhashubham95's blog

Invitation to Codezilla'17
By sinhashubham95, history, 7 years ago, In English

The ACM Students Chapter, BIT Mesra invites you to participate in Codezilla'17, an ACM ICPC style 3.5 hours team contest hosted at Codechef, as a part of Pantheon'17.

The top teams will be invited for the Onsite finals.
Hope you enjoy the problem set and have fun participating!
Happy Coding :)

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

»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

A gentle reminder, the contest is about to start.

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

Can you add problems to practice please?

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

Hey, we registered our team Phoenix under the name 'phoenixiiti' on the pantheon website because someother team had taken the name 'Phoenix' already.
Commenting to avoid any issues.

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

Hint for Lazer Tag?

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

    Iterate over every subset of all possible permutations of hitting mirrors and simulate the path that the laser will take using ray tracing.

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

The problems have been added in practice.

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

I'm guessing that in the problem Manufacturing Goods, the intended solution uses Min Cost Max Flow? However I noticed that a lot of teams have got AC with a simple greedy heuristic. Please check this and add stronger tests to the problem to fail such solutions.

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

    Hack for greedy solution?

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

      I have no idea, actually. Apologies if that solution is correct!

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

        For this problem, both the greedy solution and the min cost max flow solution were expected. There is no problem with the test cases as the greedy solution is absolutely fine.

        → Reply