oj.uz

Submission #446765

# Submission time Handle Problem Language Result Execution time Memory
446765 2021-07-23T08:24:00 Z fuad27 Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 261 ms 15268 KB 
    #include <bits/stdc++.h>
    #define MAX 600
    using namespace std;
    int g[MAX][MAX],dist[MAX][MAX],dx[4]={0,1,0,-1},dy[4]={-1,0,1,0},n,m;
    void dijkstra()
    {
    	for(int i=0;i<n;i++) for(int j=0;j<m;j++) dist[i][j]=-1;
    	priority_queue<pair<int,pair<int,int>>,vector<pair<int,pair<int,int>> >, greater<pair<int,pair<int,int> > > > pq;
    	pq.push(make_pair(0,make_pair(0,0)));
    	while(!pq.empty())
    	{
    		int x=pq.top().second.first,y=pq.top().second.second,c=pq.top().first;
    		pq.pop();
    		if(x<0 || x>=m || y<0 || y>=n || dist[y][x]!=-1) continue;
    		dist[y][x]=c;
    		if(g[y][x]==-1) continue;
    		for(int i=0;i<4;i++) pq.push(make_pair(c+i,make_pair(x+dx[(g[y][x]+i)%4],y+dy[(g[y][x]+i)%4])));
    	}
    }
    int main()
    {
    	cin>>n>>m;
    	for(int i=0;i<n;i++) for(int j=0;j<m;j++)
    	{
    		char c; cin>>c;
    		if(c=='N') g[i][j]=0;
    		if(c=='E') g[i][j]=1;
    		if(c=='S') g[i][j]=2;
    		if(c=='W') g[i][j]=3;
    		if(c=='X') g[i][j]=-1;
    	}
    	dijkstra();
    	cout<<dist[n-1][m-1];
    }

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 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 0 ms 204 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 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 0 ms 204 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 0 ms 204 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 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 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 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 0 ms 204 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 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 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 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 296 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 288 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 13 ms 608 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 15 ms 844 KB Output is correct
38 Correct 4 ms 1484 KB Output is correct
39 Correct 155 ms 3040 KB Output is correct
40 Correct 155 ms 2992 KB Output is correct
41 Correct 20 ms 2848 KB Output is correct
42 Correct 153 ms 2960 KB Output is correct
43 Correct 261 ms 15268 KB Output is correct
44 Correct 20 ms 2892 KB Output is correct