题目：
M - Beijing Guards
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit Status Practice UVA 1335
Description
Beijing was once surrounded by four rings of city walls: ...
分类：
其他好文 时间：
2016-05-12 21:58:09
阅读次数：
181
Problem Description
Your current task is to make a ground plan for a residential building located in HZXJHS. So you must determine a way to split the floor building with walls to make apartments in t...
分类：
其他好文 时间：
2016-05-12 21:44:42
阅读次数：
198
DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.Angel’s friends wa...
分类：
编程语言 时间：
2016-05-12 20:29:27
阅读次数：
287
Beijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial City
Wall, the Inner City Wall, and ?nally the Outer City Wall. Most of these walls were demolished in
...
分类：
其他好文 时间：
2016-05-07 10:51:18
阅读次数：
167
http://acm.hdu.edu.cn/showproblem.php?pid=1010 DFS 太弱， 改了好几个小时才改好。 可能出现的问题： 1.TLE：剪枝 N * M - walls > T、(T - (abs(x - x_end) + abs(y - y_end)) - t) 为奇数 ...
分类：
其他好文 时间：
2016-04-16 21:34:02
阅读次数：
192
一个独立游戏 Teleglitch 使用了一种欺骗手法来模拟视锥，效果如下：
博主看了看了看提示
Actually, the line of sight shadows aren’t done with perspective. They are just black polygons extruded from the walls away from the player. ...
分类：
编程语言 时间：
2016-04-16 12:36:42
阅读次数：
215
题目：Walls 题意：给定一个图，求其中几个点相连最少要穿越的边数。 思路：这题的图要重新建，不能用原图，新图是这样的：将一个圈化为点，之间的关系是两个圈是否有公共边，然后就是求最短路问题了；
分类：
其他好文 时间：
2016-03-20 11:39:12
阅读次数：
130
You are given a m x n 2D grid initialized with these three possible values. Fill each empty room with the distance to its nearest gate. If it is impos
分类：
其他好文 时间：
2016-03-14 07:07:26
阅读次数：
130
原题链接在这里：https://leetcode.com/problems/walls-and-gates/ 题目： You are given a m x n 2D grid initialized with these three possible values. -1 - A wall or
分类：
其他好文 时间：
2016-02-29 07:07:02
阅读次数：
154
