답안 #884731

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
884731	2023-12-08T09:42:13 Z	Perl32	Awesome Arrowland Adventure (eJOI19_adventure)	C++14	100 / 100	79 ms	19152 KB

adventure

/**
 *    author:  Perl32
 *    created: 18.11.2023 09:12:21
**/

#ifdef LOCAL
#  define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define ff first
#define ss second
#define szof(x) (int) x.size()
#define all(x) x.begin(), x.end()
#ifndef LOCAL
#  define cerr if (0) cerr
#endif

using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using ull = unsigned long long;

template<typename T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

const int INF = (int) 1e9 + 1e3;
const ll INFL = (ll) 1e18 + 1e9;
#ifdef LOCAL
    mt19937 tw(9450189);
#else
    mt19937 tw(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif
uniform_int_distribution<ll> ll_distr;
ll rnd(ll a, ll b) { return ll_distr(tw) % (b - a + 1) + a; }

signed main() {
#ifdef LOCAL
    freopen("inp.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    freopen("err.txt", "w", stderr);
    auto start_time = clock();
    cerr << setprecision(3) << fixed;
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;
    int dx[4] = {-1, 0, 1, 0};
    int dy[4] = {0, 1, 0, -1};
    auto valid = [&](int x, int y) {
        return x > -1 && x < n && y > -1 && y < m;
    };
    vector<vector<pii>> g(n * m);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            char c;
            cin >> c;
            if (c == 'X') {
                continue;
            }
            int st;
            if (c == 'W') {
                st = 3;
            } else if (c == 'E') {
                st = 1;
            } else if (c == 'N') {
                st = 0;
            } else {
                st = 2;
            }
            for (int k = 0; k < 4; ++k) {
                int x = i + dx[(st + k) % 4], y = j + dy[(st + k) % 4];
                if (valid(x, y)) {
                    g[i * m + j].emplace_back(x * m + y, k);
                }
            }
        }
    }
    set<pii> que;
    vector<int> dist(n * m, INF);
    dist[0] = 0;
    que.insert({0, 0});
    while (!que.empty()) {
        auto [d, u] = *que.begin();
        que.erase(que.begin());
        for (auto [to, w] : g[u]) {
            if (dist[to] > dist[u] + w) {
                que.erase({dist[to], to});
                dist[to] = dist[u] + w;
                que.insert({dist[to], to});
            }
        }
    }
    if (dist[n * m - 1] == INF) {
        cout << -1;
        return 0;
    }
    cout << dist[n * m - 1];

#ifdef LOCAL
    auto end_time = clock();
    cerr << "Execution time: " << (end_time - start_time) * (ll) 1e3 / CLOCKS_PER_SEC << " ms\n";
#endif
}

/*

 */

Compilation message

adventure.cpp: In function 'int main()':
adventure.cpp:87:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   87 |         auto [d, u] = *que.begin();
      |              ^
adventure.cpp:89:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   89 |         for (auto [to, w] : g[u]) {
      |                   ^

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	436 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	1 ms	604 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	0 ms	348 KB	Output is correct
10	Correct	0 ms	460 KB	Output is correct

Subtask #2

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	436 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	1 ms	604 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	0 ms	348 KB	Output is correct
10	Correct	0 ms	460 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 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	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 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	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	460 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	420 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct

Subtask #5

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	436 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	1 ms	604 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	0 ms	348 KB	Output is correct
10	Correct	0 ms	460 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	344 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	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	460 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	420 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	7 ms	1884 KB	Output is correct
36	Correct	1 ms	856 KB	Output is correct
37	Correct	8 ms	2152 KB	Output is correct
38	Correct	5 ms	2988 KB	Output is correct
39	Correct	77 ms	16972 KB	Output is correct
40	Correct	77 ms	16972 KB	Output is correct
41	Correct	25 ms	16732 KB	Output is correct
42	Correct	74 ms	17012 KB	Output is correct
43	Correct	79 ms	19152 KB	Output is correct
44	Correct	26 ms	16720 KB	Output is correct