This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define oprecision \
cout.precision(30); \
cerr.precision(7);
#define ll long long
#define ld long double
#define ss string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) \
for (int i = l; (l > r ? i >= r : i <= r); (l > r ? i-- : i++))
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define pb(x) push_back(x)
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define mp(x, y) make_pair(x, y)
#define F first
#define S second
using namespace std;
int n, m, dp[5005][5005];
char a[5005][5005];
map<char, map<char, int>> cost;
priority_queue<pair<int, pair<int, int>>> s;
bool ok(int i, int j) { return ((1 <= i && i <= n) && (1 <= j && j <= m)); }
int main() {
speed;
oprecision;
// code
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
dp[i][j] = 1e9;
}
}
dp[1][1] = 0;
cost['W']['N'] = cost['N']['E'] = cost['E']['S'] = cost['S']['W'] = 1;
cost['W']['E'] = cost['N']['S'] = cost['E']['W'] = cost['S']['N'] = 2;
cost['W']['S'] = cost['N']['W'] = cost['E']['N'] = cost['S']['E'] = 3;
cost['X']['S'] = cost['X']['N'] = cost['X']['E'] = cost['X']['W'] = 1e9;
s.push(mp(0, mp(1, 1)));
while (sz(s)) {
int i = s.top().S.F, j = s.top().S.S;
s.pop();
if (ok(i - 1, j) && dp[i - 1][j] > dp[i][j] + cost[a[i][j]]['N']) {
dp[i - 1][j] = dp[i][j] + cost[a[i][j]]['N'];
s.push(mp(-dp[i - 1][j], mp(i - 1, j)));
}
if (ok(i + 1, j) && dp[i + 1][j] > dp[i][j] + cost[a[i][j]]['S']) {
dp[i + 1][j] = dp[i][j] + cost[a[i][j]]['S'];
s.push(mp(-dp[i + 1][j], mp(i + 1, j)));
}
if (ok(i, j - 1) && dp[i][j - 1] > dp[i][j] + cost[a[i][j]]['W']) {
dp[i][j - 1] = dp[i][j] + cost[a[i][j]]['W'];
s.push(mp(-dp[i][j - 1], mp(i, j - 1)));
}
if (ok(i, j + 1) && dp[i][j + 1] > dp[i][j] + cost[a[i][j]]['E']) {
dp[i][j + 1] = dp[i][j] + cost[a[i][j]]['E'];
s.push(mp(-dp[i][j + 1], mp(i, j + 1)));
}
}
cout << (dp[n][m] == 1e9 ? -1 : dp[n][m]);
// endl
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |