kuangbin带你飞
kuangbin带你飞
王江奎
这个作者很懒,什么都没留下…
展开
-
Find a way——BFS
【题目描述】Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki.Yifenfei’s home is at ...原创 2019-07-24 09:27:17 · 153 阅读 · 0 评论 -
Arbitrage——判断正环Bellman-Ford/SPFA
【题目描述】Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5...原创 2019-08-14 14:29:43 · 223 阅读 · 0 评论 -
Cow Contest——Floyed+连通性判断
【题目描述】N (1 ≤ N ≤ 100) cows, conveniently numbered 1…N, are participating in a programming contest. As we all know, some cows code better than others. Each cow has a certain constant skill rating that...原创 2019-08-14 11:06:35 · 176 阅读 · 0 评论 -
MPI Maelstrom——Dijkstra
【题目描述】BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee’s resear...原创 2019-08-14 10:28:36 · 172 阅读 · 0 评论 -
Wormholes——Bellman-Ford判断负环
【题目描述】While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time...原创 2019-08-13 16:39:13 · 242 阅读 · 0 评论 -
Currency Exchange——最短路Bellman-Ford算法
【题目描述】Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies. Th...原创 2019-08-13 14:17:15 · 248 阅读 · 0 评论 -
A计划——BFS
【题目描述】可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主,因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚,告招天下勇士来拯救公主。不过公主早已习以为常,她深信智勇的骑士LJ肯定能将她救出。现据密探所报,公主被关在一个两层的迷宫里,迷宫的入口是S(0,0,0),公主的位置用P表示,时空传输机用#表示...原创 2019-07-27 10:36:32 · 186 阅读 · 0 评论 -
Find The Multiple——简单搜索+大胆尝试
【题目描述】Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 an...原创 2019-07-23 10:23:30 · 129 阅读 · 0 评论 -
Catch That Cow——BFS
【题目描述】Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ...原创 2019-07-23 09:55:32 · 113 阅读 · 0 评论 -
Dungeon Master——BFS
【题目描述】You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north...原创 2019-07-23 08:56:05 · 144 阅读 · 0 评论 -
棋盘问题——DFS
【题目描述】在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及摆放棋子的数目。 n <= 8 , k <...原创 2019-07-23 08:51:37 · 649 阅读 · 0 评论 -
HDU - 4578Transformation——线段树+区间加法修改+区间乘法修改+区间置数+区间和查询+区间平方和查询+区间立方和查询
【题目描述】HDU - 4578TransformationProblem DescriptionYuanfang is puzzled with the question below:There are n integers, a1, a2, …, an. The initial values of them are 0. There are four kinds of operatio...原创 2019-07-26 17:00:30 · 471 阅读 · 0 评论 -
Pots——BFS
【题目描述】You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;DROP(i) empty t...原创 2019-07-26 10:04:00 · 148 阅读 · 0 评论 -
非常可乐——BFS
【题目描述】大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且 S==N+M...原创 2019-07-25 16:09:42 · 141 阅读 · 0 评论 -
Fire!——两个BFS
【题目描述】【题目分析】看到题目后很清楚是两个BFS,可是我觉得对于火的BFS可以转换成判断,我的做法是将火的位置全部记录下来,然后判断某个位置距离每个火的步数是否小于当前步数,可是错了,还不清楚为什么(有可能是因为没有记忆化复杂度太高?但是为什么是wa不是超时),改成BFS后就过了【AC代码】#include<cstdio>#include<cstring>...原创 2019-07-25 14:43:01 · 175 阅读 · 0 评论 -
Shuffle'm Up——简单模拟
【题目描述】A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C ch...原创 2019-07-25 10:49:27 · 179 阅读 · 0 评论 -
Fliptile——搜索+二进制优化
【题目描述】Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15; 1 ≤...原创 2019-07-24 10:55:16 · 130 阅读 · 0 评论 -
POJ 1511 Invitation Cards——Dijkstra优先队列优化+反向建图
【题目描述】In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies...原创 2019-08-15 15:24:58 · 171 阅读 · 0 评论