FGDF

package com.example.user.solutie;

import java.util.List;

public class functie {

    public find_drum(){
        private int n,m;
        /// initializez matricea
        private int Matrice[n+2][m+2];
        for(int i=0;i<=n+1;++i)
            for(int j=0;j<=m+1;++j)
                Matrice[i][j]=0;
        /// coordonate produse
        private int xp[Prod];
        private int yp[Prod];
        /// coordonate case
        private int xc[Case];
        private int yx[Case];
        ///coordonate raioane
        private int up[raioane];
        private int down[raioane];
        private int left[raioane];
        privare int right[raioane];
        /// presupun ca am coordonatele produselor deci le introduc in  matrice
        for(int i=0;i<Prod;++i) Matrice[xp[i]][yp[i]]=1;
        /// introduc casele
        for(int i=0;i<Case;++i) Matrice[xc[i]][yc[i]]=2;
        /// introduc raioanele
        for(int i=0;i<raioane;++i)
            for(int j=up[i];j<=down[i];++j)
                for(int k=left[i];k<=right[i];++k)
                    Matrice[j][k]=3;
        /// acum pot sa ma bag pe rezolvarea propriu zisa
        private int xcoord[1<<17];
        private int ycoord[1<<17];
        private int stramos[1<<17];

        private int dirx[4]={-1,1,0,0};
        private int diry[4]={0,0,-1,1};
        public int st=1;
        public int dr=1;
        xcoord[1]=1;
        ycoord[1]=1;
        stramos[1]=0;
        while(st<=dr)
        {

        }
    }
}