oj.uz

Submission #750243

# Submission time Handle Problem Language Result Execution time Memory
750243 2023-05-29T08:32:20 Z MuntherCarrot Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 183 ms 30896 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define int long long
#define endl '\n'
#define all(x) x.begin(),x.end()
const ll MOD = 1e9 + 7, SZ = 1e5 + 10, INF = 1e18;
vector<vector<int>> vtx(SZ);
int cst[4][4] = {
    {0, 1, 2, 3}, //N
    {3, 0, 1, 2}, //E
    {2, 3, 0, 1}, //S
    {1, 2, 3, 0}  //W
//   N  E  S  W
};
int32_t main(){
    // ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, m;
    cin >> n >> m;
    char arr[n][m];
    for(auto &I : arr){
        for(char &i : I)
            cin >> i;
    }
    int nds[n][m];
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++)
            nds[i][j] = i * m + j;
    }
    vector<vector<pair<int, int>>> mtx(n * m);
    // int mtx[n*m][n*m];
    // memset(mtx, -1, sizeof mtx);
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            int y = nds[i][j];
            int d;
            if(arr[i][j] == 'X')
                continue;
            if(arr[i][j] == 'N')
                d = 0;
            if(arr[i][j] == 'E')
                d = 1;
            if(arr[i][j] == 'S')
                d = 2;
            if(arr[i][j] == 'W')
                d = 3;
            if(j > 0)
                mtx[y].push_back({cst[d][3], nds[i][j - 1]});
            if(i > 0)
                mtx[y].push_back({cst[d][0], nds[i - 1][j]});
            if(j + 1 < m)
                mtx[y].push_back({cst[d][1], nds[i][j + 1]});
            if(i + 1 < n)
                mtx[y].push_back({cst[d][2], nds[i + 1][j]});
        }
    }
    // for(int i=0;i<n * m;i++){
    //     for(int j=0;j<n * m;j++)
    //         if(mtx[i][j] != -1)cout << mtx[i][j] << ' ';
    //     cout << endl;
    // }
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    q.push({0, 0});
    vector<int> ans(n * m, INT_MAX);
    bool vis[n * m] = {};
    while(!q.empty()){
        auto u = q.top();
        q.pop();
        if(vis[u.second])
            continue;
        // cout << u. first << ' ' << u.second << endl;
        vis[u.second] = 1;
        ans[u.second] = u.first;
        for(auto i : mtx[u.second]){
            // cout << i << ' '<< mtx[u.second][i] + u.first << endl;
            q.push({i.first + u.first, i.second});
        }
    }
    // for(int i=0;i<m*n;i++)
    //     cout << ans[i] << ' ';
    cout << (ans[n * m - 1] == INT_MAX ? -1 : ans[n * m - 1]);
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2584 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 3 ms 2644 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 2 ms 2584 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 13 ms 4260 KB Output is correct
36 Correct 2 ms 2772 KB Output is correct
37 Correct 14 ms 4564 KB Output is correct
38 Correct 9 ms 5492 KB Output is correct
39 Correct 125 ms 20424 KB Output is correct
40 Correct 131 ms 20392 KB Output is correct
41 Correct 48 ms 20300 KB Output is correct
42 Correct 126 ms 20472 KB Output is correct
43 Correct 183 ms 30896 KB Output is correct
44 Correct 49 ms 20296 KB Output is correct