oj.uz

답안 #951826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
951826 2024-03-22T17:49:36 Z EJIC_B_KEDAX Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 268 ms 39656 KB 
#include <bits/stdc++.h>
#include <random>

#ifndef LOCAL
    //#pragma GCC optimize("O3")
    //#pragma GCC optimize("Ofast")
    //#pragma GCC optimize("unroll-loops")
    #pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")
#endif
using namespace std;
typedef long long ll;
typedef double dd;
typedef long double ld;
typedef unsigned int uii;
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

void solve();

mt19937_64 mt(1);

int32_t main() {
#ifdef LOCAL
    freopen("input.in", "r", stdin);
    freopen("output.out", "w", stdout);
#else
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    //freopen("amusing.in", "r", stdin);
    //freopen("amusing.out", "w", stdout);
#endif
    cout << fixed << setprecision(30);
    int tests = 1;
    //cin >> tests;
    while (tests--) {
        solve();
    }
}

pair<int, int> to[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};

bool check(int i, int j, pair<int, int> s, vector<vector<int>>& a) {
    return a[i][j] != 4 && i + s.x >= 0 && i + s.x < a.size() && j + s.y >= 0 && j + s.y < a[i].size() && a[i + s.x][j + s.y] != 4;
}

struct point {
    int i, j, w;
    point(int i1, int j1, int w1) {
        i = i1;
        j = j1;
        w = w1;
    }
};

bool operator < (const point& a, const point& b) {
    return a.w < b.w || (a.w == b.w && a.i < b.i) || (a.w == b.w && a.i == b.i && a.j < b.j);
}

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(n, vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            char x;
            cin >> x;
            if (x == 'N') {
                a[i][j] = 0;
            } else if (x == 'E') {
                a[i][j] = 1;
            } else if (x == 'S') {
                a[i][j] = 2;
            } else if (x == 'W') {
                a[i][j] = 3;
            } else {
                a[i][j] = 4;
            }
        }
    }
    a[n - 1][m - 1] = 0;
    vector<vector<vector<point>>> g(n, vector<vector<point>>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            for (int l = 0; l < 4; l++) {
                if (check(i, j, to[l], a)) {
                    g[i][j].emplace_back(i + to[l].x, j + to[l].y, (l - a[i][j] + 4) % 4);
                }
            }
        }
    }
    vector<vector<int>> dist(n, vector<int>(m, INT32_MAX));
    dist[0][0] = 0;
    multiset<point> st;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            st.emplace(i, j, dist[i][j]);
        }
    }
    while (!st.empty()) {
        auto s = *st.begin();
        if (s.w == INT32_MAX) {
            break;
        }
        st.erase(st.begin());
        for (auto i : g[s.i][s.j]) {
            if (st.find({i.i, i.j, dist[i.i][i.j]}) != st.end()) {
                st.erase(st.find({i.i, i.j, dist[i.i][i.j]}));
                dist[i.i][i.j] = min(dist[i.i][i.j], dist[s.i][s.j] + i.w);
                st.emplace(i.i, i.j, dist[i.i][i.j]);
            }
        }
    }
    if (dist[n - 1][m - 1] == INT32_MAX) {
        cout << "-1\n";
        return;
    }
    cout << dist[n - 1][m - 1] << '\n';
}

Compilation message

adventure.cpp: In function 'bool check(int, int, std::pair<int, int>, std::vector<std::vector<int> >&)':
adventure.cpp:45:52: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     return a[i][j] != 4 && i + s.x >= 0 && i + s.x < a.size() && j + s.y >= 0 && j + s.y < a[i].size() && a[i + s.x][j + s.y] != 4;
      |                                            ~~~~~~~~^~~~~~~~~~
adventure.cpp:45:90: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     return a[i][j] != 4 && i + s.x >= 0 && i + s.x < a.size() && j + s.y >= 0 && j + s.y < a[i].size() && a[i + s.x][j + s.y] != 4;
      |                                                                                  ~~~~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 460 KB Output is correct
35 Correct 19 ms 3416 KB Output is correct
36 Correct 1 ms 600 KB Output is correct
37 Correct 23 ms 4188 KB Output is correct
38 Correct 13 ms 6236 KB Output is correct
39 Correct 268 ms 35644 KB Output is correct
40 Correct 258 ms 35524 KB Output is correct
41 Correct 89 ms 35332 KB Output is correct
42 Correct 265 ms 35668 KB Output is correct
43 Correct 251 ms 39656 KB Output is correct
44 Correct 89 ms 35412 KB Output is correct