using System; using System.Collections.Generic; using System.Linq; using System.IO; using System.Runtime.CompilerServices; using System.Text; using static Template; using static System.Console; using static System.Convert; using static System.Math; using Pi = Pair; class Solver { public void Solve(Scanner sc) { int H, W; sc.Make(out H, out W); var grid = sc.Grid(H); var dist = Create(H, () => Create(W, () => -1)); var que = new PriorityQueue>((a,b)=>a.v1-b.v1); //始点 dist[0][0] = 0; que.Push(new Pair(0, 0, 0)); while (que.Any()) { var p = que.Pop(); for (var i = 0; i < gh.Length; i++) { int nh = p.v2 + gh[i], nw = gw[i] + p.v3; if (!Inside(nh, nw, H, W) || dist[nh][nw] != -1) continue; int c = 0; if (grid[nh][nw] == 'k') c = nh + nw; dist[nh][nw] = dist[p.v2][p.v3] + 1 + c; que.Push(new Pair(dist[nh][nw],nh, nw)); } } WriteLine(dist[H - 1][W - 1]); } int[] gh = new[] { 0, 0, 1, -1 }, gw = new[] { 1, -1, 0, 0 }; public static bool Inside(int h, int w, int hh, int ww) => 0 <= h && h < hh && 0 <= w && w < ww; } public class PriorityQueue { private List data = new List(); private Comparison cmp; public int Count { get { return data.Count; } } public T Top { get { return data[0]; } } public PriorityQueue() { cmp = cmp ?? Comparer.Default.Compare; } public PriorityQueue(Comparison comparison) { cmp = comparison; } [MethodImpl(MethodImplOptions.AggressiveInlining)] private int Parent(int i) => (i - 1) >> 1; [MethodImpl(MethodImplOptions.AggressiveInlining)] private int Left(int i) => (i << 1) + 1; public T Push(T val) { int i = data.Count; data.Add(val); while (i > 0) { int p = Parent(i); if (cmp(data[p], val) <= 0) break; data[i] = data[p]; i = p; } data[i] = val; return val; } public T Pop() { var ret = data[0]; var p = 0; var x = data[data.Count - 1]; while (Left(p) < data.Count - 1) { var l = Left(p); if (l < data.Count - 2 && cmp(data[l + 1], data[l]) < 0) l++; if (cmp(data[l], x) >= 0) break; data[p] = data[l]; p = l; } data[p] = x; data.RemoveAt(data.Count - 1); return ret; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public bool Any() => data.Count > 0; } #region Template public static class Template { static void Main(string[] args) { Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); new Solver().Solve(new Scanner()); Console.Out.Flush(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool chmin(ref T a, T b) where T : IComparable { if (a.CompareTo(b) == 1) { a = b; return true; } return false; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool chmax(ref T a, T b) where T : IComparable { if (a.CompareTo(b) == -1) { a = b; return true; } return false; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void swap(ref T a, ref T b) { var t = b; b = a; a = t; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T[] Create(int n, Func f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T[] Create(int n, Func f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; } public static T[] Copy(this T[] A) => Create(A.Length, i => A[i]); public static void Fail(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); } } public class Scanner { public string Str => Console.ReadLine().Trim(); public int Int => int.Parse(Str); public long Long => long.Parse(Str); public double Double => double.Parse(Str); public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray(); public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray(); public char[][] Grid(int n) => Create(n, () => Str.ToCharArray()); public int[] ArrInt1D(int n) => Create(n, () => Int); public long[] ArrLong1D(int n) => Create(n, () => Long); public int[][] ArrInt2D(int n) => Create(n, () => ArrInt); public long[][] ArrLong2D(int n) => Create(n, () => ArrLong); public Pair PairMake() => new Pair(Next(), Next()); public Pair PairMake() => new Pair(Next(), Next(), Next()); private Queue q = new Queue(); [MethodImpl(MethodImplOptions.AggressiveInlining)] public T Next() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); } public void Make(out T1 v1) => v1 = Next(); public void Make(out T1 v1, out T2 v2) { v1 = Next(); v2 = Next(); } public void Make(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next(); } public void Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next(); } public void Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next(); } public void Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next(); } } public class Pair : IComparable> { public T1 v1; public T2 v2; public Pair() { } public Pair(T1 v1, T2 v2) { this.v1 = v1; this.v2 = v2; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int CompareTo(Pair p) { var c = Comparer.Default.Compare(v1, p.v1); if (c == 0) c = Comparer.Default.Compare(v2, p.v2); return c; } public override string ToString() => $"{v1.ToString()} {v2.ToString()}"; public void Tie(out T1 a, out T2 b) { a = v1; b = v2; } } public class Pair : Pair, IComparable> { public T3 v3; public Pair() : base() { } public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2) { this.v3 = v3; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int CompareTo(Pair p) { var c = base.CompareTo(p); if (c == 0) c = Comparer.Default.Compare(v3, p.v3); return c; } public override string ToString() => $"{base.ToString()} {v3.ToString()}"; public void Tie(out T1 a, out T2 b, out T3 c) { Tie(out a, out b); c = v3; } } #endregion