Cod sursa(job #3312129)

Utilizator ilincaSSirbu Ilinca-Maria eu ilincaS Data 26 septembrie 2025 11:13:45
Problema Car Scor 50
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 2.61 kb
#include <fstream>
#include <queue>
#include <tuple>

using namespace std;

ifstream cin("car.in");
ofstream cout("car.out");

int v[505][505];
int dl[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dc[8] = {0, 1, 1, 1, 0, -1, -1, -1};

vector <queue <tuple<int, int, int>>> q(3);

int main()
{
    int n, m, a, b, x, y, exitcond=0, cnt=0, dir=0;
    cin>>n>>m>>x>>y>>a>>b;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            cin>>v[i][j];
            v[i][j]*=-1;
        }
    }
    for(int i=0; i<=n; i++)
    {
        v[i][0]=v[i][m+1]=-1;
    }
    for(int j=0; j<=m; j++)
    {
        v[0][j]=v[n+1][j]=-1;
    }
    v[x][y]=-1;
    for(int i=0; i<8; i++)
    {
        if(v[x+dl[i]][y+dc[i]]!=-1)
        {
            v[x+dl[i]][y+dc[i]] = -1;
            q[0].push({x+dl[i], y+dc[i], i});
        }
    }
    while(exitcond == 0)
    {
        if(q[0].empty() && q[1].empty() && q[2].empty())
        {
            cout<<-1;
            break;
        }
        if(q[cnt%3].empty())
        {
            cnt++;
        }
        if(q[cnt%3].empty())
        {
            cnt++;
        }
        x=get<0>(q[cnt%3].front());
        y=get<1>(q[cnt%3].front());
        dir=get<2>(q[cnt%3].front());
        q[cnt%3].pop();
        v[x][y]=-1;
        if(x==a && y==b)
        {
            exitcond = 1;
            cout<<cnt;
            break;
        }
        else
        {
            if(v[x+dl[dir]][y+dc[dir]]==0)
            {
                //v[x+dl[dir]][y+dc[dir]] = cnt;
                q[cnt%3].push({x+dl[dir], y+dc[dir], dir});
            }
            if(v[x+dl[(dir+1)%8]][y+dc[(dir+1)%8]]==0)
            {
                //v[x+dl[(dir+1)%8]][y+dc[(dir+1)%8]] = cnt+1;
                q[(cnt+1)%3].push({x+dl[(dir+1)%8], y+dc[(dir+1)%8], (dir+1)%8});
            }
            if(v[x+dl[(dir+2)%8]][y+dc[(dir+2)%8]]==0)
            {
                //v[x+dl[(dir+2)%8]][y+dc[(dir+2)%8]] = cnt+2;
                q[(cnt+2)%3].push({x+dl[(dir+2)%8], y+dc[(dir+2)%8], (dir+2)%8});
            }
            if(v[x+dl[(dir-1+8)%8]][y+dc[(dir-1+8)%8]]==0)
            {
                //v[x+dl[(dir+1)%8]][y+dc[(dir+1)%8]] = cnt+1;
                q[(cnt+1)%3].push({x+dl[(dir-1+8)%8], y+dc[(dir-1+8)%8], (dir-1+8)%8});
            }
            if(v[x+dl[(dir-2+8)%8]][y+dc[(dir-2+8)%8]]==0)
            {
                //v[x+dl[(dir+2)%8]][y+dc[(dir+2)%8]] = cnt+2;
                q[(cnt+2)%3].push({x+dl[(dir-2+8)%8], y+dc[(dir-2+8)%8], (dir-2+8)%8});
            }
        }
    }



    return 0;
}