[10.27] CSP-S2019 simulation game summary

Disclaimer: This article is a blogger original article, follow the CC 4.0 BY-SA copyright agreement, reproduced, please attach the original source link and this statement.

This link: https://blog.csdn.net/qq_43649416/article/details/102772810

Weekend, a little decadent, changed the title a bit slow.

Game ideas

Portal

• T1 (box): it is easy to think of inclusion and exclusion, taking into account each row of each column should have, I would direct violence inclusion and exclusion no i row, j column is not, and this is nm, only 70 points. . . Orz
• T2 (intervals): clearly the order in accordance with section DP like. Just started not taking into account the three successively stacked together, only one f [i] state, the last twenty minutes take the time to discover this obvious and fatal error, then changed to crazy f [i] [j ]status. . . Finally scare Orz. .
• T3 (zombie): Evaluating the readily occur to all positions occupied, and because it deserved tree is a tree DP, because n <= 2000, there is naturally a f [i] [j] denotes the i point sub-trees are occupied, the largest zombie i j in this node. But not transfer because of the situation from the walk down. . .

After the game digestion

• Since each column T1 in fact should have, so there is no violence inclusion and exclusion i row when computing solutions not pick any program, but each column has a plan, so simply done.
• T3: problem solution

to sum up

• Special circumstances to be thoughtful.
• sb inclusion and exclusion should not be too rigid.
• T3 really amazing.
• I was too weak Orz.