—弱校联萌十一大决战
MissZhou要努力
不晓日月,不辩兰艾,终日碌碌,安与燕雀相随乎
展开
-
弱校联萌十一大决战之强力热身B Carries 二分+模拟进位
题目:点击打开链接 10^5个数两两相加,问有多少进的位。想到O(n*n)的算法明显超时,而且还得没算每一位的重复计算造成的超时== 看AC代码,用到upper_bound居然还没联想到二分→_→看着代码都不难,自己就是想不到啊啊啊啊啊 总结做法:之前自己一直纠结,进位之后会影响较高位的运行结果,而且固执的认为:要模拟进位,那么计算的一定是当前位这两个0~9数字相加。 但是,事实并不是酱紫原创 2015-10-01 18:04:22 · 476 阅读 · 0 评论 -
弱校联萌十一大决战之背水一战B Binary Operations
Bob has a sequence of N integers. They are so attractive, that Alice begs to have a continued part of it(a continued part here also means a continued subsequence). However, Bob only allows Alice to ch原创 2015-10-07 20:34:08 · 920 阅读 · 0 评论 -
弱校联萌十一大决战之强力热身D. Vertex Cover最小点覆盖【附cin加速代码】
链接啊:点击打开链接 这个破题也是简单的要死啊啊啊啊啊啊 读完题就觉得是什么裸的图论模板,咋抽咋眼熟→_→ 学弟后来说是最小点覆盖,暑假集训的时候说过啊啊啊啊啊啊啊T^T 最小点覆盖就是二分图最大匹配啊啊啊啊啊 能不能长点心啊啊啊啊啊 还有注意第一句话的写法~ # include #include using namespace std; typedef long long i原创 2015-10-01 19:33:34 · 825 阅读 · 0 评论 -
弱校联萌十一大决战之背水一战C. Counting Pair
Bob hosts a party and invites N boys and M girls. He gives every boy here a unique number Ni(1 Now when Bob name a number X, if a boy and a girl wants and their numbers' sum equals to X, they can原创 2015-10-07 20:38:21 · 597 阅读 · 0 评论 -
弱校联萌十一大决战之背水一战A A Big Dinner
As is known to all, an ACM team consists of three members and to know more about each others, they often go to a restaurant to have a big dinner. Each member ordered himself only one dish, and wait原创 2015-10-07 19:50:27 · 494 阅读 · 0 评论 -
弱校联萌十一大决战之如日中天 G Gadget Hackwrench
Input/Output: standard input/output Chip 'n' Dale rescue rangers! But observant viewers know that help is usually required by Chip and Dale themselves. Today you are in the role of cunning Gadget Hac原创 2015-10-04 20:08:18 · 797 阅读 · 0 评论 -
弱校联萌十一大决战之如日中天A Ariel【二进制+排序】
这个题也是太不好懂了==看了过的代码才明白(⊙﹏⊙)b 不过当时就能想到二进制也挺欣慰的 什么叫做“相同的必须有,没有的必须没有,其他的无所谓?”==>后来查询中的给的特征与他本身的特征相比较,其中相同的特征其他参与排名的生物必须有,不同的特征其他参与排名生物必须没有,剩下的特征可有可无 output中第一句话'For each query output the place of a crea原创 2015-10-06 13:36:45 · 546 阅读 · 0 评论 -
弱校联萌十一大决战之厉兵秣马B. Building for UN poj3566
The United Nations has decided to build a new headquarters in Saint Petersburg, Russia. It will have a form of a rectangular parallelepiped and will consist of several rectangular floors, one on top o原创 2015-10-06 09:48:57 · 563 阅读 · 0 评论 -
弱校联萌十一大决战之厉兵秣马A ants【八皇后拓展】poj3565
Young naturalist Bill studies ants in school. His ants feed on plant-louses that live on apple trees. Each ant colony needs its own apple tree to feed itself. Bill has a map with coordinates of n ant原创 2015-10-06 09:36:42 · 547 阅读 · 0 评论 -
弱校联萌十一大决战之如日中天C Cinderella
Input/Output: standard input/output Cinderella is given a task by her Stepmother before she is allowed to go to the Ball. There are N (1 ≤ N ≤ 1000) bottles with water in the kitchen. Each bottle c原创 2015-10-04 20:01:49 · 743 阅读 · 0 评论 -
弱校联萌十一大决战之强力热身E Rectangle初中组合数学
题目啊 ~~ frog has a piece of paper divided into \(n\) rows and \(m\) columns. Today, she would like to draw a rectangle whose perimeter is not greater than \(k\). There are \(8\) (out of \原创 2015-10-01 21:15:52 · 963 阅读 · 0 评论 -
弱校联萌十一大决战之厉兵秣马H. Hanoi Towers poj3572
The “Hanoi Towers” puzzle consists of three pegs (that we will name A, B, and C) with n disks of different diameters stacked onto the pegs. Initially all disks are stacked onto peg A with the smalle原创 2015-10-06 11:05:17 · 913 阅读 · 4 评论