Noureldin's blog

By Noureldin, history, 3 weeks ago, In English,

Hello CodeForces! I'd like to invite you to the online mirror of the 2017 ACM egyptian collegiate programming contest ,which will be held on Wednessday, 6 July 2018, 02:00pm Cairo time

contest link: ACM ECPC 2017

standings: link

ACM ECPC 2017 Highlights:

the problems were prepared and tested by : Thrax -chief judge-,Badry, Noureldin, SyrianPetr, safrout, Lvitsa, amrSamir, Amirnasr, islam-al-aarag, justHusam and RedStone

problems authors:

Assessment — islam-al-aarag

Breaking the curse — Badry

Cheering parabolas — Thrax

Dream Team — Lvitsa and Thrax

Evaluations — Noureldin

Forgot the Flag! — Noureldin

Glorious Stadium — SyrianPetr

Half Nice Years — Lvitsa and Thrax

Important matches — justHusam

Jacking ticket — Thrax

Katryoshka — Lvitsa

Lazy ERCD — Mohamed Fouad `

You will be given 5 hours to solve the problems.

Good Luck and have fun!

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

»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
2 weeks ago, # |
  Vote: I like it +10 Vote: I do not like it

I think it will be on Friday.

»
2 weeks ago, # |
  Vote: I like it +11 Vote: I do not like it

We scincerely apologize, we just found out that one of the hard problems had the wrong test file (it was a much easier file) we will fix that and rejudge its results. We will update you once this is done.

  • »
    »
    11 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Was that problem B? I see total straight forward solution (no suffix array, data structures) has got AC. You guys should fix it asap.

»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

40030586 don't know why O(1) gave TLE :/

  • »
    »
    2 weeks ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    you should read from file this the problem you can solve it by add this line in first line of main function

    freopen("lazy.in","r",stdin);

    good luck ^_^

»
11 days ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve problem G ?

»
11 days ago, # |
  Vote: I like it +3 Vote: I do not like it

Many of the problems do not have proper dataset. For example: B,E,F,H etc(I did not look into all the problems). They are not even close to the constraints given. I hope you will look into it.

  • »
    »
    6 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    G as well, I'm disappointed that I wasted about 45min debugging my O(log(n) * t) solution when the O(n * t) solution passes without a hitch x)

    • »
      »
      »
      6 days ago, # ^ |
      Rev. 2   Vote: I like it 0 Vote: I do not like it

      FYI, none of that stuff happened at the onsite. It appears there is some issue with the test data when the contest was uploaded to codeforces. Like stated, it will be probably fixed as soon as possible.

      My advice to you is to try and solve the problems with correct complexities, and forget about "Accepted" for now.

»
10 days ago, # |
  Vote: I like it +3 Vote: I do not like it

Will you publish an editorial? And please fix the test case issue. It's really disappointing to see totally naive solution get accepted with given constraints.