# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
63720 | Bodo171 | Tracks in the Snow (BOI13_tracks) | C++14 | 2084 ms | 195572 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 <iostream>
#include <fstream>
using namespace std;
const int nmax=4005;
int d[nmax][nmax];
pair<int,int> q[2][nmax*nmax];
string s[nmax];
int p[2],u[2];
bool E[nmax][nmax];
int use,mx,i,j,dd,n,m,li,ci,lf,cf,di;
int d1[]={-1,0,1,0};
int d2[]={0,-1,0,1};
void dij(int L,int C)
{
p[0]=p[1]=1;
u[0]=u[1]=0;
q[0][++u[0]]={L,C};use=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
d[i][j]=n*m+1,E[i][j]=0;
d[L][C]=0;
for(i=0;i<=n*m;i++)
{
if(p[use]>u[use])
return;
mx=max(mx,i);
for(p[use]=1;p[use]<=u[use];p[use]++)
{
li=q[use][p[use]].first;ci=q[use][p[use]].second;
if(!E[li][ci])
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |