제출 #750262

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
750262		MrM7md	Awesome Arrowland Adventure (eJOI19_adventure)	C++17	50 / 100	2086 ms	1604 KiB

adventure

#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define all(a) a.begin(),a.end()
const int N=1e6+500;
const int off=(1<<18);
const int MOD = 1e9+7;

char ch[502][502];
int val[502][502];

void dijkstra(int a,int b){
   priority_queue<pair<int,int>>pq;
   pq.push({a,b});
   while(!pq.empty()){
      int x=pq.top().F,y=pq.top().S;
      pq.pop();
      if(ch[x][y]=='X')return ;
      int l=INT_MAX,r=INT_MAX,u=INT_MAX,d=INT_MAX;

      if(ch[x][y]=='E')r=0,l=2,u=3,d=1;
      if(ch[x][y]=='N')r=1,l=3,u=0,d=2;
      if(ch[x][y]=='W')r=2,l=0,u=1,d=3;
      if(ch[x][y]=='S')r=3,l=1,u=2,d=0;


      if(val[x-1][y]>(val[x][y]+u) ){
         val[x-1][y]=val[x][y]+u;
         if(ch[x-1][y]!='X')
         pq.push({x-1,y});
      }
      if(val[x+1][y]>(val[x][y]+d) ){
         val[x+1][y]=val[x][y]+d;
         if(ch[x+1][y]!='X')
         pq.push({x+1,y});
      }
      if(val[x][y-1]>(val[x][y]+l) ){
         val[x][y-1]=val[x][y]+l;
         if(ch[x][y-1]!='X')
         pq.push({x,y-1});
      }
      if(val[x][y+1]>(val[x][y]+r) ){
         // cout<<dist(x,y,x,y+1)<<'\n';
         val[x][y+1]=val[x][y]+r;
         if(ch[x][y+1]!='X')
         pq.push({x,y+1});
      }

   }
}
signed main(){
   ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
   int n,m;
   cin >> m >> n;
   // memset(val,-1,sizeof(val));
   for(int i=0;i<=501;i++){
      for(int j=0;j<=501;j++){
         ch[i][j]='X';
         val[i][j]=-1;
      }
   }
   for(int i=1;i<=m;i++){
      for(int j=1;j<=n;j++){
         val[i][j]=1e9;
         cin >> ch[i][j];
      }
   }
   val[1][1]=0;
   dijkstra(1,1);
   if(val[m][n]==1e9)val[m][n]=-1;
   cout<<val[m][n];
}

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