码代码的猿猿

摘要： 很久以前就见过的。。。最基本的概率DP。。。除法配合位运算可以很容易的判断下一场要和谁比。 from——Dinic算法 FootballTime Limit:1000MSMemory Limit:65536KTotal Submissions:2499Accepted:1258DescriptionConsider a single-elimination football tournament involving 2nteams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still... 阅读全文

摘要： 分段的概率DP+矩阵快速幂 Scout YYF ITime Limit:1000MSMemory Limit:65536KTotal Submissions:4180Accepted:1076DescriptionYYF is a couragous scout. Now he is on a dangerous mission which is to penetrate into the enemy's base. After overcoming a series difficulties, YYF is now at the start of enemy's famo.. 阅读全文

摘要： 先来看木板：再来看气球：最后看木板+气球：google送的纪念品。。。。到现在还没敢打乱：赛场外面。。。。赛场里面：和比赛时出了问题，并现场换了一台的电脑（对面长安大学1队）。。。最后让我们来看陈立杰。。。林神和丽洁：丽洁的背影。。。。潇洒飘逸～～颁奖典礼：陈立洁。。。。丑陋的曲线： 阅读全文

摘要： 组合数学GCD and LCMTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 451Accepted Submission(s): 216Problem DescriptionGiven two positive integers G and L, could you tell me how many solutions of (x, y, z) there are, satisfying that gcd(x, y, z) = G and l 阅读全文

摘要： 状压DP。。。十几年前的题目，一定得A掉。。。。。 炮兵阵地Time Limit:2000MSMemory Limit:65536KTotal Submissions:16432Accepted:6252Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也可能是平原（用"P"表示），如下图。在每一格平原地形上最多可以布置一支炮兵部队（山地上不能够部署炮兵部队）；一支炮兵部队在地图上的攻击范围如图中黑色区域所示：如果在地图中的灰色所标识的平原上部署一支炮 阅读全文

摘要： 3维空间中的最小生成树。。。。好久没碰关于图的东西了。。。。。 Building a Space StationTime Limit:1000MSMemory Limit:30000KTotal Submissions:3804Accepted:1940DescriptionYou are a member of the space station engineering team, and are assigned a task in the construction process of the station. You are expected to write a compu... 阅读全文

摘要： The Moving PointsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 878Accepted Submission(s): 353Problem DescriptionThere are N points in total. Every point moves in certain direction and certain speed. We want to know at what time that the largest d 阅读全文

摘要： 省赛的A题。。。现场都没什么人做。。。其实就一暴力水题。。。。。。坑死了。。。1328: 近似回文词Time Limit:1 SecMemory Limit:128 MBSubmit:13Solved:8[Submit][Status][Web Board]Description输入一行文本，输出最长近似回文词连续子串。所谓近似回文词是指满足以下条件的字符串：1. S以字母开头，字母结尾2. a(S)和b(S)最多有2k个位置不同，其中a(S)是S删除所有非字母字符并且把所有字母转化成小写之后得到的串，b(S)是a(S)的逆序串。比如当k=1时，Race cat是一个近似回文词，因为a(S)= 阅读全文

摘要： 有一种定理，叫毕克定理。。。。 AreaTime Limit:1000MSMemory Limit:10000KTotal Submissions:4352Accepted:1977DescriptionBeing well known for its highly innovative products, Merck would definitely be a good target for industrial espionage. To protect its brand-new research and development facility the com... 阅读全文

摘要： 省赛B题。。。。手写链表。。其实很简单的。。。。比赛时太急了，各种手残。。。。没搞出来。。。。要不然就有金了。。。注：对相邻的元素需要特判。。。。。Problem BBoxes in a LineYou have n boxes in a line on the table numbered 1~n from left to right. Your task is to simulate 4 kinds of commands:1 X Y: move box X to the left to Y (ignore this if X is already the left of Y)2 X Y: 阅读全文