#include <bits/stdc++.h>
using namespace std;
/*<DEBUG>*/
#define tem template <typename
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
~debug(){ cerr << endl; }
tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
tem T, typename U > _op (pair<T, U> i){
return *this << "< " << i.first << " , " << i.second << " >"; }
tem T> _op (itr<T> i){
*this << "{ ";
for(auto it = i.begin; it != i.end; it++){
*this << " , " + (it==i.begin?2:0) << *it;
}
return *this << " }";
}
#else
tem T> _op (const T&) { return *this; }
#endif
};
string _ARR_(int* arr, int sz){
string ret = "{ " + to_string(arr[0]);
for(int i = 1; i < sz; i++) ret += " , " + to_string(arr[i]);
ret += " }"; return ret;
}
#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array
const int INF = 1e9 + 7, N = 501;
int nxt[4] = {1, 2, 3, 0};
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int best[N][N], g[N][N], n, m;
map<char, int> mp;
// 0 : N (up)
// 1 : E (right)
// 2 : S (down)
// 3 : W (left)
bool possible(int x, int y){
return (x==n-1&&y==m-1) || (x>=0&&y>=0&&x<n&&y<m&&g[x][y]!=4);
}
int main(void)
{
FAST;
mp['N'] = 0;
mp['E'] = 1;
mp['S'] = 2;
mp['W'] = 3;
mp['X'] = 4;
cin >> n >> m;
for(int i = 0; i < n; ++i){
string s; cin >> s;
for(int j = 0; j < m; ++j){
g[i][j] = mp[s[j]];
best[i][j] = INF;
}
}
priority_queue< ar<int,3>, vector<ar<int,3>>, greater<ar<int,3>> > pq;
pq.push({0, 0, 0});
best[0][0] = 0;
if(g[0][0] == X){
cout << -1 << '\n';
return 0;
}
while(pq.size()){
auto p = pq.top();
pq.pop();
int cost = p[0];
int x = p[1], y = p[2];
if(x == n-1 && y == m-1) break;
int d = g[x][y];
for(int c = 0; c < 4; ++c){
int nx = x + dx[d], ny = y + dy[d];
if(possible(nx, ny) && c+cost < best[nx][ny]){
best[nx][ny] = c+cost;
pq.push({best[nx][ny], nx, ny});
}
d = nxt[d];
}
}
cout << (best[n-1][m-1] == INF ? -1 : best[n-1][m-1]) << '\n';
return 0;
}
Compilation message
adventure.cpp: In function 'int main()':
adventure.cpp:92:16: error: 'X' was not declared in this scope
92 | if(g[0][0] == X){
| ^
