1.Team distribution:
ALPC Team1:
   alpc02(Team leader)
   alpc01
   alpc12(me)
ALPC Team2:
   alpc04(Team leader, replace alpc10 temporarily due to alpc10's absence),
   alpc25
   alpc62
ALPC Team3:
   alpc05(Team leader)
   alpc16
   alpc55
ALPC Team4:
   alpc33(Team leader)
   alpc07
   alpc60

2.Contest Description
   This contest is an invatational contest hold by HNBC. Problems for the contest are selected randomly on PKU and not solved by any of the contestants.

3.Final Standing

Rank	Location	User	Solved	A	B	C	D	E	F	G	H	I	J	Penalty
		ALPCT1	8	1:45:53 (1)	2:01:09 (0)	3:33:23 (1)	1:08:46 (2)	1:07:18 (0)	4:56:11 (0)	4:31:44 (1)	2:40:53 (0)			1405
		alpcT3	8	0:46:43 (0)	3:45:01 (2)	1:26:34 (0)	3:38:07 (3)	1:00:55 (0)	4:28:30 (0)	3:16:22 (1)	2:56:18 (1)			1418
		alpcT2	7	0:58:28 (0)	1:50:27 (0)	3:09:28 (1)	1:13:18 (1)	1:37:25 (0)	4:04:09 (0)		2:42:53 (3)			1036
		alpc T4	5	0:55:17 (2)	1:23:51 (2)	-4	1:43:11 (3)	2:04:49 (0)			3:41:03 (2)			768
		panjinww	3	4:12:17 (6)			3:35:36 (3)	3:07:25 (1)						855
		hbccomputer	2	4:14:54 (1)			-8	1:45:12 (3)						440
		hnbc01	1					2:39:46 (2)		-6				199
8		gfdgd	0	-2			-4	-2						0

4. Details

   I will not focus on the problemset itself, because this is almost the first team practice for me offically.

   ok. now let's have a look at our performance during the whole contest.

   Accoding to problems distribution rule, alpc02 took ABC, I got DEF, alpc01 the rest. Luckily, the 3 problems I got are easy ones. So I soon caught sight of a easy problem -- D. After discussion, we found it just involved some basic HP calculation. So alpc02, as the dominate coder, began to code very quickly. But his program seemed to have a small bug and it took him quite a lot time to fix it. During that time, i successfully took problem E down, which is considered the easiest problem of all.

   Our first Accpeted came a little late -- 1:07:18. But it brought us Luck and Confidence. After fixing problem C's bug, we went to A because it had been solved by 3 teams already. I coded Problem A, but unforturnately made a stupid mistake before AC. After that, we solved B, H, C in order. 

   The real battle is actually on F & G. F is a slightly complicated problem which we solved using FloodFill eventually. G is a problem we must use Binary Search + Matrix Muliticulation to solve. It tooks a lot of time to code and debug. But we got them all passed in the end, that was really exciting!

   I gave a pretty poor performance during this contest. I did nothing during the last one hour. We had F,G in our hands not solved at that very moment, so it would make no sense that I turn to other problems. But F,G's algorithm were very clear at that time, all that matters is coding & debuging. So I dicided to code problem J on paper to see if there is time for problem J. Although I had  the code all wroten on paper,  i got only 3 minutes to type it in . That's why I did nothing during the last hour...

   I will try my best to do better in the later contests!

   by the way, our Regional Team is made up finally!
   Team : ARTor      (as NUDT team3)
   Team member: Alpc01(Team leader), Alpc12, Alpc55
  
   Best wishes for ARTor!