worthytacos's blog

By worthytacos, 2 months ago, In English

Hello, Codeforces!

We are excited to invite you to the mirror of COMPFEST 18 Final Round!

COMPFEST is an annual national-level IT event and competition organized by the Faculty of Computer Science, Universitas Indonesia (Fasilkom UI). This mirror is based on the problemset of the COMPFEST 18 Senior Competitive Programming Contest Final Round, and is open for everyone to participate!

This mirror features a subset of the problems from the original contest.

Key Details:

We Would Like to Thank:

For more information about the contest rules and regulations, please refer to the contest page.

Please register for the contest, and we encourage everyone to try all the problems! We hope you enjoy the mirror and have fun solving!

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

»
2 months ago, hide # |
 
Vote: I like it +11 Vote: I do not like it

Auto comment: topic has been updated by worthytacos (previous revision, new revision, compare).

»
2 months ago, hide # |
 
Vote: I like it +16 Vote: I do not like it

As a (not) tester, i (didn't) test

»
2 months ago, hide # |
← Rev. 2  
Vote: I like it +11 Vote: I do not like it

As the author, i hope you guys keep persevering and always carry hope inside your heart!

»
2 months ago, hide # |
 
Vote: I like it +16 Vote: I do not like it

bump

»
2 months ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

Is it rated?

»
2 months ago, hide # |
 
Vote: I like it +13 Vote: I do not like it

Have fun with the problems guys.. :D

»
7 weeks ago, hide # |
 
Vote: I like it +4 Vote: I do not like it

letsgo

»
7 weeks ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

bump, contest is starting in 15 hour

»
7 weeks ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

Friendly reminder, the contest is starting in ~2 hours, happy solving :D

»
7 weeks ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

Regarding Problem E:

Did you test the problem on TOKI?

It seems unreasonable to set the time limit to 2 seconds for a problem that only requires finding the height of a tree, when even the fastest submissions take around 1.3 seconds for N = 10^6.

I was able to get rid of the TLE by replacing O(N) repeated multiplications by 2 with binary exponentiation or rewriting the recursive DFS as BFS. lol

  • »
    »
    7 weeks ago, hide # ^ |
     
    Vote: I like it +8 Vote: I do not like it

    It seems like all of our testers used fast exponentiation, and the official solution also uses it. The official solution passes comfortably under 1 second on TLX, so it seems like the 2-second time limit is not too tight when using the intended approach.

    However, we weren't aware that the O(N) repeated multiplications approach could be this close to the limit. We really apologize for not catching this during testing, and for any inconvenience or frustration this may have caused while solving the problem.

»
7 weeks ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

Oops I'm late, but as a tester, time limit exceeded spam :snake: