oj.uz

답안 #290163

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
290163 2020-09-03T12:51:22 Z keta_tsimakuridze Awesome Arrowland Adventure (eJOI19_adventure) C++14
0 / 100
 1 ms 384 KB 
#include<bits/stdc++.h>
#define pii pair<int,pair<int,int> > 
#define fi first
#define s second
using namespace std;
int n,m,k,i,d[1005][1005],f,D;
char a[1005][1005];
priority_queue< pii , vector<pii>,greater<pii> >q;
int main(){
	cin>>n>>m;
	for(k=1;k<=n;k++){
		for(i=1;i<=m;i++){
			cin>>a[k][i]; d[k][i]=1e5;
		}
	} 
	d[1][1]=0;
	q.push({0,{1,1}});
	while(q.size()){
		int x=q.top().s.fi;
		int y=q.top().s.s;
		int D=q.top().fi;
		q.pop();
		if(D>d[x][y]) continue;
		if(a[x][y]=='X') continue;
		if(y<m){
			
			if(a[x][y]=='E') f=0;
			else if(a[x][y]=='N') f=1;
			else if(a[x][y]=='W') f=2;
			else f=3;
			if(d[x][y+1]>D+f){
				d[x][y+1]=D+f;
				q.push({d[x][y+1],{x,y+1}});
			}
		}
		if(y>1){
				if(a[x][y]=='W') f=0;
				else if(a[x][y]=='S') f=1;
				else if(a[x][y]=='E') f=2;
				else f=3;
			if(d[x][y-1]>D+f){
				d[x][y-1]=D+f;
				q.push({d[x][y-1],{x,y-1}});
			}
		}
		if(x<n){ 
				if(a[x][y]=='S') f=0;
				else if(a[x][y]=='E') f=1;
				else if(a[x][y]=='N') f=2;
				else if(a[x][y]=='W') f=3;
			if(d[x+1][y]>D+f){
				d[x+1][y]=D+f;
				q.push({d[x+1][y],{x+1,y}});
			}
		}//cout<<a[2][2]<<" "<<x<<" "<<y<<endl;
		if(x>1){
			
				if(a[x][y]=='N') f=0;
				else if(a[x][y]=='W') f=1;
				else if(a[x][y]=='S') f=2;
				else if(a[x][y]=='E') f=3;
			
			if(d[x-1][y]>D+f){
				d[x-1][y]=D+f;
				q.push({d[x-1][y],{x-1,y}});
			}
		}
	}
	cout<<d[n][m];
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -