結果
| 問題 | No.102 トランプを奪え |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-05-10 04:08:36 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,020 bytes |
| コンパイル時間 | 1,044 ms |
| コンパイル使用メモリ | 119,548 KB |
| 実行使用メモリ | 39,976 KB |
| 最終ジャッジ日時 | 2024-07-05 21:22:05 |
| 合計ジャッジ時間 | 2,257 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 25 ms
18,560 KB |
| testcase_01 | AC | 25 ms
18,432 KB |
| testcase_02 | AC | 32 ms
18,944 KB |
| testcase_03 | WA | - |
| testcase_04 | AC | 24 ms
18,560 KB |
| testcase_05 | WA | - |
| testcase_06 | AC | 37 ms
20,352 KB |
| testcase_07 | WA | - |
| testcase_08 | AC | 49 ms
24,960 KB |
| testcase_09 | WA | - |
| testcase_10 | AC | 119 ms
31,616 KB |
コンパイルメッセージ
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.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
public class Solver
{
public void Solve()
{
var a = sc.Integer(4);
var sum = a.Sum();
var dp = new int?[53, 14, 14, 14, 14];
Func<int, int, int, int, int, bool, int> dfs = null;
dfs = (n, w, x, y, z, k) =>
{
//Debug.WriteLine("{0} {1} {2} {3} {4}", n, w, x, y, z);
var rem = (sum - w - x - y - z) - n;
if (w + x + y + z == 0)
{
if (n > rem)
return 2;
else if (n == rem)
return 1;
else return 0;
}
if (dp[n, w, x, y, z].HasValue)
return dp[n, w, x, y, z].Value;
var res = new bool[3];
if (k)
{
for (int i = 1; i <= 3; i++)
{
if (w >= i)
res[dfs(n + Math.Min(w, i) + (Math.Max(0, w - i) == 0 && w != 0 ? (rem + 1) / 2 : 0), Math.Max(0, w - i), x, y, z, k ^ true)] = true;
if (x >= i)
res[dfs(n + Math.Min(x, i) + (Math.Max(0, x - i) == 0 && x != 0 ? (rem + 1) / 2 : 0), w, Math.Max(0, x - i), y, z, k ^ true)] = true;
if (y >= i)
res[dfs(n + Math.Min(y, i) + (Math.Max(0, y - i) == 0 && y != 0 ? (rem + 1) / 2 : 0), w, x, Math.Max(0, y - i), z, k ^ true)] = true;
if (z >= i)
res[dfs(n + Math.Min(z, i) + (Math.Max(0, z - i) == 0 && z != 0 ? (rem + 1) / 2 : 0), w, x, y, Math.Max(0, z - i), k ^ true)] = true;
}
}
else
{
for (int i = 1; i <= 3; i++)
{
if (w >= i)
res[dfs(n - (w == i ? (n + 1) / 2 : 0), w - i, x, y, z, k ^ true)] = true;
if (x >= i)
res[dfs(n - (x == i ? (n + 1) / 2 : 0), w, x - i, y, z, k ^ true)] = true;
if (y >= i)
res[dfs(n - (y == i ? (n + 1) / 2 : 0), w, x, y - i, z, k ^ true)] = true;
if (z >= i)
res[dfs(n - (z == i ? (n + 1) / 2 : 0), w, x, y, z - i, k ^ true)] = true;
}
}
var ans = 0;
if (res[0])
ans = 2;
else if (res[1])
ans = 1;
dp[n, w, x, y, z] = ans;
return ans;
};
var result = dfs(0, a[0], a[1], a[2], a[3], true);
if (result == 2)
IO.Printer.Out.WriteLine("Taro");
else if (result == 1)
IO.Printer.Out.WriteLine("Draw");
else IO.Printer.Out.WriteLine("Jiro");
}
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 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, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, IEnumerable<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); 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 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); }
}
}
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