結果
| 問題 |
No.291 黒い文字列
|
| コンテスト | |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-10-16 23:41:40 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 301 ms / 2,000 ms |
| コード長 | 7,117 bytes |
| コンパイル時間 | 1,118 ms |
| コンパイル使用メモリ | 118,040 KB |
| 実行使用メモリ | 38,084 KB |
| 最終ジャッジ日時 | 2024-07-21 20:45:33 |
| 合計ジャッジ時間 | 5,261 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 26 |
コンパイルメッセージ
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.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
public class Solver
{
public void Solve()
{
var s = sc.Scan();
//s = Enumerable.Repeat('?', 100).AsString();
var n = s.Length;
var ns = new List<char>();
foreach (var x in s)
if ("KUROI?".Contains(x)) ns.Add(x);
s = ns.AsString();
n = s.Length;
var dp = new int[194500];
var used = new bool[194500];
used[0] = true;
var width = new int[4];
width[0] = 1;
for (int i = 1; i < 4; i++)
width[i] = width[i - 1] * 21;
for (int ptr = 0; ptr < n; ptr++)
{
var next = new int[194500];
var go = new bool[194500];
for (int otaku = 0; otaku < 194500; otaku++)
{
if (!used[otaku]) continue;
var o = otaku / width[3];
var t = (otaku / width[2]) % 21;
var a = (otaku / width[1]) % 21;
var k = otaku % 21;
next[otaku] = Math.Max(next[otaku], dp[otaku]);
go[otaku] = true;
if ((s[ptr] == 'K' || s[ptr] == '?') && o < 20)
{
var otaota = (o + 1) * width[3] + t * width[2] + a * width[1] + k;
go[otaota] = true;
next[otaota] = Math.Max(next[otaota], dp[otaku]);
}
if ((s[ptr] == 'U' || s[ptr] == '?') && o > 0 && t < 20)
{
var otaota = (o - 1) * width[3] + (t + 1) * width[2] + a * width[1] + k;
go[otaota] = true;
next[otaota] = Math.Max(next[otaota], dp[otaku]);
}
if ((s[ptr] == 'R' || s[ptr] == '?') && t > 0 && a < 20)
{
var otaota = o * width[3] + (t - 1) * width[2] + (a + 1) * width[1] + k;
go[otaota] = true;
next[otaota] = Math.Max(next[otaota], dp[otaku]);
}
if ((s[ptr] == 'O' || s[ptr] == '?') && a > 0 && k < 20)
{
var otaota = o * width[3] + t * width[2] + (a - 1) * width[1] + k + 1;
go[otaota] = true;
next[otaota] = Math.Max(next[otaota], dp[otaku]);
}
if ((s[ptr] == 'I' || s[ptr] == '?') && k > 0)
{
var otaota = o * width[3] + t * width[2] + a * width[1] + k - 1;
go[otaota] = true;
next[otaota] = Math.Max(next[otaota], dp[otaku] + 1);
}
}
dp = next;used = go;
}
IO.Printer.Out.WriteLine(dp.Max());
}
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 != '-' && (b < '0' || '9' < b));
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() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
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