magieNoire's blog

By magieNoire, history, 3 years ago, In English

Yesterday, November the 4th the ECPC 2017 (Egyptian Collegiate Programming Contest) was held. I know that the contest is prepared in Polygon. Is it possible for the organizers to make it available for the community before the ACPC ?

Read more »

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

By magieNoire, history, 3 years ago, In English

My team is interested in participating in the Moscow International Workshop ACM ICPC 2017. We came to learn about it only few days ago, which means that it is impossible to attend physically next week. Luckily, there is an online version for the course, and our University is willing to pay it for us.

In the website, under the category of online partitcipation, there is no clear instructions of how to register. So, what we have done is filling the registration form on their website. We do think that is not the correct way in our case, because we never saw some satement about online participation. Can someone from the origanizers guide us please ?

Another question concerning the camp. There are 2 divisions A and B. In our case we are competing in a regional level (Arab region) and our goal is to qualify for the ICPC. My teams is composed of two people and we have the same lelvel.

Read more »

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

By magieNoire, 7 years ago, In English

Hello everyone, I tried recently this problem, but unfortunately I got TLE. I am using an O(nlogn) algorithm as supposed( a segment tree for updating the list and a map to keep track of frequency of each number and it's position ). I think there is some overhead with the update function -- can I rewrite it iteratively ? Any suggestion is welcomed.

Here is my code: link

Note: if someone can redirect me to a non recursive implementation of segment trees that will be great.

Read more »

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

By magieNoire, 7 years ago, In English

Hello everyone,

Can someone please take his/her time to explain how to solve the problem Bugs in Code. All what I have come up with is an O(n2logn) solution which is too bad.

Update: I have already seen the editorial but I couldn't understanding it.

Update2: I got it accepted.

Read more »

 
 
 
 
  • Vote: I like it
  • -15
  • Vote: I do not like it

By magieNoire, 7 years ago, In English

Can someone help me with Sereja And Table please.

PS: I didn't understand the editorial.

Read more »

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