bearBaby loves sleeping

https://ac.nowcoder.com/acm/contest/338/B

题解：BFS裸题

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=10000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans;
int a[N][N];
char str;
int x,y;
int vis[110][110];
int b[][2]={1,0,0,1,-1,0,0,-1};
struct node
{int x;int y;int lev;
}front1,tmp,start,end1;queue <node>Q;
int  bfs(node s,node e){while(!Q.empty())Q.pop();Q.push(s);while(!Q.empty()){front1=Q.front();Q.pop();//cout<<front1.x<<" "<<front1.y<<" "<<front1.lev<<endl;for(int i=0;i<4;i++){tmp.x=b[i][0]+front1.x;tmp.y=b[i][1]+front1.y;tmp.lev=front1.lev;tmp.lev++;if(e.x==tmp.x&&e.y==tmp.y){return tmp.lev;}if(tmp.x>=1&&tmp.x<=n&&tmp.y>=1&&tmp.y<=m&&a[tmp.x][tmp.y]!=1&&vis[tmp.x][tmp.y]==0){vis[tmp.x][tmp.y]=1;//cout<<tmp.x<<" "<<tmp.y<<" "<<tmp.lev<<endl;Q.push(tmp);}}}return -1;
}int main()
{
#ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout);
#endifscanf("%d%d",&n,&m);scanf("%d%d",&x,&y);for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)scanf("%d",&a[i][j]);vis[1][1]=1;start.x=1;start.y=1;start.lev=0;end1.x=x;end1.y=y;cout<<bfs(start,end1)<<endl;//cout << "Hello world!" << endl;return 0;
}

bearBaby loves sleeping相关推荐

Why Sleeping May Be More Important Than Studying
Why Sleeping May Be More Important Than Studying 转载于:https://www.cnblogs.com/Lamfai/p/10441451.html
Codeforces Round #FF 446 C. DZY Loves Fibonacci Numbers
參考:http://www.cnblogs.com/chanme/p/3843859.html 然后我看到在别人的AC的方法里还有这么一种神方法,他预先设定了一个阈值K,当当前的更新操作数j<K ...
hdu 4876 ZCC loves cards(暴力)
题目链接:hdu 4876 ZCC loves cards 题目大意:给出n,k,l,表示有n张牌,每张牌有值.选取当中k张排列成圈,然后在该圈上进行游戏,每次选取m(1≤m≤k)张连续的牌,取牌上值 ...
hdu 5273 Dylans loves sequence 逆序数简单递推
Dylans loves sequence Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem ...
Codeforces 447C - DZY Loves Sequences
447C - DZY Loves Sequences 思路:dp 代码: #include<bits/stdc++.h> using namespace std; #define ll l ...
Codeforces 446C —— DZY Loves Fibonacci Numbers（线段树）
题目:DZY Loves Fibonacci Numbers 题意比較简单,不解释了. 尽管官方的题解也是用线段树,但还利用了二次剩余. 可是我没有想到二次剩余,然后写了个感觉非常复杂度的线段树,还是 ...
解决Eclipse 启动后总是Building WorkSpace（sleeping）
2019独角兽企业重金招聘Python工程师标准>>> 今天打开eclipse后eclipse总是在Building WorkSpace(sleeping),我的解决方案是,Proj ...
linux devm_request_irq 引发BUG sleeping function called from invalid context问题
平台:msm8937+android7.1 问题和log 同样的代码在user版本上正常,但在userdebug版本上就有问题,设备反复重启. [ 29.288033] lm3492hc_bklt ...
c语言cin n1 n2,牛客等级之题N1 追债之旅 - N2 Rinne Loves Study（8.6场）
牛客等级之题N1-A.追债之旅(8.6场) 题目描述小明现在要追讨一笔债务,已知有n座城市,每个城市都有编号,城市与城市之间存在道路相连(每条道路都是双向的),经过任意一条道路需要支付费用.小明一开 ...

bearBaby loves sleeping

bearBaby loves sleeping相关推荐

最新文章

热门文章