Motarack's blog

[GYM] The 2019 University of Jordan Collegiate Programming Contest
By Motarack, history, 5 years ago, In English

Hello,

The problem set of The 2019 University of Jordan Collegiate Programming Contest will be available at the gym Jul/04/2019 17:00 (Moscow time).

The problem set consists mostly of div. 3 problems with the exception of few problems, as the majority of teams were new to ICPC contests with the exception of few div. 1 and div. 2 teams, we recommend this contest mostly for div. 3 participants, but div. 2 participants might find some problems interesting.

The problem set was prepared by Jester, Dark, Onflow and Motarack.

Thanks to MikeMirzayanov for the usual stuff, and Kilani for help with judging.

Good luck.

Contest link.

UPD1: Editorial link.

UPD2: Forgot to thank Namco Tales Studio for one of the ideas of the problems.

UPD3: There was a flow in the solution of problem L, it's now fixed, all AC practice solutions were rejudged, sorry for the inconvenience.

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

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

reminder, the contest starts in around 30 minutes.

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

Will there be any editorials? Interesting problemset by the way!

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

    An editorial will be published tomorrow or the day after it.

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

G and E are very interesting problems. Do you have any ideas for G? I'm afraid what I came up with will not fit in TL. Hear a lot of operation turns out.

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

How to solve J? I have gotten WA on test case 86 several times.

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

In problem F, Arena Olympics, how to check if two fighters can see each other in O(1) ?

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

    Draw a line between them, the angle between them can be calculated by atan((y2-y1)/(x2-x1))

    Then check if this angle lies between it's field of vision.

    Create a adjacency list using this information. If there is a no cycle in the graph, them the order will be reverse of topological sort.

    Is this correct for F? I was getting WA on 4.

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

can anyone tell some approach for problem L

what was test case 6 indeed??

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

    Note that this test case might give hints to the solution.

    Spoiler
    → Reply