Lou Tian Tower Leader's ACM mentality course----copied from the Internet

In fact, it is reproduced, this is the building leader wrote (online discovery)

After reading the very touched. Be inspirational.

Split Line--------------------------------------------------------------------------Split Line----------------------------------------- ---------------------------------

Take advantage of the leisure time of the year to gcj,acm,topcoder some important competitions
Review. Yesterday is the memory of GCJ2006, earlier in today's time, I still remember clearly 3 years
Before, I just participated in the ACM when the Beijing Division 2005 and Hangzhou Division 2005 situation.
2005 acm-icpc--ups and downs
I entered Tsinghua University to start the undergraduate study time is August 2004, in the entrance to Tsinghua University's first
Years, because the basic course study is more tense, coupled with the computer system does not allow freshman students to bring their own computer, I did not
have participated in the ACM Competition in 2004. However, during the one by one-year period, the practice was not stopped, and the ACM
Or the enthusiasm of the rising.
Probably at the end of July 2005, together with the classmate Shell (Belle Fai) and Superzn (Zhang Ning)
decided to join the ACM competition. There is not a lot of ideas for the team name, just pick up a dictionary preface
A little bomber. In a few subsequent workouts, my programming state has been well maintained and training is
The main ways of racing are: My master writes the program, the shell and the SUPERZN are responsible for translating the topics, thinking about algorithms and testing.
This teaming pattern has been used in all the races behind us.
At the end of 2005, we enrolled in the 2005 Beijing Division and the Hangzhou competition. Smooth Passage
The preliminaries entered the field finals. Remember when the Beijing Division in the preliminary, I and SUPERZN together to participate in
Baidu Star Program design contest, Shell relies on the power of one person over 6 questions, and finally qualified to participate in the second place
Beijing Field Competition.
Beijing Division:
The 2005 Beijing Division location is located next to Peking University, because the traffic is very convenient, we did not
lived with most of the contestants, but did not participate in the java-challenge and evening performances.
Before the practice game, when it comes to the lottery, it doesn't mean much, but Wu's magic RP
The two Tsinghua teams were pumped together, and the result was half of the practice race, and the other Tsinghua team THU1
(The players are: Wu Jingyue, Li Shi and, as if later the team name changed to Dreamcatcher, not very accurate
Be asked to change to a far-off place on the grounds that some schools find this unreasonable. Later, many races
District has also appeared in the case of team seats together, Wu Teacher's RP is not covered.
Remember to hang out with Fudan Lemontree (Shengcheng) at the practice game, and the results are not
I was asked to return to my seat in 10 minutes. And then there was the stadium, and some teams put the balloons
After flying the balloon floated under the ceiling, the referee Li Wenwan the teacher also threatened to say if tomorrow formally than
Race to fly a balloon, it does not count through the corresponding problem, unless there is a way to take down the balloon.
Then there is the process of the game, the bottom lines below the text is what I found at that time left the game summary:
E: Quick Sort. 5 min 1Y.
I think 5 minutes can fight for the most recent ACM domestic division of the fastest record.
G: Two-point answer + minimum spanning tree. 25 min 1Y.
This is the classic optimal proportion spanning tree problem, we agree that this question is relatively simple. But then
Was criticized by the Li Wenwan teacher, the argument is misleading other teams. But when it comes to the optimal scale spanning tree problem,
TCO2006 when FWJ and Tomek unexpectedly have not seen this topic, this problem but from poi AH. I
The main reason we think the problem is simple is that we have seen it in the winter camp, if the first
Times, figuring out an algorithm might really take some time. The apology here to the team that was affected by us, most
The final G was submitted more than 200 times, but only 8 teams were AC.
C: The maximum matching of the binary graph. 42 min 1Y
The topic requires calculating the minimum cover set of a graph, and perhaps the only tricky is that the discovery graph is a binary graph.
D: Encountered a certain difficulty, found a is very simple, so first put
D is a relatively comprehensive topic, designing some simple computational geometry and string processing knowledge.
A: Simple geometry problem, there is a low-level error, submitted 3 times are WA.
A is the simplest topic in the Beijing division, my program has made a very low-level error, may also be
The lack of testing.
D: Re-write, but did not consider a situation, WA 1 times.
87 minutes, Fudan's Abuacus over 4 questions occupy the RANK1. As a result of the team model, we
Stuck for up to 30 minutes with a lot of simple questions.
A:shell suddenly found a program in the low-level error, 105 minutes AC, recapture Rank1.
This is a very important step, and now if you do not have this discovery, the consequences may be disastrous.
B: Two-point answer +2sat. 129 minutes AC.
B is an obvious 2SAT problem, because the topic is relatively long, we did not find this simple problem very early.
D: The case of D was found without consideration, 140 minutes AC.
Saw a board, then Abuacus,eccentric have only 4 questions, can participate in the first time
6-4 lead in the game, but the mood was very exciting, but because of lack of experience, it also affected the next
The play. In fact, now in retrospect, this game is actually a good AK opportunity.
F:DP. The program is more complex, WA 4 times.
F is a more complex dynamic programming topic, in fact WA's reason is a should use Int64
place where we used int, this place is really hard to find.
H:f temporarily unable to AC, had to turn work H. H is an ordinary simulation problem. Start without considering tanks and
The shells may have met in 1/3 seconds, WA 1 times.
There are one hours to seal the game.
H:shell found that tanks and shells could meet in 1/3 seconds, about 250 minutes AC.
For our team mode, when the main writing program player is not good, it is easy to appear continuous
The situation of the card problem, the appearance of this situation is not conducive to the normal play of the level. In the competition of the Beijing Division, I
We were fortunate enough not to have a continuous card position.
Remember, at that time the Beijing division of the judge semi-automatic, that is, if the result is AC, the speed will be non-
Often fast, otherwise due to human intervention, cannot AC submission often need to wait a while. We submit the 2nd time
After H, did not get a quick reply, thought already WA, so I and SUPERZN continue to test some
Data. But at this time, suddenly there is a mm from the left side to insert balloons, this balloon has become the only
One of the blue balloons, this unexpected joy finally achieved the First Division champion.
F: Here is the painful to submit F, fighting until the last moment, WA 14 times, left the Beijing
The biggest regret of the division.
At the last moment we seemed to have found the int64 mistake, but the idea was quite chaotic at the time,
I can't change the right. F's problem also led to no time to write I, then if directly rewrite the latter to change Superzn to write F,
can be fully ac before the end of the game.
The general process of the game as mentioned above, the Magic balloon, I still remember the moment. Eventually there were 4
A team to break 7 questions, Abacus composition should be Shengcheng, Timegreen and Suzhan bar, eccentric
I only remember Sing, Zsu_panku I remember Savior (Chen Shi). The above-mentioned old friend after meeting the machine
will be very few, the district competition has become my good need for old classmates important communication opportunities.
My Acrush ID estimate is the beginning of the use of it, the blink of an eye has been more than 3 years.
Before and after the game, I always remember to chat with the FAI teacher at Fudan University, and after that every game I
To see his young figure.
Now think back to the Beijing division, it is fortunate that in the first time to participate in the ACM official competition to obtain points
Championship of the District competition. I think it is because the atmosphere of the scene for many teams have a small impact, then many teams
Duka in a few more tedious topics, the problem of algorithmic is not very strong. I'm probably from