# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
492215 | ToroTN | Tracks in the Snow (BOI13_tracks) | C++14 | 1056 ms | 111500 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 n,m,dx[]={1,-1,0,0},dy[]={0,0,1,-1},d[4005][4005],u,v,sx,sy,x,y;
char s[4005][4005];
queue<pair<int,int> > q;
vector<pair<int,int> > g;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%s",s[i]+1);
}
g.push_back({1,1});
for(int i=1;;i++)
{
//printf("%d\n",i);
for(int j=0;j<g.size();j++)
{
sx=g[j].first;
sy=g[j].second;
//printf("%d %d\n",sx,sy);
q.push({sx,sy});
d[sx][sy]=1;
}
g.clear();
while(!q.empty())
{
u=q.front().first;
v=q.front().second;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |