When submitting a solution in C++, please select either C++14 (GCC 6-32) or C++17 (GCC 7-32) as your compiler. ×

Badry's blog

By Badry, history, 5 years ago, In English

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 Nov/17/2018 17:05 (Moscow time).

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.

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

| Write comment?
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

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

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

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

    Do you have solution for problems?

»
5 years ago, # |
Rev. 2   Vote: I like it +8 Vote: I do not like it
»
5 years ago, # |
  Vote: I like it +8 Vote: I do not like it
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve problem C and E? Principle of inclusion-exclusion for E?

  • »
    »
    5 years ago, # ^ |
    Rev. 2   Vote: I like it +8 Vote: I do not like it
    Spoiler
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

What is the complexity of the intended solution of Problem I ?

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

Where can i find the editorial?

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

How to solve Problem H. Find the path?

Thank You.

»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone please explain the solution of E

»
4 years ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

I am stuck at Problem H and Problem M Please someone help.

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

my idea for H ( but get WA2):

  1. Set u as root and run bfs get distance of all other node by edge weight as 1.

  2. Using the distance array get the given maximum weight at distance x for all node.( maxw[ dis [ x ] ])

  3. Then ans will be maxw [ min ( distance of farthest node, L)l).

Pls help!