搜索
理想主义文艺青年
理想主义源于对生活的憧憬 文艺是对生活的态度
展开
-
2014北京赛区现场赛B hdu 5113 Black And White
Black And White Problem Description In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figur原创 2014-11-30 02:21:46 · 868 阅读 · 0 评论 -
hdu 5305 Friends(搜索+剪枝)
Friends Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 490 Accepted Submission(s): 219 Problem Description There are n people原创 2015-07-24 01:56:57 · 777 阅读 · 0 评论 -
HNUOJ 13309 Intrepid climber(搜索)
Intrepid climber Time Limit: 2000ms, Special Time Limit:5000ms, Memory Limit:65536KB Total submit users: 16, Accepted users: 15 Problem 13309 : No special judgement Problem descrip原创 2015-07-25 17:50:38 · 815 阅读 · 0 评论 -
hdu 5215 Cycle(判断是否有奇数偶数的环)
Cycle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 179 Accepted Submission(s): 52 Problem Description Ery is interested in原创 2015-05-03 23:22:35 · 1582 阅读 · 3 评论 -
hdu 3839 Ancient Messages(搜索)
Ancient Messages Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 367 Accepted Submission(s): 124 Problem Description In order to原创 2015-04-17 00:01:34 · 964 阅读 · 0 评论 -
poj 2429 GCD & LCM Inverse(拉宾米勒测试+大数分解+dfs)
Language: Default GCD & LCM Inverse Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10452 Accepted: 1923 Description Given two positive integers a and原创 2015-04-09 23:06:31 · 679 阅读 · 0 评论 -
zoj 3864 Quiz for EXO-L(连通块 bfs)
Quiz for EXO-L Time Limit: 2 Seconds Memory Limit: 65536 KB Exo (Korean: 엑소; Chinese:爱咳嗽; often stylized as EXO) is a Chinese-South Korean boy band based in Seoul, South Korea. Formed by原创 2015-04-15 22:06:48 · 1360 阅读 · 0 评论 -
zoj 3861 Valid Pattern Lock(dfs)
Valid Pattern Lock Time Limit: 2 Seconds Memory Limit: 65536 KB Pattern lock security is generally used in Android handsets instead of a password. The pattern lock can be set by joining p原创 2015-04-15 12:17:07 · 640 阅读 · 0 评论 -
zoj 3865 Superbot(搜索)
题目链接:传送门 题意就是从一个点走到另一个点用到的最少的时间 但是这跟普通的搜索题又不一样的地方在于 我所在点面朝的方向会变 一个变化是自己主动去变 主动移动光标的位置 一个变化是被动的 光标自身动 导致当时所在点面朝的方向发生变化 月赛当天 没有做出来 主要是有两个问题 1)没有对单个时间进行考虑 2)每个点只能到达一次 并没有考虑 一个点可以被多次到达 #incl原创 2015-04-14 20:04:40 · 718 阅读 · 0 评论 -
fzu 2185 树的路径覆盖(dfs)
Problem 2185 树的路径覆盖 Accept: 69 Submit: 193 Time Limit: 2000 mSec Memory Limit : 32768 KB Problem Description 給一棵树, 用最少的路径去覆盖所有的边, 求(1)允许边被重复覆盖, (2)不允许边被重复覆盖. Input 第一行是组数T(原创 2015-04-08 08:52:11 · 672 阅读 · 0 评论 -
Poj 1419Graph Coloring(搜索|| 最大团)
Language: Default Graph Coloring Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4369 Accepted: 1979 Special Judge Description You are to write a p原创 2015-03-30 22:05:28 · 647 阅读 · 0 评论 -
hdu 5167 Fibonacci(dfs)
Fibonacci Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1003 Accepted Submission(s): 264 Problem Description Following is the原创 2015-02-03 17:51:08 · 720 阅读 · 0 评论 -
zoj 3838 Infusion Altar
Infusion Altar Time Limit: 2 Seconds Memory Limit: 65536 KB Bob is recently playing a game called Minecraft, especially a mod called Thaumcraft. It is a mod of magic. Usually, Bob has Ob原创 2014-11-30 21:50:32 · 1228 阅读 · 0 评论 -
水陆距离 搜索BFS
水陆距离 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 给定一个N x M的01矩阵,其中1表示陆地,0表示水域。对于每一个位置,求出它距离最近的水域的距离是多少。 矩阵中每个位置与它上下左右相邻的格子距离为1。 输入 第一行包含两个整数,N和M。 以下N行每行M个0或者1,代表地图。 数据保证至少原创 2017-03-12 15:28:17 · 730 阅读 · 0 评论