oj.uz

답안 #834627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834627 2023-08-22T16:13:02 Z VMaksimoski008 Awesome Arrowland Adventure (eJOI19_adventure) C++14
10 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Node = array<int, 3>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int dr[4] = {0, -1, 0, 1};
int dc[4] = {-1, 0, 1, 0};

int32_t main() {
    setIO();

    int n, m;
    cin >> n >> m;

    int mat[n][m];
    for(int i=0; i<n; i++) {
        for(int j=0; j<m; j++) {
            char ch;
            cin >> ch;
            if(ch == 'X') mat[i][j] = -1;
            if(ch == 'E') mat[i][j] = 2;
            if(ch == 'W') mat[i][j] = 0;
            if(ch == 'N') mat[i][j] = 1;
            if(ch == 'S') mat[i][j] = 3;
        }
    }

    bool vis[n][m];
    vector<vector<int> > dist(n, vector<int>(m, 1e9));
    memset(vis, 0, sizeof(vis));

    dist[0][0] = 0;
    priority_queue<Node, vector<Node>, greater<Node> > pq;
    pq.push({ 0, 0, 0 });

    while(!pq.empty()) {
        int r = pq.top().at(1);
        int c = pq.top().at(2);
        int d = pq.top().at(0);
        pq.pop();

        if(vis[r][c]) continue;
        vis[r][c] = true;
        if(mat[r][c] == -1) continue;

        for(int i=0; i<4; i++) {
            int newR = r + dr[i];
            int newC = c + dc[i];
            if(newR < 0 || newR >= n) continue;
            if(newC < 0 || newC >= m) continue;
            
            int newDist = d + (i != mat[r][c]);

            if(dist[newR][newC] > newDist) {
                dist[newR][newC] = newDist;
                pq.push({ dist[newR][newC], newR, newC });
            }
        }
    }

    if(!vis[n-1][m-1]) cout << -1 << '\n';
    else cout << dist[n-1][m-1] << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -