| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | djm03178 | 152 |
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.
Auto comment: topic has been updated by abdelkarim (previous revision, new revision, compare).
Is there any editorial available for this contest?
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 .
In the onsite contest the time limit was very strict, it needed a clean O(nlogn) time to get an AC.
How to solve J in nlogn?
Edit: Got AC already :)
I'm the author of problems J and E, so if you have any question feel free and ask me
How to solve problem J?
http://ideone.com/aqsOkm Why this WR in problem E ??
What's wrong with the DP solution for E?!!
Can someone tell me what's wrong with my approach or provide a hack? 25761843 & 25762601
Also why does BFS always TLE?!! 25775495
UPD: AC bottom-up! :) 25776938
any idea why this gives TLE in test case 2 28313520 ?
Can you please provide the editorial for this contest .. or atleast for C,K, Jand I
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)
[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.)
A good point would be realising which contests you are setting problems for. It's ECPC with an E.
I am the setter of F, any feedback is welcome.
Any hint here please? H. Commandos
Use recursion to try all the 3 possible movements + 3D array memoization.
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
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)
Yes
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.