JSU 2013 Summer Individual Ranking Contest - 5 密码:本套题选题权归JSU所有,需要密码请联系(http://blog.csdn.net/yew1eb). 一.套题分析:该套题难度不大,适合入门有一定基础的ACMer用于练习. 二.考点:逻辑思维.基础数论.数位运算基础.深度优先搜索.动态规划. 三.竞赛形式:个人赛 四.解题时间:3小时 五.题目情况: A. BNU ACM校队时间安排表        B. 硬币水题II        C. 沙漠之…

hdu 4786 Fibonacci Tree http://acm.hdu.edu.cn/showproblem.php?pid=4786 copyright@ts 算法源于ts,用最小生成树可以求出最小权值,把所有边权取反可以求出最大权值,算法是如果有个斐波那契数在最小到最大值之间,就一定能构成.也就是如果大了就把1边换成0边,反之亦然. #include<cstdio> #include<cstring> #include<algorithm> #define m…

Lights Against Dudely http://acm.hdu.edu.cn/showproblem.php?pid=4770 15个位置,所以可以暴力枚举那些放,对于放的再暴力枚举哪个转,对于转的,再枚举转哪个方向.选位置放我用了2进制枚举,选出哪个转和枚举4个方向for循环就行.可以加个小剪枝. #include<cstdio> #include<cstring> #include<algorithm> #define mt(a,b) memset(a,b…

http://acm.hdu.edu.cn/showproblem.php?pid=4771 题目大意: 给你一幅图(N*M)“@”是起点,"#"是墙,“.”是路,然后图上有K个珠宝, 问是否能全部取走珠宝,若能则输出最小步数,否则-1. 思路,可以bfs处理珠宝与珠宝,珠宝与起点的距离同时还可以判断是否可达, 最后因为K<=4,所以枚举路径输出最小ans #include <iostream> #include <cstdio> #include <…

参考:https://blog.csdn.net/sd_invol/article/details/15813671 要点 每个任务的结束时间是固定的,不受任何因素影响 机器只在最一开始有用,在那之后都是任务之间的转换 连边 将任务拆点,入点 i, 出点 i', 连边 (i, i' [1,1], 0) 设源点 s_, 汇点 t_ 对于机器 \(i (i \in [1, m])\), 连 (s_, i, 1, 0),即流量为1,费用为0 对每个任务 \(j\) 如果 \(C[i][j] \le s…

题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=4800 Problem Description A role-playing game (RPG and sometimes roleplaying game) is a game in which players assume the roles of characters in a fictional setting. Players take responsibility for acting…

Rabbit Kingdom Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 40    Accepted Submission(s): 20 Problem Description Long long ago, there was an ancient rabbit kingdom in the forest. Every rabbit…

Alice's Print Service Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1855    Accepted Submission(s): 454 Problem Description Alice is providing print service, while the pricing doesn't seem to…

Collision Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 685    Accepted Submission(s): 248Special Judge Problem Description There's a round medal fixed on an ideal smooth table, Fancy is tryin…

Just Random Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 87    Accepted Submission(s): 34 Problem Description Coach Pang and Uncle Yang both love numbers. Every morning they play a game with…