Archive for February, 2008
The Leap Years (2008)
“Based on a novella by acclaimed writer Catherine Lim, the story is about Li-Ann, a young Singaporean girl who meets her ’special someone’ on 29 February. She decides to base her intuition on an Irish leap year tradition that no man will refuse any request of a lady and invites him out for a date. Together, they embark on a romantic journey that spans over 12 years, meeting only thrice in 12 years, on the leap year.”
Actually I haven’t watch the movie yet, but I think it will be nice. First I saw its trailer in the bus and then I searched it on youtube, the idea of the movie is quite unique and interesting. If it’s possible, I want to watch it on 29th February 2008 (will be my first time go to cinema in Singapore), wanna join? For further details, you can visit the official site.
NTUsiasm!
My new team in Nanyang Technological University…
Brian Marshal, TOKI 2006-2007
Raymond Christopher, TOMI 2006-2007
Wendy, TOKI 2005-2006
The First Goal : ACM ICPC World Final 2009!
The name “NTUsiasm” is given by Wendy, it’s better than the first one he proposed, hehe…
USACO February 2008
USACO February Contest 2008, just held. As usual there were 3 problems for each division.
Actually February problem-set is not so hard.
Bronze Division:
-diningb -> straightforward DP problem, which you should precompute the cost to change to card 1 for all length and cost to change to card 2 as well, once you’ve done that you can combine it and get the result, O(N).
-racing -> just a typical simulation problem, all you can do is run trough all the track, O(N).
-cowmult -> using an easy observation of mathematics, we can solve it very easy, O(1).
Silver Division:
-lines -> mathematis + sorting = full score, the only thing that made my code fail to get full score is because my array wasn’t big enough, I forgot that the number of gradiens will probably reach N^2, once I change the array [1..210] to [1..40010] I will get full score, hiks, one more time I hate bug! O(N^2).
-meteor -> a tricky flood fill problem, all you have to do just do a flood fill and simulate the meteors chronologically (you have to sort them first), don’t forget to code your solution clearly, my code didn’t get full score coz I did some bug (arrrghhh, I hate bug!), O(max(T,X,Y)^2).
-egroup -> similar to diningb in bronze division, but this one is a little bit more difficult since we also have card 3, the keyword is only “precompute” and then you can combine it and get the result, another no-hard DP, I got full score for this, O(N).
Gold Division:
-cgame -> when I saw this problem I think about knapsack algorithm, but it’s impossible to have a normal knapsack within that constraint, all we have to do is hack the normal knapsack algorithm (as RK said in the analysis), the fact that we have to hack the normal way make this problem considered as a output-only problem, I only got 5-first-testcases.
-hotel -> problem with advance data structure, I realize what to do to solve it but until now I can’t code binary indexed tree or something like that, that means I have to practice it more, I only got the small testcases since I only submitted my kind of brute force code, the expected solution is run for O(MlogN).
-grading -> a typical DP-push problem, but before that you have to convince yourself with a lemma that no need to change a height into particular height that doesn’t exist in the height set, in other words you only have N possible height to try that makes this can be done in O(N^2), I got full score.
TopCoder Makes Me Crazy!
Arrgghhhh… JAVA + TOPCODER = CRAZY!
I did it twice! Yeah, I did a little-Javanase-bug for twice!
Firstly, in my SRM 390 competition, I did a typecasting of (int) which should be (long).
Secondly, in my Second Qual of TCO08, I just knew that we can’t assign an operation of character to a string variable in JAVA, we should assign a single character one after another.
The Beauty of “A Beautiful Mind (2001)”
“Mathematicians won the war. Mathematicians broke the Japanese codes and built the A-bomb. Mathematicians… like you. The stated goal of the Soviets is global communism. In medicine or economics, in technology or space, battle lines are being drawn. To triumph, we need results. Publishable, applicable results. Now, who among you will be the next Morse? The next Einstein? Who among you will be the vanguard of democracy, freedom, and discovery? Today, we bequeath America’s future into your able hands. Welcome to Princeton, gentlemen.”
2007 Valentine Night SMAK 1 BPK PENABUR Bandung
Come and Join
The 8th Valentine Event
SMAK 1 BPK PENABUR Bandung
9 February 2008
Guess Star : ECOUTEZ
H.O.S Tjokroaminoto 157 Bandung