Submission #10941758

---

Source Code Expand

#include<bits/stdc++.h>
#define inf ((1<<30)-1)
#define linf ((1<<62)ll-1)
#define LL long long
#define F(i,a,b,c) for(register int i=(a);(b);i=(c))
#define Fu(i,a,b) for(register int i=(a);i<=(b);++i)
#define Fd(i,a,b) for(register int i=(a);i>=(b);--i)
#define Fn(i,a) for(register int i=las[(a)];i;i=nex[i])
#define COND(c) ((c)=='.'||(c)=='#'||(c)=='s'||(c)=='g')
int Fl,Pn,SI=100;char mch='\n',ch,Bf[21];
void chin(char&c){while((c=getchar())!='.'&&c!='#'&&c!='s'&&c!='g');}
template<typename t>void in(t&a){a=0;ch=getchar();Fl=1;while((ch<'0')||(ch>'9'))Fl=(ch=='-')?-Fl:Fl,ch=getchar();while((ch>='0')&&(ch<='9'))a=a*10+ch-'0',ch=getchar();a*=Fl;}
template<typename t>void out(t a){if(a<0)putchar('-'),a=-a;if(a==0)putchar('0');while(a)Bf[++Pn]=a%10+'0',a/=10;while(Pn)putchar(Bf[Pn]),--Pn;putchar(mch);}
template<typename t,typename ...ARGS>void in(t&a,ARGS&...args){in(a);in(args...);}
template<typename t,typename ...ARGS>void out(t a,ARGS... args){out(a);out(args...);}
using namespace std;
int n,m,bis[1001][1001],dis[1001][1001],sx,sy,ex,ey;char a[1001][1001];bool b[1001][1001],d[1001][1001];
#define canwalk(x,y) ((x)>=1&&(x)<=n&&(y)>=1&&(y)<=m&&a[(x)][(y)]!='#')
struct node{int x,y,s;};
int dx[5]={0,1,-1,0,0};
int dy[5]={0,0,0,1,-1};
void dbfs(int sx,int sy,int ex,int ey)
{
	queue<node>q,p;q.push({sx,sy,0});p.push({ex,ey,0});
	b[sx][sy]=1;
	while(!q.empty()&&!p.empty())
	{
		int qx=q.front().x,qy=q.front().y,px=p.front().x,py=p.front().y,qxx,qyy,pxx,pyy;
		Fu(i,1,4)
		{
			qxx=qx+dx[i];pxx=px+dx[i];
			qyy=qy+dy[i];pyy=qy+dy[i];
			if(canwalk(qxx,qyy)&&!b[qxx][qyy])
			{
				q.push({qxx,qyy,q.front().s+1});
				b[qxx][qyy]=1;bis[qxx][qyy]=q.front().s+1;
				if(d[qxx][qyy])
				puts("Yes"),exit(0);
			}
			if(canwalk(pxx,pyy)&&!d[pxx][pyy])
			{
				p.push({pxx,pyy,p.front().s+1});
				d[pxx][pyy]=1,dis[pxx][pyy]=p.front().s+1;
				if(b[pxx][pyy])
				puts("Yes"),exit(0);
			}
		}
		q.pop();
		p.pop();
	}
	puts("No");
}
int main()
{
	in(n,m);
	Fu(i,1,n)
	Fu(j,1,m)chin(a[i][j]);
	Fu(i,1,n)Fu(j,1,m){if(a[i][j]=='s')sx=i,sy=j;if(a[i][j]=='g')ex=i,ey=j;}
	dbfs(sx,sy,ex,ey);
	return 0;
}
//BY Segment_Tree_Juruo (2020严誉沣)

Submission Info

Compile Error

./Main.cpp:14:30: warning: variadic templates only available with -std=c++11 or -std=gnu++11
 template<typename t,typename ...ARGS>void in(t&a,ARGS&...args){in(a);in(args...);}
                              ^
./Main.cpp:14:58: warning: variadic templates only available with -std=c++11 or -std=gnu++11
 template<typename t,typename ...ARGS>void in(t&a,ARGS&...args){in(a);in(args...);}
                                                          ^
./Main.cpp:15:30: warning: variadic templates only available with -std=c++11 or -std=gnu++11
 template<typename t,typename ...ARGS>void out(t a,ARGS... args){out(a);out(args...);}
                              ^
./Main.cpp:15:59: warning: variadic templates only available with -std=c++11 or -std=gnu++11
 template<typename t,typename ...ARGS>void out(t a,ARGS... args){out(a);out(args...);}
                                                           ^
./Main.cpp: In function ‘void dbfs(int, int, int, int)’:
./Main.cpp:24:24: warning: extended initializer lists only avail...

Judge Result