Now I'm in the 10th grade, and only now I realized that this is my penultimate chance.
Last year I was almost a prize-winner at the regional stage, and now, looking at these tasks, I realize how "vegetable" I was. So, I scored 302 points out of 320 prizewinners, as well as out of 570 passing points for the final stage. In grade 10-11 I intend to be a prize-winner of the final stage.
What would you advise me to study? From what I know at the moment:
- Of course, containers like vector, queue, stack, dequeue, priority_queue, set (all 4 sets), map (too), I'll learn list.
- Binary and ternary search
- graph algorithms: BFS, DFS, Dijkstra, Ford-Bellman, Floyd
I was told to solve all the past regions for 800 points, C and D if you can not pass at 100, read the analysis and solve
- Is it necessary to know and be able to implement algorithms like DP on sub-sections (by profile, by subtrees), Z-functions, Cartesian tree, Fenwick tree, red-black tree, bores, top sort, system of non-intersecting sets? Maybe we should know how to solve bridge problems, articulation points?
- Should I read books? Which ones?
- Is it necessary to know geometry? Maybe vectors, trigonometry?
To begin with, at least to go to the All-Race, and already at 11 to pick it up. Thank you all for your answers.