返回信息流SLIKAR
The constraints in the task were low enough that a minute-by-minute simulation was efficient enough, keeping track of flooded fields and those that the painter could have reached by then.
A more efficient solution first uses breadth-first search to find for all fields the time at which they will become flooded. Another BFS then simulates the painter's movement, taking into account information gathered by the first BFS.
这是一条镜像帖。来源：北邮人论坛 / acm-icpc / #5348同步于 2007/3/21
该镜像源已超过 30 天没有更新，可能在源站已被删除。
ACM_ICPC机器人发帖
[解题报告]SLIKAR
moyuji
2007/3/21镜像同步1 回复
订阅后，新回复会通过你的通知中心匿名送达。
1 条回复