oj.uz

Submission #278366

# Submission time Handle Problem Language Result Execution time Memory
278366 2020-08-21T12:12:40 Z acm Awesome Arrowland Adventure (eJOI19_adventure) C++14
50 / 100
 1986 ms 5888 KB 
#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;
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;
  int st = clock();
  while (clock() - st < CLOCKS_PER_SEC * 1.95) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        if (ok(i - 1, j))
          dp[i][j] = min(dp[i][j], dp[i - 1][j] + cost[a[i - 1][j]]['S']);
        if (ok(i + 1, j))
          dp[i][j] = min(dp[i][j], dp[i + 1][j] + cost[a[i + 1][j]]['N']);
        if (ok(i, j - 1))
          dp[i][j] = min(dp[i][j], dp[i][j - 1] + cost[a[i][j - 1]]['E']);
        if (ok(i, j + 1))
          dp[i][j] = min(dp[i][j], dp[i][j + 1] + cost[a[i][j + 1]]['W']);
      }
    }
  }
  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;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1951 ms 396 KB Output is correct
2 Correct 1951 ms 428 KB Output is correct
3 Correct 1951 ms 400 KB Output is correct
4 Correct 1951 ms 384 KB Output is correct
5 Correct 1951 ms 396 KB Output is correct
6 Correct 1951 ms 480 KB Output is correct
7 Correct 1951 ms 400 KB Output is correct
8 Correct 1951 ms 400 KB Output is correct
9 Correct 1951 ms 400 KB Output is correct
10 Correct 1951 ms 400 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1951 ms 396 KB Output is correct
2 Correct 1951 ms 428 KB Output is correct
3 Correct 1951 ms 400 KB Output is correct
4 Correct 1951 ms 384 KB Output is correct
5 Correct 1951 ms 396 KB Output is correct
6 Correct 1951 ms 480 KB Output is correct
7 Correct 1951 ms 400 KB Output is correct
8 Correct 1951 ms 400 KB Output is correct
9 Correct 1951 ms 400 KB Output is correct
10 Correct 1951 ms 400 KB Output is correct
11 Correct 1951 ms 396 KB Output is correct
12 Correct 1951 ms 396 KB Output is correct
13 Correct 1951 ms 404 KB Output is correct
14 Correct 1951 ms 504 KB Output is correct
15 Correct 1951 ms 396 KB Output is correct
16 Correct 1951 ms 396 KB Output is correct
17 Correct 1951 ms 404 KB Output is correct
18 Correct 1951 ms 396 KB Output is correct
19 Correct 1951 ms 400 KB Output is correct
20 Correct 1951 ms 396 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1951 ms 412 KB Output is correct
2 Correct 1951 ms 412 KB Output is correct
3 Correct 1951 ms 384 KB Output is correct
4 Correct 1951 ms 420 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1951 ms 408 KB Output is correct
2 Correct 1951 ms 408 KB Output is correct
3 Correct 1951 ms 404 KB Output is correct
4 Correct 1951 ms 404 KB Output is correct
5 Correct 1951 ms 416 KB Output is correct
6 Correct 1951 ms 412 KB Output is correct
7 Correct 1951 ms 404 KB Output is correct
8 Correct 1951 ms 416 KB Output is correct
9 Correct 1951 ms 408 KB Output is correct
10 Correct 1951 ms 408 KB Output is correct

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1951 ms 396 KB Output is correct
2 Correct 1951 ms 428 KB Output is correct
3 Correct 1951 ms 400 KB Output is correct
4 Correct 1951 ms 384 KB Output is correct
5 Correct 1951 ms 396 KB Output is correct
6 Correct 1951 ms 480 KB Output is correct
7 Correct 1951 ms 400 KB Output is correct
8 Correct 1951 ms 400 KB Output is correct
9 Correct 1951 ms 400 KB Output is correct
10 Correct 1951 ms 400 KB Output is correct
11 Correct 1951 ms 396 KB Output is correct
12 Correct 1951 ms 396 KB Output is correct
13 Correct 1951 ms 404 KB Output is correct
14 Correct 1951 ms 504 KB Output is correct
15 Correct 1951 ms 396 KB Output is correct
16 Correct 1951 ms 396 KB Output is correct
17 Correct 1951 ms 404 KB Output is correct
18 Correct 1951 ms 396 KB Output is correct
19 Correct 1951 ms 400 KB Output is correct
20 Correct 1951 ms 396 KB Output is correct
21 Correct 1951 ms 412 KB Output is correct
22 Correct 1951 ms 412 KB Output is correct
23 Correct 1951 ms 384 KB Output is correct
24 Correct 1951 ms 420 KB Output is correct
25 Correct 1951 ms 408 KB Output is correct
26 Correct 1951 ms 408 KB Output is correct
27 Correct 1951 ms 404 KB Output is correct
28 Correct 1951 ms 404 KB Output is correct
29 Correct 1951 ms 416 KB Output is correct
30 Correct 1951 ms 412 KB Output is correct
31 Correct 1951 ms 404 KB Output is correct
32 Correct 1951 ms 416 KB Output is correct
33 Correct 1951 ms 408 KB Output is correct
34 Correct 1951 ms 408 KB Output is correct
35 Correct 1953 ms 984 KB Output is correct
36 Correct 1951 ms 384 KB Output is correct
37 Correct 1952 ms 1388 KB Output is correct
38 Correct 1953 ms 2764 KB Output is correct
39 Correct 1975 ms 5880 KB Output is correct
40 Correct 1959 ms 5888 KB Output is correct
41 Correct 1980 ms 5880 KB Output is correct
42 Correct 1986 ms 5888 KB Output is correct
43 Incorrect 1969 ms 5872 KB Output isn't correct
44 Halted 0 ms 0 KB -