problemset division
According to resource consumption, to be divided on the subject of race.
- \(problemset = X\cup Y \cup Z\)
- \(X=X_1 \cup X_2\)
explanation
- \ (The X-\) : a little thought to the win. ( \ (X_1 \) : Flat A, \ (X_2 \) : requires consumption of blue.)
- \ (The Y-\) : desperate struggle to solve.
- \ (The Z-\) : Take over the head can not have too.
For \(X\)
Good condition : a fast paced, resource consumption small problem first cast.
Tactics
- Improve reading problems a priority, the problem can not be white to do.
- More than confirm the meaning of problems, try to sample hand count.
- After speculation that conclusion, not white to, careful argument, or very easy card in the corner.
- After stuck in the corner, do not iron head, timely escape. You can think about other problems, reading problems, sample hand count, clear out the error of thinking.
3h30min as possible before the end of \ (X \) in all phases of the problem. Before the end of \ (Y \) questions the idea of generating more forming.
For \(Y\)
Good condition : efficient team battles
Tactics
- Code Hand : Do not alone, actively seeking assistance.
- Auxiliary : correctness proof, proof complexity, constant optimization of thinking, trying to find a simpler way of thinking, Corner case, Test case, to take the program .
- Cautious strange, weigh the situation in the field.
- Trends in other teams.
- The hands of the problem, whether or not a foregone conclusion.
Skills
- Computational Geometry. [Code]
- data structure. [Code]
- Category talk, including but not limited to large simulation. [Code]
- Hard combination optimization problem. [Idea]
- Hard mathematical formulas down. [Idea]
For Z
By adding skill points, reading the paper, the \ (Z \) the collection of questions and threw \ (Y \) collection.