I would like to invite you to participate in the 2018 Egyptian Collegiate Programming Contest (ECPC 2018) that was held on the 20th of October 2018 in Alexandria, Egypt. The contest will be on 17.11.2018 17:05 (Московское время).
The problem setters were me Badry, Amr Mahmoud RetiredAmrMahmoud, Ahmed Kamel Kammola, Medo Nasser Medo. and Mohamed Yousri BitHashTech.
Also I would like to thank Ayman Salah _AymanSalah, Ali Ibrahim C137, Mohammad Yasser Mohammad_Yasser, Ahmed Soliman AhmedSoliman, Mostafa Abdulla MostafaAbdullah, Noureldin Yosri Noureldin, Khalid Abdulnasser Safrout and Mostafa Mahmoud Thrax for helping in preparing and testing the contest.
I hope that you enjoy the problems.
Auto comment: topic has been updated by Badry (previous revision, new revision, compare).
Auto comment: topic has been updated by Badry (previous revision, new revision, compare).
Do you have solution for problems?
Heshamovic Gedo_QotB yala?
yala gdn ..
ahmose Mr_Boombastic yala?
eshta yala
How to solve problem C and E? Principle of inclusion-exclusion for E？
Dynamic programming for both. We will most probably post an editorial soon.
Thank you!
Updates about editorial?
I very want to know how to solve Problem E. Can you give me some idea? Thx.
Any news? =/
No editorial is coming, sorry. :(
What is the complexity of the intended solution of Problem I ?
Where can i find the editorial?
How to solve Problem H. Find the path?
Thank You.
Can someone please explain the solution of E
I am stuck at Problem H and Problem M Please someone help.
my idea for H ( but get WA2):
Set u as root and run bfs get distance of all other node by edge weight as 1.
Using the distance array get the given maximum weight at distance x for all node.( maxw[ dis [ x ] ])
Then ans will be maxw [ min ( distance of farthest node, L)l).
Pls help!