#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;int m;
int ok(int i,int j){
if(i>=1&&i<=n&&j>=1&&j<=m){return 1;}
return 0;
}
int dir[5]={0,1,0,-1,0};
char dc[5]={'!','>','^','<','v'};
string gr[2010];
int dis[2010][2010];
signed main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>gr[i];
gr[i]="*"+gr[i];
}
deque<pair<int,int>>q;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
dis[i][j]=1e9;
if(gr[i][j]=='o'){
q.push_back({i,j});
dis[i][j]=0;
}
}
}
while(q.size()){
int nwx=q.front().first;
int nwy=q.front().second;
q.pop_front();
if(gr[nwx][nwy]=='o'){
for(int i=1;i<=4;i++){
int x=nwx+dir[i-1];
int y=nwy+dir[i];
if(!ok(x,y)||dis[x][y]<=dis[nwx][nwy]){continue;}
dis[x][y]=0;
q.push_front({x,y});
}
continue;
}
for(int i=1;i<=4;i++){
int x=nwx+dir[i-1];
int y=nwy+dir[i];
int w=dis[nwx][nwy];
if(gr[nwx][nwy]!=dc[i]){
w++;
}
if(!ok(x,y)||dis[x][y]<=w){continue;}
if(gr[x][y]==dc[i]){
dis[x][y]=w;
q.push_front({x,y});
}else{
dis[x][y]=w;
q.push_back({x,y});
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(gr[i][j]=='x'){
cout<<dis[i][j]<<endl;
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cout<<gr[i][j];
}cout<<endl;
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
