Lngxling的博客

Catch That Cow Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 97906   Accepted: 30748 Description Farmer John has been informed of the location of a fugit

迷宫问题 Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 24702   Accepted: 14422 Description 定义一个二维数组：  int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0,

Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s location in the

Prime Path Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 23030   Accepted: 12756 Description The ministers of the cabinet were quite upset by the message

Problem 2150 Fire Game Accept: 2713    Submit: 9264 Time Limit: 1000 mSec    Memory Limit : 32768 KB  Problem Description Fat brother and Maze are playing a kind of special (hentai) game o

C. The Tag Game time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Alice got tired of playing the tag game by t

D. Biridian Forest time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You're a mikemon breeder currently in th

题意： 从Y走到T的最短路径，走E和T需要一秒，B需要两秒，R和S不能走 思路： bfs一下，记录到每个点的最短路径长度 #include <iostream> #include <queue> #include <cstring> #include <cstdio> using namespace std; #define mod 100...

思路： 有三个容器，每个最大是100，共有100*100*100=1e6种状态，深搜记录一下每种状态和这种状态的最小步数 深搜时遍历每个容器，如果这个容器里有可乐，就尝试着倒入另外两个容器里 #include <iostream> #include <cstdio> #include <cmath> #include <vector> #in...