oj.uz

Submission #63727

# Submission time Handle Problem Language Result Execution time Memory
63727 2018-08-02T14:39:31 Z Bodo171 Tracks in the Snow (BOI13_tracks) C++14
89.0625 / 100
 2000 ms 91404 KB 
#include <iostream>
#include <fstream>
#include <queue>
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)
{

    queue< pair<int,int> > q[2];
    q[0].push({L,C});
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
           d[i][j]=n*m+1;
    d[L][C]=0;
    for(i=0;i<=n*m;i++)
    {
        if(q[use].empty())
            return;
        mx=max(mx,i);
        while(!q[use].empty())
        {
             li=q[use].front().first;ci=q[use].front().second;q[use].pop();
              for(di=0;di<4;di++)
              {
                  lf=li+d1[di];cf=ci+d2[di];
                  if(lf>=1&&cf>=1&&lf<=n&&cf<=m&&(s[lf][cf-1]=='R'||s[lf][cf-1]=='F'))
                  {
                      dd=d[li][ci]+(s[li][ci-1]!=s[lf][cf-1]);
                      if(dd<d[lf][cf])
                      {
                          d[lf][cf]=dd;
                          q[(dd&1)].push({lf,cf});
                      }
                  }
              }
        }
        p[use]=1;u[use]=0;
        use=1-use;
    }
}
int main()
{
   // freopen("data.in","r",stdin);
    ios_base::sync_with_stdio(false);
    cin>>n>>m;getline(cin,s[0]);
    for(i=1;i<=n;i++)
    {
        getline(cin,s[i]);
    }
    dij(1,1);
    cout<<mx+1;
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 3832 KB Output is correct
2 Correct 3 ms 3832 KB Output is correct
3 Correct 4 ms 3832 KB Output is correct
4 Correct 20 ms 3832 KB Output is correct
5 Correct 6 ms 3832 KB Output is correct
6 Correct 3 ms 3832 KB Output is correct
7 Correct 3 ms 3832 KB Output is correct
8 Correct 3 ms 3832 KB Output is correct
9 Correct 5 ms 3832 KB Output is correct
10 Correct 6 ms 3832 KB Output is correct
11 Correct 7 ms 3832 KB Output is correct
12 Correct 14 ms 3832 KB Output is correct
13 Correct 6 ms 3832 KB Output is correct
14 Correct 7 ms 3832 KB Output is correct
15 Correct 26 ms 3924 KB Output is correct
16 Correct 28 ms 3924 KB Output is correct
17 Correct 19 ms 3924 KB Output is correct
18 Correct 20 ms 3924 KB Output is correct

Subtask #2
59.0625 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16216 KB Output is correct
2 Correct 102 ms 16216 KB Output is correct
3 Correct 430 ms 81108 KB Output is correct
4 Correct 127 ms 81108 KB Output is correct
5 Correct 291 ms 81108 KB Output is correct
6 Execution timed out 2082 ms 91388 KB Time limit exceeded
7 Correct 18 ms 91388 KB Output is correct
8 Correct 18 ms 91388 KB Output is correct
9 Correct 6 ms 91388 KB Output is correct
10 Correct 4 ms 91388 KB Output is correct
11 Correct 19 ms 91388 KB Output is correct
12 Correct 4 ms 91388 KB Output is correct
13 Correct 85 ms 91388 KB Output is correct
14 Correct 46 ms 91388 KB Output is correct
15 Correct 45 ms 91388 KB Output is correct
16 Correct 47 ms 91388 KB Output is correct
17 Correct 226 ms 91388 KB Output is correct
18 Correct 160 ms 91388 KB Output is correct
19 Correct 125 ms 91388 KB Output is correct
20 Correct 123 ms 91388 KB Output is correct
21 Correct 238 ms 91388 KB Output is correct
22 Correct 345 ms 91388 KB Output is correct
23 Correct 492 ms 91388 KB Output is correct
24 Correct 228 ms 91388 KB Output is correct
25 Correct 753 ms 91388 KB Output is correct
26 Correct 1266 ms 91388 KB Output is correct
27 Execution timed out 2058 ms 91388 KB Time limit exceeded
28 Execution timed out 2057 ms 91404 KB Time limit exceeded
29 Execution timed out 2066 ms 91404 KB Time limit exceeded
30 Execution timed out 2062 ms 91404 KB Time limit exceeded
31 Correct 1602 ms 91404 KB Output is correct
32 Correct 1224 ms 91404 KB Output is correct