二分查找 | 二分图
文章平均质量分 82
Shyazhut
One:自控,早睡早起身体好。
Three:自由并不是想做什么就做什么,而是想不什么就不做什么。
Two:他AC而我没AC的基本上是难题,我AC他没AC的一般是水题.....
展开
-
POJ 3258 River Hopscotch(牛过河问题,二分)
River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11391 Accepted: 4890DescriptionEvery year the cows hold an event featuring a peculiar v原创 2016-07-27 09:51:50 · 641 阅读 · 0 评论 -
CodeForces 337C Quiz(二分,快速幂,答题得分最小值)
C. Quiztime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputManao is taking part in a quiz. The quiz consists of原创 2016-10-22 23:11:49 · 398 阅读 · 0 评论 -
HDU/HDOJ 2063 过山车(二分图最大匹配,vector的使用)
题意:裸裸地二分图模板,上次巧是什么时候都不记得了......二维数组的模板都差点忘记了Code:vector 实现降低空间复杂度Code:二维数组实现#include#includeconst int MYDD=1103;const int MAXN=512;bool Map[MAXN][MAXN];//记录女生 i和男生 j 在一组i原创 2016-08-17 10:05:02 · 365 阅读 · 0 评论 -
CodeForces 448D Multiplication Table(二分,CodeForces,矩阵中找数字)
D. Multiplication Tabletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBizon the Champion isn't just charmi原创 2016-07-27 11:51:19 · 617 阅读 · 0 评论 -
HDU 1179
HDU 1179题意:单独翻译,英语较弱的就是很吃力(比如 me)!一些人去买魔法棒,反转的就是魔法棒选择跟着谁,你是店主,肯定想卖出最多的魔棒,回到了二分图的最大匹配问题。键入数据提示:(多组测试数据)顾客的数目 N ,魔法棒数目 M;接下来 M 行, 第 j 行的第一个数字是魔法棒中意的人数个数 K,依次是顾客编号。思路:二分图最大匹配的原创 2016-08-18 11:50:56 · 420 阅读 · 0 评论 -
ZZULI OJ 1918: G (宝塔寻宝,二分图最大匹配)
思路:简单的二分图最大匹配问题,原创 2016-08-17 17:06:07 · 813 阅读 · 0 评论 -
LightOJ 1062 Crossed Ladders(大楼距离,二分)
Cable masterTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionInhabitants of the Wonderland have decided to hold a regional progra原创 2016-07-27 10:09:53 · 435 阅读 · 0 评论 -
LightOJ 1137 Expanding Rods(加热变化的路,二分)
1137 - Expanding Rods(进入题目) PDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MBWhen a thin rod of length L is heated n degrees, i原创 2016-07-27 21:46:30 · 432 阅读 · 0 评论 -
HDU 1551 Cable master / UVALive 2452 Cable master(切电缆,二分)
Cable masterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3845 Accepted Submission(s): 1487Problem DescriptionInhabitants原创 2016-07-27 21:30:40 · 471 阅读 · 0 评论 -
CodeForces 373C Counting Kangaroos is Fun(袋鼠藏口袋,二分)
C. Counting Kangaroos is Funtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n kangaroos with pock原创 2016-07-27 19:54:58 · 381 阅读 · 0 评论 -
UVALive 3635 Pie (二分)
3635 - PieMy birthdayis coming up and traditionally I'm servingpie. Notjust one pie, no, I have a number N of them,of varioustastes and of various sizes. F of my friendsare comingto my par原创 2016-07-27 18:00:18 · 315 阅读 · 0 评论 -
NUBT 1651 Red packet(红包问题,二分,宁波工程学院在线评测)
[1651] Red packet时间限制: 1000 ms 内存限制: 65535 K问题描述New Year is coming! Our big boss Wine93 will distribute some “Red Package”, just like Alipay and Wechat.Wine93 has m yuan, he decides to原创 2016-07-27 11:03:55 · 827 阅读 · 0 评论 -
HDU 4004 The Frog's Games(青蛙过河,二分)
The Frog's GamesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 6136 Accepted Submission(s): 2985Problem DescriptionThe annua原创 2016-07-27 10:25:11 · 441 阅读 · 0 评论 -
HDU 2141 Can you find it?(数组找数字,二分)
Can you find it?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 23782 Accepted Submission(s): 6024Problem DescriptionGive yo原创 2016-07-27 10:20:26 · 463 阅读 · 0 评论 -
HDU 2199 Can you solve this equation?(二分法求近似解)
Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16588 Accepted Submission(s): 7366Problem Descripti原创 2016-07-27 10:02:09 · 287 阅读 · 0 评论 -
POJ 3041 Asteroids(摧毁小行星,二分图)
AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20910 Accepted: 11355DescriptionBessie wants to navigate her spaceship through a dangerous as原创 2016-10-28 20:05:15 · 234 阅读 · 0 评论