oj.uz

답안 #494594

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
494594 2021-12-15T19:29:26 Z uncripted Awesome Arrowland Adventure (eJOI19_adventure) C++11
100 / 100
 104 ms 8960 KB 
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
long long n,m;

	char a[505][505];
char c[4]={'N','E','S','W'};
bool bound(long long x,long long y){

	if(x<0 || y<0 || x>=n || y>=m){
		return 0;
	}
	return 1;
}
long long dp[505][505];
long long dif(char x, char y){
	long long ix=0,iy=0;
	if(x=='X'){
		return 1e9;
	}
	for(long long i=0; i<4; i++){
	
		if(c[i]==x){
			ix=i;
		}
	}
	for(long long i=0; i<4; i++){
		if(c[i]==y){
			iy=i;
		}
	}
	if(ix<=iy){
		return iy-ix;
	}else{
		return 4-ix+iy;
	}
}
void solve(){

	priority_queue<pair<long long, pair<long long,long long> > > q;
	

	dp[0][0]=0;
	q.push({0,{0,0}});
	while(q.size()!=0){
		
		pair<long long,long long> te=q.top().s;
		long long x=te.f;
		long long y=te.s;
		if(dp[x][y]!=-(q.top().f)){
			q.pop();
			continue;
		}
	
		/*
		if(vis[te.s]==true){
			q.pop();
			continue;
		}*/
		q.pop();
	long long t1=dp[x][y]+dif(a[x][y], 'W');
	long long t2=dp[x][y]+dif(a[x][y], 'N');
	long long t3=dp[x][y]+dif(a[x][y], 'S');
	long long t4=dp[x][y]+dif(a[x][y], 'E');
	if(bound(x,y-1)){
		if(t1<dp[x][y-1]){
			dp[x][y-1]=t1;
			//	cout<<x<<" "<<y-1<<" dp "<<dp[x][y-1]<<endl;
			q.push({-t1, {x,y-1}});
		}
	}
	if(bound(x-1,y)){
		if(t2<dp[x-1][y]){
			dp[x-1][y]=t2;
			q.push({-t2, {x-1,y}});
			//	cout<<x-1<<" "<<y<<" dp "<<dp[x-1][y]<<endl;
		}
	}
	if(bound(x+1,y)){
		if(t3<dp[x+1][y]){
			dp[x+1][y]=t3;
			q.push({-t3, {x+1,y}});
			//	cout<<x+1<<" "<<y<<" dp "<<dp[x+1][y]<<endl;
		}
	}
	if(bound(x,y+1)){
		if(t4<dp[x][y+1]){
			dp[x][y+1]=t4;
			q.push({-t4, {x,y+1}});
			//	cout<<x<<" "<<y+1<<" dp "<<dp[x][y+1]<<endl;
		}
	}
		
	}
	
	if(dp[n-1][m-1]>=1e9){
		cout<<"-1";
		
	}else{
		cout<<dp[n-1][m-1];
	}

	

	
}
int main(){
	cin>>n>>m;
	
 for (long long i = 0; i < n; i++){
 	for (long long j = 0; j < m; j++){
        	cin >> a[i][j];
			dp[i][j] = 1e9;
		}
 }
 solve();
        
          
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 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 #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 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
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 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 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 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
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 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 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 6 ms 576 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 8 ms 716 KB Output is correct
38 Correct 3 ms 1484 KB Output is correct
39 Correct 69 ms 2740 KB Output is correct
40 Correct 73 ms 2836 KB Output is correct
41 Correct 17 ms 2720 KB Output is correct
42 Correct 67 ms 2808 KB Output is correct
43 Correct 104 ms 8960 KB Output is correct
44 Correct 16 ms 2712 KB Output is correct