oj.uz

Submission #232192

# Submission time Handle Problem Language Result Execution time Memory
232192 2020-05-16T10:53:41 Z Dremix10 Awesome Arrowland Adventure (eJOI19_adventure) C++17
50 / 100
 2000 ms 49884 KB 
#include <bits/stdc++.h>
using namespace std;

struct ano{

int c;
int d;

bool operator<(const ano &o)const{
return d>o.d;
}

};

vector<vector<pair<int,int> > > a(250000);
priority_queue<pair<int,int> > q;
int d[250000];

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

int n,m;
cin>>n>>m;



int i,j;
char c;

for(i=0;i<n*m;i++)
    d[i]=1000000;

for(i=0;i<n;i++)
for(j=0;j<m;j++){

    cin>>c;

    if(c=='X')
        continue;

    if(c=='N'){
        if(i-1>=0)
            a[i*m+j].push_back({0,(i-1)*m+j});
        if(j+1<m)
            a[i*m+j].push_back({1,i*m+j+1});
        if(i+1<n)
            a[i*m+j].push_back({2,(i+1)*m+j});
        if(j-1>=0)
            a[i*m+j].push_back({3,i*m+j-1});
    }
    else if(c=='E'){
        if(i-1>=0)
            a[i*m+j].push_back({3,(i-1)*m+j});
        if(j+1<m)
            a[i*m+j].push_back({0,i*m+j+1});
        if(i+1<n)
            a[i*m+j].push_back({1,(i+1)*m+j});
        if(j-1>=0)
            a[i*m+j].push_back({2,i*m+j-1});
    }
    else if(c=='S'){
        if(i-1>=0)
            a[i*m+j].push_back({2,(i-1)*m+j});
        if(j+1<m)
            a[i*m+j].push_back({3,i*m+j+1});
        if(i+1<n)
            a[i*m+j].push_back({0,(i+1)*m+j});
        if(j-1>=0)
            a[i*m+j].push_back({1,i*m+j-1});
    }
    else if(c=='W'){
        if(i-1>=0)
            a[i*m+j].push_back({1,(i-1)*m+j});
        if(j+1<m)
            a[i*m+j].push_back({2,i*m+j+1});
        if(i+1<n)
            a[i*m+j].push_back({3,(i+1)*m+j});
        if(j-1>=0)
            a[i*m+j].push_back({0,i*m+j-1});
    }

}

q.push({0,0});
d[0]=0;

int start,w;

while(!q.empty()){
    start=q.top().second;
    w=q.top().first;
    q.pop();

    if(d[start]<w)
        continue;

    for(auto x : a[start])
    if(d[x.second]>d[start]+x.first){
        d[x.second]=d[start]+x.first;
        q.push(x);
    }

}

if(d[n*m-1]==1000000)
    cout<<-1<<endl;
else
    cout<<d[n*m-1]<<endl;


}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 9 ms 6144 KB Output is correct
5 Correct 9 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 8 ms 6272 KB Output is correct
9 Correct 8 ms 6272 KB Output is correct
10 Correct 8 ms 6272 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory 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 9 ms 6144 KB Output is correct
5 Correct 9 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 8 ms 6272 KB Output is correct
9 Correct 8 ms 6272 KB Output is correct
10 Correct 8 ms 6272 KB Output is correct
11 Correct 8 ms 6272 KB Output is correct
12 Correct 8 ms 6272 KB Output is correct
13 Correct 8 ms 6272 KB Output is correct
14 Correct 8 ms 6272 KB Output is correct
15 Correct 8 ms 6272 KB Output is correct
16 Correct 9 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

# Verdict Execution time Memory Grader output
1 Correct 9 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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6272 KB Output is correct
2 Correct 8 ms 6272 KB Output is correct
3 Correct 12 ms 6272 KB Output is correct
4 Correct 10 ms 6272 KB Output is correct
5 Correct 25 ms 6656 KB Output is correct
6 Correct 20 ms 6400 KB Output is correct
7 Correct 10 ms 6272 KB Output is correct
8 Correct 8 ms 6272 KB Output is correct
9 Correct 10 ms 6272 KB Output is correct
10 Correct 8 ms 6272 KB Output is correct

Subtask #5
0 / 50.0

# Verdict Execution time Memory 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 9 ms 6144 KB Output is correct
5 Correct 9 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 8 ms 6272 KB Output is correct
9 Correct 8 ms 6272 KB Output is correct
10 Correct 8 ms 6272 KB Output is correct
11 Correct 8 ms 6272 KB Output is correct
12 Correct 8 ms 6272 KB Output is correct
13 Correct 8 ms 6272 KB Output is correct
14 Correct 8 ms 6272 KB Output is correct
15 Correct 8 ms 6272 KB Output is correct
16 Correct 9 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 9 ms 6272 KB Output is correct
22 Correct 8 ms 6272 KB Output is correct
23 Correct 8 ms 6272 KB Output is correct
24 Correct 8 ms 6272 KB Output is correct
25 Correct 8 ms 6272 KB Output is correct
26 Correct 8 ms 6272 KB Output is correct
27 Correct 12 ms 6272 KB Output is correct
28 Correct 10 ms 6272 KB Output is correct
29 Correct 25 ms 6656 KB Output is correct
30 Correct 20 ms 6400 KB Output is correct
31 Correct 10 ms 6272 KB Output is correct
32 Correct 8 ms 6272 KB Output is correct
33 Correct 10 ms 6272 KB Output is correct
34 Correct 8 ms 6272 KB Output is correct
35 Correct 997 ms 11592 KB Output is correct
36 Correct 9 ms 6272 KB Output is correct
37 Correct 1116 ms 9576 KB Output is correct
38 Correct 15 ms 7936 KB Output is correct
39 Execution timed out 2091 ms 49884 KB Time limit exceeded
40 Halted 0 ms 0 KB -