搜索
小伙子开的什么车啊
这个作者很懒,什么都没留下…
展开
-
HDU2586-How far away ?(LCA)
How far away ? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 19536 Accepted Submission(s): 7661 Problem Description There are n houses原创 2018-01-18 21:08:28 · 181 阅读 · 0 评论 -
HDU5040-Instrusive (优先队列+BFS)
The legendary mercenary Solid Matt gets a classic mission: infiltrate a military base. The military base can be seen as an N * N grid. Matt’s target is in one of the grids and Matt is now in another原创 2018-01-17 20:43:44 · 241 阅读 · 0 评论 -
HDOJ 1078 FatMouse and Cheese (DFS+DP)
Problem Description FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At e原创 2017-07-10 20:52:40 · 201 阅读 · 0 评论 -
Escape from Stones -DFS
Squirrel Liss lived in a forest peacefully, but unexpected trouble happens. Stones fall from a mountain. Initially Squirrel Liss occupies an interval [0, 1]. Next, nstones will fall and Liss will es原创 2017-07-04 12:29:47 · 335 阅读 · 0 评论 -
迷宫与宝藏(bfs)(未完成)
迷宫与宝藏 Description 机器人要在一个矩形迷宫里行动(不能原地停留,只能走向上/下/左/右),每移动一格花费1个单位时间。迷宫有以下几种元素:【*】 机器人的起点【#】 墙。机器人不能走过这些格子【.】 平地。机器人可以在上面自由行走【0-9】 宝藏。当机器人走到此处会立刻获得该数字相应的宝藏,宝藏不会消失,可以反复获取(但不能停留)若机器人要恰好获得总和为x的宝藏,它最少需原创 2017-01-15 15:08:40 · 457 阅读 · 0 评论 -
Codeforces Round #460 (Div. 2)-D Substring(Tarjian+记忆化搜索)
D. Substring You are given a graph with n nodes and m directed edges. One lowercase letter is assigned to each node. We define a path's value as the number of the most frequently occurring letter. For example,原创 2018-02-01 10:18:32 · 197 阅读 · 0 评论 -
Codeforces Round #461 (Div. 2) B. Magic Forest(DFS)
B. Magic Forest time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Imp is in a magic forest, where xorangles grow (wut?)A xorangle of order n原创 2018-02-26 19:57:38 · 129 阅读 · 0 评论