結果
| 問題 | No.422 文字列変更 (Hard) |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2016-09-09 22:48:25 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,753 bytes |
| コンパイル時間 | 1,351 ms |
| コンパイル使用メモリ | 111,744 KB |
| 実行使用メモリ | 85,632 KB |
| 最終ジャッジ日時 | 2024-11-17 06:34:03 |
| 合計ジャッジ時間 | 6,655 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | RE | - |
| testcase_09 | AC | 404 ms
79,488 KB |
| testcase_10 | WA | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
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
{
/// <summary>
/// 経路復元パートとかいう無駄な面倒要素
/// </summary>
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<int, int, int>[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<int, int, int>(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<int, int, int>(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<int, int, int>(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<Char>();
var tt = new List<char>();
var p = new Triplet<int, int, int>(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 (pre.K == 0)
{
ss.Add(t[pre.J]);
tt.Add(t[pre.J]);
}
else if (pre.K == 1)
ss.Add('-');
else tt.Add('-');
p = pre;
}
IO.Printer.Out.WriteLine(min);
ss.Reverse(); tt.Reverse();
IO.Printer.Out.WriteLine(ss.AsString());
IO.Printer.Out.WriteLine(tt.AsString());
}
public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
}
}
#region main
static class Ex
{
static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
static public string AsJoinedString<T>(this IEnumerable<T> 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<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().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<T>(int n, Func<T> 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<ST,FT,TT>
static public class Triplet
{
static public Triplet<FT, ST, TT> Create<FT, ST, TT>(FT f, ST s, TT t)
where FT : IComparable<FT>
where ST : IComparable<ST>
where TT : IComparable<TT>
{ return new Triplet<FT, ST, TT>(f, s, t); }
static public Triplet<FT, ST, TT> Max<FT, ST, TT>(Triplet<FT, ST, TT> p, Triplet<FT, ST, TT> q)
where FT : IComparable<FT>
where ST : IComparable<ST>
where TT : IComparable<TT>
{
return p.CompareTo(q) >= 0 ? p : q;
}
static public Triplet<FT, ST, TT> Min<FT, ST, TT>(Triplet<FT, ST, TT> p, Triplet<FT, ST, TT> q)
where FT : IComparable<FT>
where ST : IComparable<ST>
where TT : IComparable<TT>
{
return p.CompareTo(q) <= 0 ? p : q;
}
}
public struct Triplet<FT, ST, TT>: IComparable<Triplet<FT, ST, TT>>
where FT : IComparable<FT>
where ST : IComparable<ST>
where TT : IComparable<TT>
{
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<FT, ST, TT> 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