Submission #61048

---

Source Code Expand

#include<queue>
#include<cstdio>
#include<climits>
#include<cstring>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

struct state{
	int t,x,y,k;
	bool operator<(const state &S)const{ return true; } // dummy
};

int main(){
	int h,w,n;
	char s[101]; scanf("%d%d%d%s",&h,&w,&n,s);
	static char B[100][101];
	rep(i,h) scanf("%s",B[i]);

	static short dp[101][100][100][4];
	rep(t,n+1) rep(i,h) rep(j,w) rep(k,4) dp[t][i][j][k]=SHRT_MAX;

	priority_queue< pair<int,state> > Q;
	rep(i,h) rep(j,w) rep(k,2) Q.push(make_pair(0,(state){0,j,i,k})), dp[0][i][j][k]=0;
	while(!Q.empty()){
		const state &S=Q.top().second; Q.pop();

		if(S.t==n){
			printf("%d\n",dp[S.t][S.y][S.x][S.k]);
			return 0;
		}

		rep(k2,4) if(k2!=S.k) {
			int x=S.x,y=S.y,cost=0;
			while(0<=x && x<w && 0<=y && y<h){
				x+=dx[k2];
				y+=dy[k2];
				cost++;
				int dp_next=dp[S.t][S.y][S.x][S.k]+cost;
				if(B[y][x]==s[S.t]){
					if(dp[S.t+1][y][x][k2]>dp_next){
						dp[S.t+1][y][x][k2]=dp_next;
						Q.push(make_pair(-dp_next,(state){S.t+1,x,y,k2}));
					}
					break;
				}
			}
		}
	}

	puts("-1");

	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:43: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:21:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result