using System; using System.Collections.Generic; using System.Collections; using System.Collections.Specialized; using System.Linq; using System.Text; using System.IO; using System.Reflection; using static System.Math; using System.Numerics; static class Program{ const int mod=(int)1e9+7; static readonly int[][] di1=new int[][]{new int[]{-1,0},new int[]{1,0},new int[]{0,-1},new int[]{0,1}}; static readonly int[][] di2=new int[][]{new int[]{-1,-1},new int[]{-1,0},new int[]{-1,1},new int[]{0,-1},new int[]{0,1},new int[]{1,-1},new int[]{1,0},new int[]{1,1}}; static char[][] bm; static int[][] b; static void Main(){ Sc sc=new Sc(); var s=sc.Ia; int h=s[0],w=s[1]; char c='#'; bm=new char[h+2][]; b=new int[h+2][]; for(int i = 1;i<=h;i++) { bm[i]=(c+sc.S+c).ToCharArray(); b[i]=new int[w+2]; } bm[0]=bm[h+1]=new string(c,w+2).ToCharArray(); b[0]=b[h+1]=new int[w+2]; var pq=new Rheap>(32); pq.Push(new Rheap>.Dt(0,Tuple.Create(1,1))); while(pq.cnt>0){ var e=pq.Dequeue; if(bm[e.d.Item1][e.d.Item2]==c){continue;} b[e.d.Item1][e.d.Item2]=(int)e.n; bm[e.d.Item1][e.d.Item2]=c; if(bm[e.d.Item1+1][e.d.Item2]!='#'){ int p=(int)e.n+1+(bm[e.d.Item1+1][e.d.Item2]=='k'?(e.d.Item1+e.d.Item2-1):0); if(b[e.d.Item1+1][e.d.Item2]==0||b[e.d.Item1+1][e.d.Item2]>p){ pq.Push(new Rheap>.Dt(p,Tuple.Create(e.d.Item1+1,e.d.Item2))); b[e.d.Item1+1][e.d.Item2]=p; } } if(bm[e.d.Item1][e.d.Item2+1]!='#'){ int p=(int)e.n+1+(bm[e.d.Item1][e.d.Item2+1]=='k'?(e.d.Item1-1+e.d.Item2):0); if(b[e.d.Item1][e.d.Item2+1]==0||b[e.d.Item1][e.d.Item2+1]>p){ pq.Push(new Rheap>.Dt(p,Tuple.Create(e.d.Item1,e.d.Item2+1))); b[e.d.Item1][e.d.Item2+1]=p; } } } Console.WriteLine("{0}",b[h][w]); } } public class Rheap{ public class Dt{ public long n; public T d; public Dt(long n,T d){this.n=n;this.d=d;} public override string ToString()=>"d:"+d.ToString()+" n:"+n.ToString(); } private const int m=65; private long la=0; private Dt[][] bf; private int[] h; public int cnt=0; public Rheap(int max){ bf=new Dt[m][]; h=new int[m]; for(int i = 0;i0){ int p=0; for(int j = 1;jbf[i][j].n){p=j;} } la=bf[i][p].n; for(int j = 0;j(int n,Func f){var a=new T[n];for(int i=0;i(int n,Func f){var a=new T[n];for(int i=0;i(int n,Func f){var a=new T[n];for(int i=0;i(int n,Func f){var a=new T[n];for(int i=0;i