This article is made by Jason-Cow.Welcome to reprint.But please post the article's address. bzoj2618 1A,看懂了题目就是读入的复杂度 把每个凸包看成m个约束条件 一起读入然后做一次HPI O((nm)log(nm)) (nm<=500,时间完全可以承受) /************************************************************** Problem…
蛋疼的蚂蚁 Time Limit: 1000 MS Memory Limit: 65536 K Total Submit: 39(22 users) Total Accepted: 26(21 users) Rating: Special Judge: No Description 大千世界无奇不有,最近科学家发现一种蚂蚁,它头部只有一只左眼,并且 三只脚在身子的右侧,因此:1,它不能转向右侧.2,它的行走会留下一条红印.3,它行走不会在经过以前 走过的红印. 这种蚂蚁需要每天吃一…
Space Ant Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2876 Accepted: 1839 Description The most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y19…
Wall Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 28157 Accepted: 9401 Description Once upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's castle. The King was so greedy, that he wo…