anup.kalbalia's blog

By anup.kalbalia, 11 years ago, In English

We hope you participated and enjoyed the changes made to monthly Long Contests.

From now on, we will also be having the problem statements available in Mandarin Chinese and Russian as well :) So invite Russian and Mandarin speaking friends to solve these problems.

As always, the long contests will start on first Friday of every month and last for 10 days. This ensures that two weekends are covered.

We bring you the CodeChef November 2013 Long Challenge. The November 2013 Algorithm Challenge is taking place on http://www.codechef.com/NOV13.

Here are the details:
Date: 1st November 2013 to 11th November 2013
Duration: 10 days
Problems: 9 binary problems of varying difficulty levels + 1 challenge problem.

Problem Setters:

Problem Testers: - Maubub(dragoon) - Tom Chen (WJMZBMR)

Editorialist: - Shaleen Sharma

Mandarin Translator: - Kojima Minako (xiaodao)

Russian Translators: - Roman Furko (furko) - Sergey Kulik (CherryTree)

It promises to deliver on an interesting set of algorithmic problems with prizes up for grabs.

The contest is open for all and those, who are interested, are requested to register in order to participate.

Check out the local time in your City/Time Zone here. Do share your feedback on what you feel about the new long contest format at feedback@codechef.com

Good Luck! Hope to see you participating.

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

»
11 years ago, # |
  Vote: I like it +11 Vote: I do not like it

The editorials are being updated here: http://discuss.codechef.com/tags/nov13/

The problems have been moved to the practice section. All submissions to the Challenge problem will be rejudged on the new test data soon.

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

The challenge problem turned out to cause quite a trolling :D with all but 5 contestants gettling a score lower than 0.001 and mugurelionut dominating it all :D

Well, I don't do the challenge problems as a matter of principle — all the effort I put in can go down the drain easily, and it can take a lot of time (which I truly lack).

I was surprised by 2 high-level problems being both on trees, though. I really hoped to solve at least one of them (it's the difference between 25. and 200. place), and I barely did it. I was debugging it last night and was thinking about dropping it if I kept getting WA or TLE, but I got AC on my first attempt after 3 hours of debugging :D

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

    I think it's a matter of rejudging taking place. At the moment tibip's solution has a score more than 10 times better than mugurelionut. So we should wait for all of them to be rejudged, but it's not clear when it's goingto happen.

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

      Oh, so the rejudging is still going... for quite a long time, even compared to the system test of Codeforces Round 207 (Div. 1) :D

      Anyway, it's always just few people with decent scores.