专题一 简单搜索
kuangbin专题一
Evolution957
这个作者很懒,什么都没留下…
展开
-
POJ3279 Fliptile
AC代码#include<stdio.h>#include<string.h>int t[30][30], tem[30][30], m[30][30];int M,N,dir[5][2] = { 0,0,1,0,0,1,-1,0,0,-1 };int get(int x, int y)//获得x,y点的颜色{ int c = t[x][y]; for (int i = 0; i < 5; i++) { int x1 = x + dir[i][0], y1转载 2020-09-02 09:25:28 · 61 阅读 · 0 评论 -
POJ3278 Catch That Cow
题目链接解题思路:简单的BFSAC代码#include<iostream>#include<cstdio>#include<queue>#include<cstring>using namespace std;typedef long long ll;int main(){ ll a,b,f,r; while(scanf("%lld %lld",&a,&b)!=EOF) { ll t原创 2020-09-02 09:08:25 · 85 阅读 · 0 评论 -
POJ2251 Dungeon Master(BFS)
题目链接借鉴博客AC代码#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#include<queue>using namespace std;typedef long long ll;char map[35][35][35];int vis[35][35][35];int k,n,m,sx原创 2020-09-02 08:57:04 · 110 阅读 · 0 评论 -
POJ 1321棋盘问题
题目链接借鉴博客AC代码:#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>using namespace std;typedef long long ll;char s[10][10];//棋盘int a[10];//标记每列是否放置过棋子int n,k;int cont,tot;//放置棋子个数、方原创 2020-08-24 08:44:47 · 79 阅读 · 0 评论