icpc_noone's blog

Worst Contest Ever (Conducted by IIITVadodra)
By icpc_noone, history, 13 days ago, In English

https://practice.geeksforgeeks.org/contest/code-clash-by-iiit-vadodara/leaderboard

This was the contest conducted today by IITV.

In this contest one question was Wrong and people get it accepted by hardcoding testcases.

Atleast they should first Test their questions for the conduct contest. Take some more time for preparation but should have questions which have correct solutions.(not hard coding testcase)

See Top 3 solutions they are all hardcoded. Ig this is not the way people do CP.

And all the Question were copied from GFG itself (except 3rd). You copied all the question and tried to add a new question but failed.

And after this contest contest they deleted their BLOG in which all the prizes were mentioned and all related stuffs. IT was waste of 3hours for all the people who gave the contest.

Will Winners still get prizes?? ( You should reconduct the contest but please make good contest this time )

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

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

Really the 3rd question was too bad

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

Real

→ Reply
»
13 days ago, # |
← Rev. 3   Vote: I like it +1 Vote: I do not like it
  • For second Don't know why when i submitted the code got wrong answer but running same code on custom input was getting correct answer. (10 10) was appearing at start and guess what 10 was not even the input array.
  • For third I checked both DSU + cycle still was getting WA(Is there something I missed).
  • For last question greedy would work? My dumb ass was stuck on bitmask DP after seeing the constraints(TLEs).
→ Reply
  • »
    »
    13 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    i did bitmask DP in 3rd

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

      We just needed to check if the graph forms a tree or not? or we can visit nodes more than one times? :)

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

        Yes we only have to check if graph is tree or not but their test cases are wrong.

        → Reply