Node-point mappings - world codesprint #10

April 29, 2017

Introduction

It is a good idea to do some research about the algorithm, how difficult it is. Julia just did a quick research and then found out this algorithm - Node-point mappings is not an easy one. Players like ICPC winners may not score full points, only partial of them.

Through the study and research about the algorithm, Julia noticed that it takes a lot of efforts to master the algorithm in advanced level.

Here is the comparison with one of top players. Julia noticed that it takes a lot of work probably years, thousands hours to be able to perform like the other one.

And Julia reviewed the player past performance:

• 1st at USC Programming Contest
 
• Gold Medal at the 2014 ACM-ICPC Asia Regional Contest, Shanghai
 
• Gold Medal (the 4th place) at the 2014 ACM-ICPC Asia Regional Contest, Beijing
  
• 19th place at the 2014 ACM-ICPC World Finals, Ekaterinburg
 
• Gold Medal (the 4th place) at the 2013 ACM-ICPC Asia Regional Contest, Changsha

Profile is here.

It is not easy to learn by yourself and catch up the performance. Best bet is to go back to the third and fourth algorithm and try to score any point in the fourth algorithm.

Code study

Problem statement is here.

Follow up after the contest 

4/30/2017 1:17pm
.