搜索
尒轩窗
这个作者很懒,什么都没留下…
展开
-
O - 15
DescriptionInhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It wa原创 2017-05-15 19:27:05 · 195 阅读 · 0 评论 -
D - 04
Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。 每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及原创 2017-05-31 21:48:46 · 291 阅读 · 0 评论 -
HDU 5305 Friends
http://acm.hdu.edu.cn/showproblem.php?pid=5305题意:n个人m个朋友关系,保证每一个人的朋友关系中在线关系和非在线关系相等,有多少种可能分析:1.如果存在某个人的朋友关系为奇数,则为0种方法2.暴力深搜,将m个关系分为两种情况,为0或为1满足条件继续深搜代码:#include<bits/stdc++.h>usi...原创 2018-07-16 21:20:21 · 143 阅读 · 0 评论 -
Two Graphs
链接:https://www.nowcoder.com/acm/contest/139/D 题目描述Two undirected simple graphs and where are isomorphic when there exists a bijection on V satisfying if and only if {x, y} ∈ E2.Given two gr...原创 2018-07-19 21:26:32 · 357 阅读 · 0 评论 -
MZL's endless loop
Problem DescriptionAs we all kown, MZL hates the endless loop deeply, and he commands you to solve this problem to end the loop.You are given an undirected graph with $n$ vertexs and $m$ edges. Ple...原创 2018-08-01 21:04:23 · 185 阅读 · 0 评论 -
Age of Moyu(bfs)2018 Multi-University Training Contest 7
http://acm.hdu.edu.cn/showproblem.php?pid=6386题意:找到从1到n的最小花费,如果路径的相邻的两个ci,不一样就增加一个花费分析:用bfs找出从1到n的最小花费,只需要将需要更新的加入队列,然后乱搞,然后优化,否则容易tle代码:#include<bits/stdc++.h>using namespace std;...原创 2018-08-13 21:26:57 · 177 阅读 · 1 评论 -
2015ACM/ICPC 北京赛区现场赛C —Today Is a Rainy Day【bfs】
http://media.hihocoder.com/contests/icpcbeijing2015/problems.pdf题意:将字符串2变成字符串1,有两种改变方法1.将所有的同一字符换成另一种字符,只需要一步2.将一个字母换成另一个字母,只需要一步求出最少的改变次数分析:先bfs只进行第一种操作的所有可能方案,之后只进行2操作代码:#in...原创 2018-09-30 20:49:40 · 336 阅读 · 0 评论 -
2016 ACM/ICPC大连区域赛 A— Wrestling Match【2-sat】
http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1001&cid=736Wrestling MatchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 7...原创 2018-10-03 16:13:27 · 307 阅读 · 0 评论 -
2016 ACM/ICPC 北京区域赛 E—What a Ridiculous Election 【bfs】
https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5694题意:给你一个字符串,长度是5,每一个字母都是‘0’到‘9’,将它转换成给出的字符串最少多少步。操作如下:1、交换任意相邻的两个数,无次数...原创 2018-10-04 20:39:02 · 284 阅读 · 0 评论 -
2016 ACM/ICPC 沈阳区域赛E— Counting Cliques 【dfs】
题意:n(n<=100)个点,m(m<=1000)个边,每个点的度不超过20,的无向图,问里面有几个子图是s元完全图分析:暴力深搜加点小技巧,将双向边变成单向边,只从编号小的向编号大的建边,之后从小打到扫描点,记录路径,判断该点是否与之前路径中的点都有一条边,这是一种剪枝方法。同时判断当前路径中的点跟这个点的指向的的点和是否大于等于S,否则剪枝代码:#in...原创 2018-10-06 21:26:16 · 323 阅读 · 0 评论 -
B - 02
DescriptionBackgroundThe knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey around the world. Whenever a knight moves, it is tw...原创 2017-05-31 21:34:36 · 394 阅读 · 0 评论 -
F - 06
DescriptionTechnicians in a pathology lab analyze digitized images of slides. Objects on a slide are selected for analysis by a mouse click on the object. The perimeter of the boundary of an obj原创 2017-05-31 21:29:17 · 176 阅读 · 0 评论 -
N - 14
DescriptionIgnatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息: 密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0注意:由于宝藏的历史久远,当时的系统最多只能保存500位密码.因此如果得到的密码长度大于500也不能用来开启房门,这种情况也被原创 2017-05-31 20:55:37 · 451 阅读 · 0 评论 -
Q - 17
DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime. No原创 2017-05-15 19:39:33 · 455 阅读 · 0 评论 -
P - 16
DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid原创 2017-05-15 19:51:42 · 200 阅读 · 0 评论 -
G - 07
DescriptionFarmer 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原创 2017-05-15 20:13:51 · 174 阅读 · 0 评论 -
H - 08
DescriptionGiven 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 t原创 2017-05-15 20:19:50 · 182 阅读 · 0 评论 -
T - 20
DescriptionBackgroundMr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him? The ProblemYour ta原创 2017-05-30 21:39:43 · 394 阅读 · 1 评论 -
L - 12
DescriptionYou 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原创 2017-05-30 21:55:06 · 349 阅读 · 0 评论 -
J - 10
DescriptionA 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 conta原创 2017-05-30 22:16:05 · 231 阅读 · 0 评论 -
S - 19
Description自从2006年3月10日至11日的首届数独世界锦标赛以后,数独这项游戏越来越受到人们的喜爱和重视。 据说,在2008北京奥运会上,会将数独列为一个单独的项目进行比赛,冠军将有可能获得的一份巨大的奖品———HDU免费七日游外加lcy亲笔签名以及同hdu acm team合影留念的机会。 所以全球人民前仆后继,为了奖品日夜训练茶饭不思。当然也包括初学者linle,原创 2017-05-31 20:29:38 · 236 阅读 · 0 评论 -
I - 09
DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. — It原创 2017-05-31 20:43:50 · 210 阅读 · 0 评论 -
2015 ACM/ICPC北京赛区现场赛G—Mysterious Antiques in Sackler Museum【dfs】
http://media.hihocoder.com/contests/icpcbeijing2015/problems.pdf题意:给你四个矩形,从中选出3个矩形【读题的时候没有看出只选三个矩形,交了三发罚时】,判断是否可以组成一个大的矩形分析:暴力深搜,先全排列判断顺序。。然后判断前两个是否可以组成一个新的,然后把这个矩形传递下去代码:#include<...原创 2018-09-29 19:07:31 · 154 阅读 · 0 评论