Submission #447294

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
447294	2021-07-25T20:54:45 Z	Agnimandur	Awesome Arrowland Adventure (eJOI19_adventure)	C++17	100 / 100	122 ms	24320 KB

adventure

#include <bits/stdc++.h>
 
#define ll long long
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define vl vector<long long>
#define pii pair<int, int>
#define pll pair<ll,ll>
#define add push_back
#define REP(i,a) for (int i = 0; i < (a); i++)
using namespace std;
template<typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
 
const int INF = 1005000000; 
//const ll MOD = 1000000007LL;
const ll MOD = 998244353LL;
 
 
 
int ni() {
    int x; cin >> x;
    return x;
}
 
ll nl() {
    ll x; cin >> x;
    return x;
}
 
double nd() {
    double x; cin >> x;
    return x;
}
 
string next() {
    string x; cin >> x;
    return x;
}


struct Dijkstra {
    vector<vector<pii>> graph;
    int N;

    Dijkstra(int N) {
        graph.assign(N,vector<pii>{});
        this->N=N;
    }

    void addEdge(int u, int v, int w) {
        graph[u].add(make_pair(v,w));
    }

    vl dijkstra(int root) {
        ll INF = 1000000000000000000LL;
        vl dists(N);
        dists.assign(N, INF);

        dists[root] = 0LL;
        minpq<pair<ll,int>> q;
        q.push({0LL, root});

        while (!q.empty()) {
            int v = q.top().second;
            ll d_v = q.top().first;
            q.pop();

            for (auto edge : graph[v]) {
                int to = edge.first;
                ll len = edge.second;

                if (d_v + len < dists[to]) {
                    dists[to] = d_v + len;
                    q.push({dists[to], to});
                }
            }
        }

        return dists;
    }
};


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N = ni();
    int M = ni();
    Dijkstra graph(N*M);
    string dir = "NESW";
    vvi dirs = {{-1,0},{0,1},{1,0},{0,-1}};
    REP(i,N) {
        string row = next();
        REP(j,M) {
            string c = row.substr(j,1);
            if (c=="X") continue;

            int x = i*M+j;
            int p = dir.find(c);
            REP(d,4) {
                int e = (d+p)%4;
                int newI = i+dirs[e][0];
                int newJ = j+dirs[e][1];
                if (newI >= 0 && newI < N && newJ >= 0 && newJ < M) {
                    int y = newI*M+newJ;
                    graph.addEdge(x,y,d);
                }
            }
        }
    }

    vl dists = graph.dijkstra(0);
    ll ans = dists[N*M-1];
    if (ans > 2000) ans = -1;
    cout << ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	308 KB	Output is correct

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	316 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	0 ms	308 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	8 ms	1860 KB	Output is correct
36	Correct	1 ms	460 KB	Output is correct
37	Correct	9 ms	2212 KB	Output is correct
38	Correct	8 ms	3116 KB	Output is correct
39	Correct	91 ms	17772 KB	Output is correct
40	Correct	90 ms	17820 KB	Output is correct
41	Correct	44 ms	17716 KB	Output is correct
42	Correct	94 ms	17848 KB	Output is correct
43	Correct	122 ms	24320 KB	Output is correct
44	Correct	43 ms	17688 KB	Output is correct

Submission #447294

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 12.0 / 12.0

Subtask #4 16.0 / 16.0

Subtask #5 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
12.0 / 12.0

Subtask #4
16.0 / 16.0

Subtask #5
50.0 / 50.0