steven.novaryo's blog

COMPFEST 14 Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)
By steven.novaryo, history, 2 years ago, In English

logo

Hello, Codeforces! 🤗

We are happy to invite you to participate in COMPFEST 14 Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) on . COMPFEST is a national ICPC-style contest for university students in Indonesia.

The problems are written and prepared by Pyqe, steven.novaryo, Nyse, muhammadhasan01, gansixeneh, nandonathaniel, FerdiHS, TakeMe, and NeoZap.

We would also like to thank:

  • KAN for helping to host the mirror round;
  • rama_pang (rama_pang, yz_, Berted), pengzoo (DishonoredRighteous, golikovnik), bukanYohandi, bry_rp, Drew_, and david.alexander01 for testing the contest and providing us very useful feedback;
  • Universitas Indonesia, all the local committees, administrators, and managers of the whole COMPFEST event;
  • prabowo for existing;
  • fushar for the Judgels platform used in the official contest; and finally
  • MikeMirzayanov for the amazing Codeforces and Polygon platform!
  • Extra thanks for Pyqe for the dedication and effort 💪 in COMPFEST 14, as without him, the contest would not exist.

The contest will last for 5 hours and consist of 13 problems. While it is preferred to participate in a team, individual participation is also allowed. The problems themselves are expected to be easier than ICPC Regional contest.

COMPFEST itself is an annual event hosted by Universitas Indonesia. It is the largest student-run IT event in Indonesia and competitive programming contest is one of the competitions hosted.

We hope you will enjoy and have fun in the contest. Good luck!!

UPD: Editorial is up!!

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

Comments Comments (27)
| Write comment?
»
2 years ago, # |
← Rev. 2   Vote: I like it -128 Vote: I do not like it

As a participant, I will have participated.

Spoiler for upvotes:
→ Reply
»
2 years ago, # |
  Vote: I like it +34 Vote: I do not like it

Indian participants won't be able to participate as we have our common preliminary round for all regionals at the same time.

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

I always like contest even if i'm bad at coding

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

will there be any official score distributions?

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

    This contest is ICPC rules. Each problem is worth 1 point, each rejected runs have a 20-minute penalty.

    Here is an example contest with the same format.

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

I think indian participants won't be able to participate as we people preliminary round of icpc from 8 to 10:30 pm

→ Reply
»
2 years ago, # |
← Rev. 2   Vote: I like it -35 Vote: I do not like it

<3

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

    why you can't just read the name of the blog lmao

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

tfw the title says Teams Preferred but you don't have friends irl and have to participate alone

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

It was fun

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

The Problem G can be solved using OEIS: A024352

→ Reply
»
2 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Is the solution to J

for all edges, minimum of {(total edge sum * 2 — current edge * 2) — (sum of diameter of 2 trees that occur after we cut the current edge)}

?

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

This contest is rated or not?

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

Amazing contest with heuristic problem E and K!

→ Reply