NOI

It is a long time since I last wrote. It was really a terrible time since two weeks ago. Anyway, finally it is completed, so I can change my attention to more interesting staffs.

I was involved again in NOI this time — not as a contestant, but an (likely) observer. Due to the community service requirement of Tsinghua on issuing PhD degrees, I went to Mianyang, Sichuan this summer. Put aside the numerous critics on keeping this requirement since ’77, I was “teaching” the high school kids something for NOI. I quote the “teaching” part because for olympic students, the usual way is to learn by themselves. But it seems that this school is different from the others, since the teacher here decides most of the process. Actually I think it is quite a bad idea, because the olympic problems change every year, and I am sure that none of the high school teacher has a PhD degree in CS, so who will expect one that does not understand why regular expression is equivalent to DFA to catch up?

Another thing impressed me is the problem is becoming harder and harder. Not in the sense they bring more ideas and sights into the contest, but they are trying to push technical parts further. I don’t like the idea of discussing whether being technical or conceptual, but I think being technical too much just make the contestants to recite algorithms, which was clearly a sign of “bad contest”.

Fortunately this year’s NOI is better than the last two years, which is focused on some simple ideas. But they are still kind of “dirty” if compared to this year’s CEOI problems. I was very astonished to see Mihai was on the committee of deciding the problems of CEOI. Generally speaking, CEOI has more neat problems. Paraphrasing from the teacher, “you will know what you are going to do when you see the problems”. I admit that the problem sets in China are more or less more on modeling part, but not on the algorithm part. And I think it was intentional because if they are too obvious, then some of the kids will spend their time sleeping in the contest :) . It is very easy to get problems everyone knows how to solve, or the problems that no one knows how to solve. But for the problems good for a contest, it is kind of hard to make. I have to say CEOI is better than NOI on this point, for they are trying to increase the internal difficulty of the problems, and we are trying to make the problem more obscure. Although they also suffer from the problem of getting too much complexity on formulated optimizations (like this), but more problems are good even for talking after dinner (like this).

By the way, this year’s IOI is in progress, which is located in Bulgaria.

ACM Tsinghua Beijing Regional

http://icpc.cs.tsinghua.edu.cn/

多事之秋

Topcoder这两天麻烦真是多,看这个:


We are deeply saddened to share the news that TopCoder member Xiao Dong Li – victor_lxd – passed away last week at the age of 26, due to injuries sustained in a car accident. He is survived by his wife, Cynthia Li, and his parents.

While a member for less than two years, Victor made an extraordinary contribution during his time in the TopCoder community. Among his other accomplishments, he attended three on-site tournaments, twice as a member of the review board and once as a design finalist. More importantly, he was dedicated and considerate, and a wonderful person to work with and know.

If you wish to send a gift to help Victor’s family, you may direct monetary gifts to Cynthia’s cousin Cindy Lee, who is managing the family finance’s while Cynthia recovers from injuries she sustained in the accident. Please make checks payable to:

Cindy Lee
25981 Hinckley Street
Loma Linda, CA 92354


另外,前两天还有其他的事情,例如说贵系有两个人去签证发现 invitation letter 上面 Jessie D’Amato 的签名居然是不一样的,差点被大使馆当成伪造 invitation letter 的。然后还有好多人没看到 TCCC 的要求说要送照片之类的,连 invitation letter 都没给,好多人都去不了了。TopCoder 在增长业务的处理上还是很麻烦的。

不过,据说 TopCoder 已经在 Beijing Normal University 举办过比赛了,然后过两天有一个活动,明年应该在清华也有比赛,业务越做越大了呢。

Out of Programmer

好长时间没写程序,居然TCCC Round 2都fail了。
而且还有好多事情要做,Abstract Algebra II还一点不会,需要抽时间看看Computational Social Science,以及一些Matrix Analysis,今年还没有出去玩过呢。

这是一个物质过剩的时代,
这是一个情感过剩的时代,
这是一个知识过剩的时代,
这是一个信息过剩的时代,
这是一个聪明理智的时代,
这是一个脚踏实地的时代.

我们有太多的事情要做,
我们有太多的东西要学,
我们有太多的声音要听,
我们有太多的要求要满足.

恋爱的犀牛[1,2,3]

人比人

昨天出去打 Bowling,回来的时候车上有人说已经结婚了,我们感到很惊讶,因为这里都是 intern。然后开始聊天,知道那个人是以前理科班的,现在博士4年级,大概26/27的样子,和女朋友17岁开始谈恋爱(也就是说也是理科班的,orz),然后谈了8年在25岁那年结婚了。这虽然倒是小概率事件,到还好可以接受。不能忍的是这个人已经有房有车了(那还来 intern 干嘛?!)。

然后我就开始联想,感到了非常自卑。贵系的各位总就不用提了。不过这些还好,有的时候可以从 bbs 上挖掘到一些他们当年奋斗的足迹,还可以感到别人也是走出来的(虽然有些人的事迹也很orz….)。有些没有事迹的就会感到很无语,例如:

1. Mihai,这个是 IOI 99/00/01 的金牌,当年 stickyworm 写文章还提到过他,好像从 undergraduate 就开始发STOC?目前在 MIT CS,而且女友好像也很 pp (-_-b)。

2. Tomek [1, 2],Contest 的奖项都堆成山了?而且质量很高,基本都是 rank 1……而且这些人怎么都从高中开始做 intern?

3. Reid Barton [1, 2, 3],虽然说是每个人都可以写 Wikipedia 吧,不过能有别人替他写且值得别人替他写的人也不是什么无名的人了。总奖牌数就不数了……看看 Wikipedia 上面怎么说的就好了……有的时候看这种介绍真是无力,而且他还很行为艺术的在 IPSC 的时候和Tomek 组队……其实我最羡慕的是这些人怎么都有 piano 或者 cello 玩?

这些人真是不能多看,看多了眼睛都受不了。人最怕的不是被人发现弱点,反正每个人都有。关键在于你的长处能被别人当成弱点,这个就太要人崩溃了。

算了,这次某脑袋长得有两个人大的人居然说我有打 Bowling 的天赋,我退个学去打 Bowling 吧。

这次的Top Coder Intel Marathon

题目是Approximate Nearest Neighbor,可以考虑做做看。
不过这样的题目过于简单,可能不加一点复杂的策略不行。

ACM Final Solution

see here:
http://blog.csdn.net/wuyingying/archive/2006/04/14/663690.aspx

其实我没什么兴趣了,ACM的题目越来越感觉有点无聊,不过dynamic的文章就友情连接一下。

Prized Contests Comments

Anyone who have comments on the Prized Contests page, please write here.

GCJC 2005

终于结束了。还好拿了2000+nano,比我预计的好一些。

不过比赛的事情,大概这就到一个阶段了。以后可能还会再比赛,不过已经老到了不想那么拼抢争夺的年纪了,或许也就是玩玩吧,心态倒是好了许多。

或许过一段时间会总结一下,不过好像还有很多事情要做。

另外,nano很爽,恩。