using System; using System.Linq; using System.Linq.Expressions; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; using Number = System.Int64; namespace Program { /// /// 経路復元パートとかいう無駄な面倒要素 /// public class Solver { public void Solve() { var n = sc.Integer(); var m = sc.Integer(); var s = sc.Scan(); var t = sc.Scan(); var dp = new int[n + 2, m + 2, 3]; var prev = new Triplet[n + 2, m + 2, 3]; for (int i = 0; i <= n + 1; i++) for (int j = 0; j <= m + 1; j++) for (int k = 0; k < 3; k++) dp[i, j, k] = 1145141919; dp[0, 0, 0] = 0; for (int i = 0; i <= n; i++) for (int j = 0; j <= m; j++) for (int k = 0; k < 3; k++) { if (i < n && j < m) { var x = s[i] == t[j] ? 0 : 5; if (dp[i + 1, j + 1, 0] > dp[i, j, k] + x) { dp[i + 1, j + 1, 0] = dp[i, j, k] + x; prev[i + 1, j + 1, 0] = new Triplet(i, j, k); } } if (j < m) { var x = k == 1 ? 2 : 9; if (dp[i, j + 1, 1] > dp[i, j, k] + x) { dp[i, j + 1, 1] = dp[i, j, k] + x; prev[i, j + 1, 1] = new Triplet(i, j, k); } } if (i < n) { var x = k == 2 ? 2 : 9; if (dp[i + 1, j, 2] > dp[i, j, k] + x) { dp[i + 1, j, 2] = dp[i, j, k] + x; prev[i + 1, j, 2] = new Triplet(i, j, k); } } } var min = int.MaxValue; for (int k = 0; k < 3; k++) min = Math.Min(min, dp[n, m, k]); var ss = new List(); var tt = new List(); var p = new Triplet(n, m, -1); for (int k = 0; k < 3; k++) if (dp[n, m, k] == min) p.K = k; while (p.I > 0 || p.J > 0) { var pre = prev[p.I, p.J, p.K]; if (p.K == 0) { ss.Add(s[pre.I]); tt.Add(t[pre.J]); } else if (p.K == 1) { ss.Add('-'); tt.Add(t[pre.J]); } else { ss.Add(s[pre.I]); tt.Add('-'); } p = pre; } IO.Printer.Out.WriteLine(min); ss.Reverse(); tt.Reverse(); Debug.WriteLine(ss.Count); Debug.WriteLine(tt.Count); IO.Printer.Out.WriteLine(ss.AsString()); IO.Printer.Out.WriteLine(tt.AsString()); } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate(int n, Func f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } static public void Swap(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region main static class Ex { static public string AsString(this IEnumerable ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString(this IEnumerable ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; public class Printer: StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write(string format, T[] source) { base.Write(format, source.OfType().ToArray()); } public void WriteLine(string format, T[] source) { base.WriteLine(format, source.OfType().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public string ScanLine() { var sb = new StringBuilder(); for (var b = Char(); b != '\n'; b = (char)read()) if (b == 0) break; else if (b != '\r') sb.Append(b); return sb.ToString(); } public long Long() { if (isEof) return long.MinValue; long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != 0 && b != '-' && (b < '0' || '9' < b)); if (b == 0) return long.MinValue; if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; } private T[] enumerate(int n, Func f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public char[] Char(int n) { return enumerate(n, Char); } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } } } #endregion #region Triplet static public class Triplet { static public Triplet Create(FT f, ST s, TT t) where FT : IComparable where ST : IComparable where TT : IComparable { return new Triplet(f, s, t); } static public Triplet Max(Triplet p, Triplet q) where FT : IComparable where ST : IComparable where TT : IComparable { return p.CompareTo(q) >= 0 ? p : q; } static public Triplet Min(Triplet p, Triplet q) where FT : IComparable where ST : IComparable where TT : IComparable { return p.CompareTo(q) <= 0 ? p : q; } } public struct Triplet: IComparable> where FT : IComparable where ST : IComparable where TT : IComparable { public FT I; public ST J; public TT K; public Triplet(FT i, ST j, TT k) : this() { I = i; J = j; K = k; } public int CompareTo(Triplet other) { var cmp = I.CompareTo(other.I); if (cmp != 0) return cmp; cmp = J.CompareTo(other.J); if (cmp != 0) return cmp; return K.CompareTo(other.K); } public override string ToString() { return string.Format("{0} {1} {2}", I, J, K); } } #endregion