oj.uz

답안 #226630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
226630 2020-04-24T15:17:44 Z Theo830 Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 153 ms 32360 KB 
            #include <bits/stdc++.h>
            using namespace std;
            typedef long long ll;
            ll INF = 1e18+7;
            typedef pair<ll,ll> ii;
            #define iii pair<ii,ll>
            #define f(i,a,b) for(long long i = a;i < b;i++)
            #define rf(i,a,b) for(long long i=a;i>=b;i--)
            #define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
            #define w(t) while(t--)
            #define c(n); cin>>n;
            #define p(n) cout<<n;
            #define pl(n) cout<<n<<"\n";
            #define ps(n); cout<<n<<" ";
            #define F first
            #define S second
            #define pb(a) push_back(a)
            #define all(x) (x).begin(), (x).end()
            #define ull unsigned long long
            #define vll vector<ll>
            #define vii vector<ii>
            #define mkp make_pair
            #define ld long double
            #define arrin(a,n) f(i,0,n){cin>>a[i];}
            #define arrout(a,n) f(i,0,n){cout<<a[i]<<" ";}
            #define prllclock cerr<<"Time : "<<1000*(ld)clock()/(ld)CLOCKS_PER_SEC<<"ms\n";
            #define PI (2LL*acos(0))
            vll visit,taken;
            ll dist[500 * 500 + 5];
            vector<vll> adj;
            vii adj2LL[500 * 500 + 5];
            priority_queue<ii,vector<ii>, greater<ii> > pq;
            void dijkstra(ll s){pq.push(ii(0,s));dist[s] = 0;while(!pq.empty()){ii f = pq.top();pq.pop();ll w = f.F;ll u = f.S;if(w > dist[u]){continue;}for(auto v:adj2LL[u]){if(dist[u] + v.S < dist[v.F]){dist[v.F] = dist[u] + v.S;pq.push(ii(dist[v.F],v.F));}}}}
            int main(void){
                fastio;
                ll n,m;
                c(n);
                c(m);
                char arr[n][m];
                f(i,0,n){
                    f(j,0,m){
                        c(arr[i][j]);
                    }
                }
                swap(n,m);
                f(i,0,m){
                    f(j,0,n){
                        if(arr[i][j] == 'N'){
                            if(i-1 >= 0)
                            adj2LL[j*m+i].pb(ii(j*m+i-1,0));
                            if(j+1 <= n-1)
                            adj2LL[j*m+i].pb(ii((j+1)*m+i,1));
                            if(i+1 <= m-1)
                            adj2LL[j*m+i].pb(ii(j*m+i+1,2));
                            if(j-1 >= 0)
                            adj2LL[j*m+i].pb(ii((j-1) *m + i,3));
                        }
                        else if(arr[i][j] == 'E'){
                            if(i-1 >= 0)
                            adj2LL[j*m+i].pb(ii(j*m+i-1,3));
                            if(j+1 <= n-1)
                            adj2LL[j*m+i].pb(ii((j+1)*m+i,0));
                            if(i+1 <= m-1)
                            adj2LL[j*m+i].pb(ii(j*m+i+1,1));
                            if(j-1 >= 0)
                            adj2LL[j*m+i].pb(ii((j-1) *m + i,2));
                        }
                        else if(arr[i][j] == 'S'){
                            if(i-1 >= 0)
                            adj2LL[j*m+i].pb(ii(j*m+i-1,2));
                            if(j+1 <= n-1)
                            adj2LL[j*m+i].pb(ii((j+1)*m+i,3));
                            if(i+1 <= m-1)
                            adj2LL[j*m+i].pb(ii(j*m+i+1,0));
                            if(j-1 >= 0)
                            adj2LL[j*m+i].pb(ii((j-1) *m + i,1));
                        }
                        else if(arr[i][j] == 'W'){
                            if(i-1 >= 0)
                            adj2LL[j*m+i].pb(ii(j*m+i-1,1));
                            if(j+1 <= n-1)
                            adj2LL[j*m+i].pb(ii((j+1)*m+i,2));
                            if(i+1 <= m-1)
                            adj2LL[j*m+i].pb(ii(j*m+i+1,3));
                            if(j-1 >= 0)
                            adj2LL[j*m+i].pb(ii((j-1) *m + i,0));
                        }
                    }
                }
                f(i,0,n*m+5){
                    dist[i] = INF;
                }
                dijkstra(0);
                ll i = m-1;
                ll j = n-1;
                if(dist[j*m + i] >= INF){
                    pl(-1);
                    return 0;
                }
                pl(dist[j*m + i]);
            }

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6272 KB Output is correct
2 Correct 8 ms 6272 KB Output is correct
3 Correct 8 ms 6272 KB Output is correct
4 Correct 8 ms 6272 KB Output is correct
5 Correct 8 ms 6272 KB Output is correct
6 Correct 8 ms 6272 KB Output is correct
7 Correct 8 ms 6144 KB Output is correct
8 Correct 8 ms 6264 KB Output is correct
9 Correct 8 ms 6272 KB Output is correct
10 Correct 8 ms 6144 KB Output is correct
11 Correct 9 ms 6272 KB Output is correct
12 Correct 9 ms 6272 KB Output is correct
13 Correct 8 ms 6272 KB Output is correct
14 Correct 8 ms 6144 KB Output is correct
15 Correct 8 ms 6272 KB Output is correct
16 Correct 8 ms 6272 KB Output is correct
17 Correct 8 ms 6272 KB Output is correct
18 Correct 8 ms 6272 KB Output is correct
19 Correct 8 ms 6272 KB Output is correct
20 Correct 8 ms 6272 KB Output is correct
21 Correct 8 ms 6272 KB Output is correct
22 Correct 8 ms 6272 KB Output is correct
23 Correct 8 ms 6144 KB Output is correct
24 Correct 8 ms 6144 KB Output is correct
25 Correct 8 ms 6272 KB Output is correct
26 Correct 7 ms 6272 KB Output is correct
27 Correct 8 ms 6272 KB Output is correct
28 Correct 8 ms 6272 KB Output is correct
29 Correct 8 ms 6272 KB Output is correct
30 Correct 8 ms 6272 KB Output is correct
31 Correct 8 ms 6272 KB Output is correct
32 Correct 7 ms 6272 KB Output is correct
33 Correct 9 ms 6272 KB Output is correct
34 Correct 8 ms 6272 KB Output is correct
35 Correct 22 ms 7808 KB Output is correct
36 Correct 8 ms 6400 KB Output is correct
37 Correct 18 ms 8192 KB Output is correct
38 Correct 18 ms 9216 KB Output is correct
39 Correct 113 ms 24416 KB Output is correct
40 Correct 107 ms 24440 KB Output is correct
41 Correct 62 ms 24312 KB Output is correct
42 Correct 103 ms 24312 KB Output is correct
43 Correct 153 ms 32360 KB Output is correct
44 Correct 65 ms 24312 KB Output is correct