結果
| 問題 | No.34 砂漠の行商人 |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-03-25 15:33:50 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 5,658 bytes |
| コンパイル時間 | 2,901 ms |
| コンパイル使用メモリ | 109,444 KB |
| 実行使用メモリ | 190,728 KB |
| 最終ジャッジ日時 | 2023-09-11 10:09:31 |
| 合計ジャッジ時間 | 16,582 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge14 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 56 ms
23,156 KB |
| testcase_01 | AC | 55 ms
21,148 KB |
| testcase_02 | AC | 79 ms
25,688 KB |
| testcase_03 | AC | 62 ms
23,348 KB |
| testcase_04 | AC | 856 ms
48,812 KB |
| testcase_05 | AC | 1,437 ms
68,656 KB |
| testcase_06 | AC | 482 ms
39,572 KB |
| testcase_07 | AC | 3,463 ms
123,892 KB |
| testcase_08 | TLE | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
コンパイルメッセージ
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 n = sc.Integer();
var hp = (short)sc.Integer();
var sx = sc.Integer() - 1;
var sy = sc.Integer() - 1;
var gx = sc.Integer() - 1;
var gy = sc.Integer() - 1;
var map = Enumerate(n, x => sc.Integer(n));
var dist = new int[n * n, n * n];
dist[sx + sy * n, 0] = hp;
var q = new Queue<State>();
q.Enqueue(new State(sx + sy * n, 0, hp));
int[] dx = { 0, 0, 1, -1 };
int[] dy = { 1, -1, 0, 0 };
while (q.Any())
{
var p = q.Dequeue();
var py = p.pos / n;
var px = p.pos % n;
if (dist[py * n + px, p.dist] > p.hp)
continue;
if (p.dist + 1 >= n * n)
continue;
for (int i = 0; i < 4; i++)
{
var ny = py + dy[i];
var nx = px + dx[i];
if (ny < 0 || ny >= n || nx < 0 || nx >= n)
continue;
var nhp = p.hp - map[ny][nx];
if (dist[ny * n + nx, p.dist + 1] < nhp)
{
dist[ny * n + nx, p.dist + 1] = nhp;
q.Enqueue(new State(ny * n + nx, p.dist + 1, nhp));
}
}
}
for (int i = 0; i < n * n; i++)
if (dist[gy * n + gx, i] > 0)
{
IO.Printer.Out.WriteLine(i);
return;
}
IO.Printer.Out.WriteLine(-1);
}
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; }
}
}
struct State
{
public int pos;
public int dist, hp;
public State(int p, int d, int v)
: this()
{
pos = p; dist = d; hp = v;
}
}
#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; }
private 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