Ganesha ITB – ACM ICPC Singapore Site
(team photo : Roberto – Brian – Evan – Kevin – Dr.Liem – PanYue)
The Annual ICPC (International Collegiate Programming Contest) Regional Contest was held again, this year one of the hosts was National University of Singapore (NUS). The ICPC Regional Contest is one of ACM (Association in Computing Machinery) program for collegiate students to compete their problem solving skill. This competition use team-system, a team consists of 3 students from the same university.
Happily, it was my first experience in ICPC (just about 4 months after my IOI, hehe…). Though next January I will officialy be NTU student, I was representing ITB in that contest. My team’s name was Ganesha ITB (we were also use “Ganesha” t-shirt for the first day of the event). It consists of me, Kevin Tanadi (IOI 2006), and Evan Gozali (IAO 2004-2005). The coach was Dr. Inggriani Liem. Not only four, we also went to Singapore with Roberto Eliantono (IOI 2004) as a reserved contestant.
The event took 2 days. The first one for opening, practice session, and some technical lectures. And as you predict the second one was the competition and awarding day. Every team was also guided by one committee along the event, Ganesha ITB’s was PanYue (I thought she came from China).
So happy, the event also attended by so many alumni of TOKI (Indonesian Computing Olympiad Team), in total there were 19 alumni including me plus 1 TOKI coach (Dr.Liem). Little bit dissatisfied since Dr.Setiawan (TOKI head coach could not attend the event). [you can see my previous post]. I will post about it separately for more detail.
The competition ran for 5 hours long and served 7-”not so hard”-problems (you’ll know after you see the problem-set). Just to make it simple, here is the list of the problems:
A: MODEX -> the easiest one, classic-divide and conquer-problem, I told Kevin to code it before the computer completely-logged-in, but one tiny bug was there in our code so that we got accepted in 13 minutes. due to the easiness of the problem, the committee was busy to give the balloon in the first 15 minutes, hehe… (Ganesha : accepted)
B: JONES -> controversial problem! so many teams got wrong answers including my team, that was really confusing since the problem was easy (many teams must got accepted). until the awarding event no one knows what was wrong with the problem. (Ganesha : wrong answer)
C: ACORN -> an easy DP, if you used to deal with DP problems you will be able to solve it quickly, the dimension and complexity of the DP was N^2. (Ganesha : accepted)
D: TUSK -> it such a geometry problem and not so easy, some teams solved it with N^2.logN solution. (Ganesha : didn’t submit)
E: SKYLINE -> until know still not sure about the solution, I think it was the hardest one from the contest. (Ganesha : didn’t submit)
F: USHER -> an implicit problem, but if you can figure it out, it only about shortest path, my team solved it with dijsktra algorithm, but so fool, I could not code it “one-shoot” since I rarely code in C. (Ganesha : accepted)
G:RACING -> an implicit one too, it was about maximum spanning tree, my team solved it with kruskal algorithm, so fool again, I forgot how to code disjoint set so that I did some bug first before got accepted, hehe… (Ganesha : accepted)
Well, if you count it, you will automatically find that my team only solve 4 problems. But several days after the contest, the committee repaired the ranklist, they repaired the status for problem B (JONES) and my team got accepted, so happy! Finally, Ganesha ITB officially solved 5 problems and got the 9th rank.
Overall, I think it is not so bad for my team to solve 5 problems and got the 9th rank since it was the first ICPC contest for all of team’s members including me. Next year most probably I will attend the contest again but representing NTU. Whatever it will be, I think both me in NTU and Ganesha ITB will get improved and hopefully can achieve more than this.
To see the full problemset you can click here. And click here for the full ranklist.
December 19, 2007