Submission #1020803

#	Time	Username	Problem	Language	Result	Execution time	Memory
1020803		adrielcp	Awesome Arrowland Adventure (eJOI19_adventure)	C++17	38 / 100	1 ms	604 KiB

adventure

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lld double
#define int ll
#define usaco(fname) freopen(#fname ".in","r",stdin);freopen(#fname ".out","w",stdout);
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// const ll INF = 1e18;
const int INF = 1e18;
const int mod = 1e9+7;
const lld PI = acos(-1.0);
int di[] = {-1, 0, 1, 0};
int dj[] = {0, 1, 0, -1};
#define debug(x) cout << #x << ": " << x << endl;
#define add(a, b) a += b, a %= mod
#define mul(a, b) ((a % mod) * (b % mod)) % mod
#define all(x) x.begin(),x.end()

map<char, int> mp;

int calc(char x, int y) {
  return (((y - mp[x]) % 4) + 4) % 4;
}

#define info tuple<int, int, int>
void solve() {
  mp['N'] = 0;mp['E'] = 1;mp['S'] = 2;mp['W'] = 3;
  int n,m;cin>>n>>m;
  vector<string> grid(n);
  for (int i = 0; i < n; i++) cin >> grid[i];
  priority_queue<info, vector<info>, greater<info>> pq;
  pq.push({0, 0, 0});
  vector<vector<int>> dist(n, vector<int>(m, INF));
  while (!pq.empty()) {
    auto [cost, i, j] = pq.top();pq.pop();
    if (cost > dist[i][j]) continue;
    dist[i][j] = cost;

    //     debug(cost);
    // debug(i);
    // debug(j);
    // cout << endl;

    for (int k = 0; k < 4; k++) {
      int nexti = i + di[k], nextj = j + dj[k];
      if (nexti >= 0 && nexti < n && nextj >= 0 && nextj < m && cost + calc(grid[i][j], k) < dist[nexti][nextj]) {
        if (!(nexti == n-1 && nextj == m-1) && grid[nexti][nextj] == 'X') continue; 
        dist[nexti][nextj] = cost + calc(grid[i][j], k);
        pq.push({cost + calc(grid[i][j], k), nexti, nextj});
      }
    }
  }

  cout << (dist[n-1][m-1] == INF ? -1 : dist[n-1][m-1]) << endl;
}

int32_t main() {
  ios_base::sync_with_stdio(0);cin.tie(0);
  int t=1;
  while(t--) solve();

  return 0;
}

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