abdelkarim's blog

Egyptian Collegiate Programming Contest 2016
By abdelkarim, history, 8 years ago, In English

Hello Everyone,

ACM ECPC 2016 (Egyptian Collegiate Programming Contest) problem set will be available in Codeforces Gym on Sunday, 10/30/2016 18:30 Cairo time.

The problem set was prepared by msoos , Whistle, Hossam Samy, nooralasadi10, eagle93, muaztw, RedNextCentury, heba_gamal, Zanaty, ahmed gafer, Marcil, nnahas.

Good luck, and I hope you to enjoy the problem set.

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

Comments Comments (21)
| Write comment?
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

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

Is there any editorial available for this contest?

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

I was a contestant this year , and I can say it was really really awkward and inappropriate running the onsite contest without providing the time limit for problems . I did waste a lot of time thinking about a faster solution for problems during the contest , one of these problems is J.Whistle's New Car . I did waste a lot of time trying to figure something fast , and now on the gym the time limit is 15s .

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

    In the onsite contest the time limit was very strict, it needed a clean O(nlogn) time to get an AC.

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

I'm the author of problems J and E, so if you have any question feel free and ask me

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

Sorry guys but it was the worst problem set in the history of ECPC. Please quit problem setting for the sake of God. (No hard feelings)

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

    [Edited: fixed typo pointed out in AlAostra's reply]

    No hard feelings, but can you explain exactly what you found to be so bad, so that either we or our successors avoid doing ? (Full disclosure: I am the problem setter for problem K, there was an issue during the ECPC contest concerning one test case in problem K, which was not really an acceptable input. The test case was removed during the competition and all submissions that passed other test cases were accepted.)

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

      A good point would be realising which contests you are setting problems for. It's ECPC with an E.

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

I am the setter of F, any feedback is welcome.

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

Any hint here please? H. Commandos

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

    Use recursion to try all the 3 possible movements + 3D array memoization.

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

      My code But got wrong result

      I think i didn't understand the idea

      UPDT : new code but also Wrong answer :'(

      My Code

      UPDT :

      Accepted

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

Regarding G. The Galactic Olympics problem:

in the problem statement :

Foki's children must participate in all the games and every one of his children get to participate in at least one game

each one of Foki's children can participate in multiple games in the Olympics, but each game must be arranged to exactly one player

number of games 0 < N ≤ 10^3, number of Foki's children 0 < K ≤ 10^6.

does it mean that if in the input K is larger than N then the answer is 0 ? (since in a certain arrangement: every child must participate in at least 1 game, and we can only arrange each game to exactly 1 player, so it is impossible to satisfy these if K is larger than N)

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

Can someone help in problem B? I considered each rectangle as a node in a graph and run floyd-warshall in it, I'm getting WA.

→ Reply