제출 #554930

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
554930		alexdumitru	Awesome Arrowland Adventure (eJOI19_adventure)	C++14	100 / 100	79 ms	5076 KiB

adventure

#include <bits/stdc++.h>

#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")

using namespace std;

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

int n,m,i,j,k;
char a[505][505];
bool vis[505][505];
int dist[505][505];

bool in(int x, int y)
{
	return (x>0&&y>0&&x<=n&&y<=m);
}

struct nod{
	int cost;
	int x;
	int y;
};

int cost(char x, int y)
{
	if(y>=x)return y-x;
	return 4+y-x;
}

struct cmp{
	bool operator () ( nod a, nod b )
	{
		return a.cost > b.cost;
	}
};

priority_queue<nod,vector<nod>,cmp> q;


void solve()
{
	cin>>n>>m;
	for(i=1;i<=n;i++)
	{
		cin>>(a[i]+1);
		for(j=1;j<=m;j++)
		{
			if(a[i][j]=='X')a[i][j]=0;
			if(a[i][j]=='N')a[i][j]=1;
			if(a[i][j]=='E')a[i][j]=2;
			if(a[i][j]=='S')a[i][j]=3;
			if(a[i][j]=='W')a[i][j]=4;
			dist[i][j]=1e9;
		}		
	}
	q.push({0,1,1});
	dist[1][1]=0;
	while(!q.empty())
	{
		nod top = q.top();
		q.pop();
		int x=top.x;
		int y=top.y;
		int c=top.cost;
		if(vis[x][y]||!a[x][y])continue;
		vis[x][y]=1;
		for(k=1;k<5;k++)
		{
			int nx=x+dx[k];
			int ny=y+dy[k];
			int nc=c+cost(a[x][y],k);
			if(nc<dist[nx][ny])
			{
				dist[nx][ny]=nc;
				q.push({nc,nx,ny});
			}
		}
	}
	cout<<(dist[n][m]<1e9?dist[n][m]:-1)<<'\n';
}



signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 16 / 16
• Subtask 5: 50 / 50