# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26487 | samir_droubi | Tracks in the Snow (BOI13_tracks) | C++14 | 2000 ms | 1048576 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;
const int mxn=4005;
char g[mxn][mxn];
int n,m;
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
bool check(int x,int y)
{
return x>=0&&x<n&&y>=0&&y<m&&g[x][y]!='*';
}
char ty;
int c=0;
vector<pair<int,int> >v;
vector<pair<int,int> >vv;
void dfs(int x,int y)
{
++c;
g[x][y]='.';
for(int i=0;i<4;++i)
{
int xx=x+dx[i];
int yy=y+dy[i];
if(!check(xx,yy))continue;
if(g[xx][yy]!=ty)
{
vv.push_back({xx,yy});
continue;
}
dfs(xx,yy);
}
}
int main()
{
scanf("%d%d",&n,&m);
int cnt=n*m;
for(int i=0;i<n;++i)scanf("%s",&g[i]);
for(int i=0;i<n;++i)
{
for(int j=0;j<m;++j)
if(g[i][j]=='.')
--cnt;
}
v.push_back({1,1});
int ans=0;
while(c!=cnt)
{
for(int i=0;i<v.size();++i)
{
int x=v[i].first;
int y=v[i].second;
if(g[x][y]=='.')continue;
ty=g[x][y];
dfs(x,y);
}
v=vv;
vv.clear();
++ans;
}
printf("%d\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |