| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 419883 | uddiptasr | Tracks in the Snow (BOI13_tracks) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int dx[4] {1,-1,0,0} ,dy[4]{0,0,1,-1};
int n,m,depth[4000][4000],ans=1;
string snow[1000];
bool istrace(int x,int y){
return x>-1 && x<n && y>-1 && y<m && snow[x][y]!='.';
}
int main() {
iostream::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>snow[i];
deque<pair<int,int>>q;
q.push_back({0,0});
depth[0][0]=1;
while(q.size()){
pair<int,int>c=q.front();
q.pop_front();
ans=max(ans,depth[c.first][c.second]);
for(int i=0;i<4;i++){
int x=c.first+dx[i] ,y=c.second+dy[i];
if(istrace(x,y) && depth[x][y]==0){
if(snow[x][y]==snow[c.first][c.second]){
depth[x][y]=depth[c.first][c.second];
q.push_front({x,y});
}
else{
depth[x][y]=depth[c.first][c.second]+1;
q.push_back({x,y});
}
}
}
}
cout<<ans;
return 0;
}
/*
5 8
FFRFFF..
.FRRRFF.
.FFFFRF.
..RRFRR.
....FFFF
* /