oj.uz

답안 #826424

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
826424 2023-08-15T14:44:12 Z brotherDemonInHell Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 68 ms 27228 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll = int;
using ld = long double;

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
gp_hash_table<ll, ll, custom_hash> app;
//const int MOD = 998244353;
//const int MOD = 1e9 + 7;

const ll INF = 1e9;

vector<string> a;


ll n, m, k, q, x, y, z, w, h, T;
string s, t;
double p;

char conv(ll delx, ll dely) {
    if (delx == 1) {
        return 'S';
    }
    if (delx == -1) {
        return 'N';
    }
    if (dely == 1) {
        return 'E';
    }
    return 'W';
}

ll distan(char c1, char c2) {
    vector<ll> here;
    for (char c : {c1, c2}) {
        if (c == 'N') here.push_back(0);
        else if (c == 'E') here.push_back(1);
        else if (c == 'S') here.push_back(2);
        else here.push_back(3);
    }
    return (here[1] - here[0] + 4) % 4;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    T = 1;
    //cin >> T;
    while (T--) {    
        cin >> n >> m;
        a.assign(n, "");
        for (int i = 0; i <  n; i++) {
            cin >> a[i];
        }
        vector<vector<bool>> vis(n, vector<bool>(m));
        vector<vector<ll>> dist(n, vector<ll>(m, INF));
        vector<vector<pair<ll, ll>>> q(3 * n * m + 10);
        vector<ll> ptr(3 * n * m + 10);
        ll cur = 0;
        dist[0][0] = 0;
        q[0].push_back({0, 0});
        ll ans = -1;
        while (cur < q.size()) {
            if (ptr[cur] == q[cur].size()) {
                cur++;
                continue;
            }
            pair<ll, pair<ll, ll>> top = {cur, q[cur][ptr[cur]]};
            ptr[cur]++;
            x = top.second.first;
            y = top.second.second;
            if (x == n - 1 && y == m - 1) {
                ans = top.first;
                break;
            }
            if (vis[x][y] || a[x][y] == 'X') continue;
            vis[x][y] = true;

            for (ll delx : {-1, 1}) {
                ll dely = 0;
                if (delx + x < 0 || delx + x >= n || dely + y < 0 || dely + y >= m 
                || ((delx + x != n - 1 || dely + y != m - 1) && a[delx + x][dely + y] == 'X')) continue;
                ll here = distan(a[x][y], conv(delx, dely));
                if (dist[x][y] + here < dist[x + delx][y + dely]) {
                    dist[x + delx][y + dely] = dist[x][y] + here;
                    q[dist[x + delx][y + dely]].push_back({x + delx, y + dely});
                }
            }
            for (ll dely : {-1, 1}) {
                ll delx = 0;
                if (delx + x < 0 || delx + x >= n || dely + y < 0 || dely + y >= m 
                || ((delx + x != n - 1 || dely + y != m - 1) && a[delx + x][dely + y] == 'X')) continue;
                ll here = distan(a[x][y], conv(delx, dely));
                if (dist[x][y] + here < dist[x + delx][y + dely]) {
                    dist[x + delx][y + dely] = dist[x][y] + here;
                    q[dist[x + delx][y + dely]].push_back({x + delx, y + dely});
                }
            }
        }

        printf("%i\n", ans);
    }


}

Compilation message

adventure.cpp: In function 'int main()':
adventure.cpp:80:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::vector<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         while (cur < q.size()) {
      |                ~~~~^~~~~~~~~~
adventure.cpp:81:26: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |             if (ptr[cur] == q[cur].size()) {

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 320 KB Output is correct
26 Correct 0 ms 320 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 316 KB Output is correct
34 Correct 1 ms 320 KB Output is correct
35 Correct 5 ms 2516 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 6 ms 2900 KB Output is correct
38 Correct 2 ms 3916 KB Output is correct
39 Correct 54 ms 25132 KB Output is correct
40 Correct 68 ms 25068 KB Output is correct
41 Correct 13 ms 22356 KB Output is correct
42 Correct 56 ms 25076 KB Output is correct
43 Correct 63 ms 27228 KB Output is correct
44 Correct 13 ms 22344 KB Output is correct