dalex's blog

By dalex, 5 weeks ago, translation, ,

Hi all,

This year in our programming competition in Samara (link) there was also an experimental contest with a marathon problem. You could face these problems at Marathon 24, Deadline 24, Google Hash Code, and recently at ICPC Challenge. It turned out Codeforces supports these problems, and this post is a tutorial how to prepare them. If MikeMirzayanov don't mention it, I'll do it.

Contest link: 2020, XIII Samara Regional Intercollegiate Programming Contest (marathon problem)
The duration of the onsite contest was 4 hours, so you can participate virtually and compare your results with onsite results:

Best onsite scores

So, how to prepare such problems and contests? Actually it is very easy. These are the differences from the standard problems:

• use function void quitp(double points, const std::string &message = "") or template<typename F> void quitp(F points, const char *format, ...) in checker.
 » 5 weeks ago, # |   +10 I think there is an upper limit on the score that we can provide in quitp. When we had tried to organize such a contest sometime ago, our checker kept crashing because the score was exceeding 10^7 or 10^8 (I don't remember). We couldn't think of a nice way to fix it, so we just scaled it down by a constant factor in the end.We also had mutliple test files, and it was summing all their scores up, so that is another possible contributor to the total score blowing up.