using System; using System.Collections; using System.Collections.Generic; class TEST{ static void Main(){ Sol mySol =new Sol(); mySol.Solve(); } } class Sol{ public void Solve(){ int[] dy=new int[]{0,1,0,-1}; int[] dx=new int[]{1,0,-1,0}; Queue Q=new Queue(); HashSet HE=new HashSet(); Q.Enqueue(new Pair(0,1,1)); Q.Enqueue(new Pair(0,W,1)); int ans=-1; while(Q.Count>0){ Pair p=Q.Dequeue(); int iprev=p.P1/W; int jprev=p.P1%W; int inow=p.P2/W; int jnow=p.P2%W; for(int ii=0;ii<4;ii++){ int inext=inow+dy[ii]; int jnext=jnow+dx[ii]; if(inext==-1 || inext==H || jnext==-1 || jnext==W)continue; if(isKadomatsuSequence(Map[iprev][jprev],Map[inow][jnow],Map[inext][jnext])){ Edge used=new Edge(iprev*W+jprev,inow*W+jnow,inext*W+jnext); if(!HE.Contains(used)){ HE.Add(used); Q.Enqueue(new Pair(inow*W+jnow,inext*W+jnext,p.Turn+1)); if(inext*W+jnext==H*W-1&& ans==-1){ ans=p.Turn+1; break; } } } } if(ans!=-1)break; } Console.WriteLine(ans); } bool isKadomatsuSequence(int a,int b,int c){ if(a>b&&bc&&a!=c)return true; return false; } int W,H; int[][] Map; public Sol(){ var d=ria(); W=d[0];H=d[1]; Map=new int[H][]; for(int i=0;iint.Parse(e));} static long[] rla(){return Array.ConvertAll(Console.ReadLine().Split(' '),e=>long.Parse(e));} static double[] rda(){return Array.ConvertAll(Console.ReadLine().Split(' '),e=>double.Parse(e));} }