oj.uz

답안 #425109

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
425109 2021-06-12T13:30:23 Z MilosMilutinovic Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 74 ms 2884 KB 
#include <bits/stdc++.h>

using namespace std;

const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
const int w[4][4] = {
  {0, 1, 2, 3},
  {3, 0, 1, 2},
  {2, 3, 0, 1},
  {1, 2, 3, 0}
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<string> t(n);
  vector<vector<int>> a(n, vector<int>(m));
  for (int i = 0; i < n; i++) {
    cin >> t[i];
    for (int j = 0; j < m; j++) {
      if (t[i][j] == 'N') a[i][j] = 0;
      if (t[i][j] == 'E') a[i][j] = 1;
      if (t[i][j] == 'S') a[i][j] = 2;
      if (t[i][j] == 'W') a[i][j] = 3;
      if (t[i][j] == 'X') a[i][j] = 4;
    }
  }
  multiset<tuple<int, int, int>> s;
  s.insert({0, 0, 0});
  const int inf = 1e9;
  vector<vector<int>> dist(n, vector<int>(m, inf));
  dist[0][0] = 0;
  while (!s.empty()) {
    auto it = s.begin();
    auto val = *it;
    s.erase(it);
    int d = get<0>(val), x = get<1>(val), y = get<2>(val);
    if (a[x][y] == 4) {
      continue;
    }
    for (int i = 0; i < 4; i++) {
      int nx = x + dx[i], ny = y + dy[i];
      int nd = d + w[a[x][y]][i];
      if (nx >= 0 && nx < n && ny >= 0 && ny < m && dist[nx][ny] > nd) {
        if (dist[nx][ny] < inf) {
            s.erase({dist[nx][ny], nx, ny});
        }
        dist[nx][ny] = nd;
        s.insert({dist[nx][ny], nx, ny});
      }
    }
  }
  int ans = dist[n - 1][m - 1];
  cout << (ans == inf ? -1 : ans) << '\n';
  return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 308 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 6 ms 444 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 9 ms 592 KB Output is correct
38 Correct 1 ms 716 KB Output is correct
39 Correct 68 ms 2868 KB Output is correct
40 Correct 66 ms 2884 KB Output is correct
41 Correct 5 ms 2760 KB Output is correct
42 Correct 65 ms 2860 KB Output is correct
43 Correct 74 ms 2764 KB Output is correct
44 Correct 6 ms 2764 KB Output is correct