katydid3018的博客

A - Oil Deposits Time Limit:3000MS    Memory Limit:0KB    64bit IO Format:%lld & %llu SubmitStatus Description The GeoSurvComp geologic survey company is responsible for detecting undergroun

首先找到墨水 把它变为# 先判断它的上下左右是否为空 如果是dfs 一开始想当然的认为碰到X就返回 是错的 只要它周围的四个点为空 都可以dfs下去 #include #include char map[50][100]; void dfs(int x, int y){ map[x][y] = '#'; if (map[x - 1][y] == '

Description By filling a rectangle with slashes (/) and backslashes ( ), you can generate nice little mazes. Here is an example: As you can see, paths in the maze cannot branch, so the whole

Description You 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 un