摘要: Rinne Loves Edges 题目描述 Rinne 最近了解了如何快速维护可支持插入边删除边的图,并且高效的回答一下奇妙的询问。 她现在拿到了一个 n 个节点 m 条边的无向连通图,每条边有一个边权 wiwi 现在她想玩一个游戏:选取一个 “重要点” S,然后选择性删除一些边,使得原图中所有除 阅读全文
posted @ 2019-02-11 23:13 *starry* 阅读(144) 评论(0) 推荐(0) 编辑
摘要: Bag of mice CodeForces - 148D The dragon and the princess are arguing about what to do on the New Year's Eve. The dragon suggests flying to the mounta 阅读全文
posted @ 2019-02-11 13:36 *starry* 阅读(292) 评论(0) 推荐(0) 编辑
摘要: A Dangerous Maze LightOJ - 1027 You are in a maze; seeing n doors in front of you in beginning. You can choose any door you like. The probability for 阅读全文
posted @ 2019-02-11 13:30 *starry* 阅读(345) 评论(0) 推荐(0) 编辑
摘要: Dice (III) LightOJ - 1248 Given a dice with n sides, you have to find the expected number of times you have to throw that dice to see all its faces at 阅读全文
posted @ 2019-02-11 13:26 *starry* 阅读(432) 评论(0) 推荐(0) 编辑
摘要: Aeroplane chess HDU - 4405 Hzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each s 阅读全文
posted @ 2019-02-11 12:39 *starry* 阅读(284) 评论(0) 推荐(0) 编辑
摘要: Discovering Gold LightOJ - 1030 You are in a cave, a long cave! The cave can be represented by a 1 x N grid. Each cell of the cave can contain any amo 阅读全文
posted @ 2019-02-11 12:37 *starry* 阅读(312) 评论(0) 推荐(0) 编辑