結果
| 問題 | No.20 砂漠のオアシス |
| ユーザー |
 ひばち
|
| 提出日時 | 2019-11-19 20:33:57 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,839 bytes |
| コンパイル時間 | 952 ms |
| コンパイル使用メモリ | 119,112 KB |
| 実行使用メモリ | 29,792 KB |
| 最終ジャッジ日時 | 2024-10-04 06:52:29 |
| 合計ジャッジ時間 | 2,350 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 28 ms
23,344 KB |
| testcase_01 | WA | - |
| testcase_02 | AC | 28 ms
25,332 KB |
| testcase_03 | AC | 29 ms
27,244 KB |
| testcase_04 | AC | 29 ms
25,392 KB |
| testcase_05 | AC | 64 ms
24,276 KB |
| testcase_06 | AC | 57 ms
27,504 KB |
| testcase_07 | WA | - |
| testcase_08 | AC | 39 ms
29,792 KB |
| testcase_09 | AC | 39 ms
29,548 KB |
| testcase_10 | AC | 29 ms
25,464 KB |
| testcase_11 | AC | 30 ms
25,652 KB |
| testcase_12 | AC | 28 ms
27,248 KB |
| testcase_13 | AC | 29 ms
27,564 KB |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | AC | 30 ms
25,452 KB |
| testcase_18 | WA | - |
| testcase_19 | AC | 31 ms
27,568 KB |
| testcase_20 | WA | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using static Template;
using static System.Console;
using static System.Convert;
using static System.Math;
using Pi = Pair<int, int>;
using Number = System.Int64;
class Solver
{
Scanner sc = new Scanner();
//
int N, V, ox, oy;
int[][] L;
public void Solve()
{
sc.Make(out N, out V, out ox, out oy);
L = sc.ArrInt2D(N);
var d = Dijkstra(0, 0);
if (d[N - 1][N - 1] < V)
Fail("YES");
if (ox == 0 && oy == 0)
Fail("NO");
ox--; oy--;
var dist = Dijkstra(oy, ox);
V -= dist[0][0]-L[0][0]+L[oy][ox];
V *= 2;
if (V > dist[N - 1][N - 1]) Fail("YES");
WriteLine("NO");
}
public int[][] Dijkstra(int ox,int oy)
{
var dist = Create(N, () => Create(N, () => int.MaxValue / 2));
dist[ox][oy] = 0;
var pq = new PriorityQueue<P>((a, b) => a.cost - b.cost);
pq.Enqueue(new P(L[ox][oy], ox, oy));
while (pq.Any())
{
var p = pq.Dequeue();
if (p.cost > dist[p.x][p.y]) continue;
for (var i = 0; i < 4; i++)
{
int x = p.x + gh[i], y = p.y + gw[i];
if (!Inside(x, y, N, N)) continue;
if (chmin(ref dist[x][y], p.cost + L[x][y]))
pq.Enqueue(new P(dist[x][y], x, y));
}
}
return dist;
}
struct P
{
public int cost, x, y;
public P(int c,int X,int Y)
{ cost = c;x = X;y = Y; }
}
int[] gh = new[] { 0, 0, 1, -1 }, gw = new[] { 1, -1, 0, 0 };
public static bool Inside(int h, int w, int hh, int ww)
=> 0 <= h && h < hh && 0 <= w && w < ww;
}
public class PriorityQueue<T>
{
private List<T> item = new List<T>();
private Comparison<T> cmp;
public int Count { get { return item.Count; } }
public T Peek { get { return item[0]; } }
public PriorityQueue() { cmp = Comparer<T>.Default.Compare; }
public PriorityQueue(Comparison<T> comparison) { cmp = comparison; }
public PriorityQueue(IComparer<T> comparer) { cmp = comparer.Compare; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
private int Parent(int i)
=> (i - 1) >> 1;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
private int Left(int i)
=> (i << 1) + 1;
public T Enqueue(T val)
{
int i = item.Count;
item.Add(val);
while (i > 0)
{
int p = Parent(i);
if (cmp(item[p], val) <= 0)
break;
item[i] = item[p];
i = p;
}
item[i] = val;
return val;
}
public T Dequeue()
{
var ret = item[0];
var p = 0;
var x = item[item.Count - 1];
while (Left(p) < item.Count - 1)
{
var l = Left(p);
if (l < item.Count - 2 && cmp(item[l + 1], item[l]) < 0) l++;
if (cmp(item[l], x) >= 0)
break;
item[p] = item[l];
p = l;
}
item[p] = x;
item.RemoveAt(item.Count - 1);
return ret;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public bool Any() => item.Count > 0;
}
#region Template
public class Template
{
static void Main(string[] args)
{
Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
new Solver().Solve();
Console.Out.Flush();
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static bool chmin<T>(ref T num, T val) where T : IComparable<T>
{ if (num.CompareTo(val) == 1) { num = val; return true; } return false; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static bool chmax<T>(ref T num, T val) where T : IComparable<T>
{ if (num.CompareTo(val) == -1) { num = val; return true; } return false; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static void swap<T>(ref T v1, ref T v2)
{ var t = v2; v2 = v1; v1 = t; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static T[] Create<T>(int n, Func<T> f)
{
var rt = new T[n];
for (var i = 0; i < rt.Length; ++i)
rt[i] = f();
return rt;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static T[] Create<T>(int n, Func<int, T> f)
{
var rt = new T[n];
for (var i = 0; i < rt.Length; ++i)
rt[i] = f(i);
return rt;
}
public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
public string Str => ReadLine().Trim();
public int Int => int.Parse(Str);
public long Long => long.Parse(Str);
public double Double => double.Parse(Str);
public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
public int[] ArrInt1D(int n) => Create(n, () => Int);
public long[] ArrLong1D(int n) => Create(n, () => Long);
public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
public Pair<T1, T2> PairMake<T1, T2>() => new Pair<T1, T2>(Next<T1>(), Next<T2>());
public Pair<T1, T2, T3> PairMake<T1, T2, T3>() => new Pair<T1, T2, T3>(Next<T1>(), Next<T2>(), Next<T3>());
private Queue<string> q = new Queue<string>();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
public void Make<T1>(out T1 v1) => v1 = Next<T1>();
public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
public T1 v1;
public T2 v2;
public Pair() { }
public Pair(T1 v1, T2 v2)
{ this.v1 = v1; this.v2 = v2; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public int CompareTo(Pair<T1, T2> p)
{
var c = Comparer<T1>.Default.Compare(v1, p.v1);
if (c == 0)
c = Comparer<T2>.Default.Compare(v2, p.v2);
return c;
}
public override string ToString()
=> $"{v1.ToString()} {v2.ToString()}";
public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}
public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
public T3 v3;
public Pair() : base() { }
public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
{ this.v3 = v3; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public int CompareTo(Pair<T1, T2, T3> p)
{
var c = base.CompareTo(p);
if (c == 0)
c = Comparer<T3>.Default.Compare(v3, p.v3);
return c;
}
public override string ToString()
=> $"{base.ToString()} {v3.ToString()}";
public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion