結果
問題 | No.2328 Build Walls |
ユーザー | 👑 kakel-san |
提出日時 | 2023-10-15 20:59:25 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 585 ms / 3,000 ms |
コード長 | 3,930 bytes |
コンパイル時間 | 4,357 ms |
コンパイル使用メモリ | 66,644 KB |
実行使用メモリ | 34,472 KB |
最終ジャッジ日時 | 2023-10-15 20:59:42 |
合計ジャッジ時間 | 15,744 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
21,940 KB |
testcase_01 | AC | 62 ms
19,876 KB |
testcase_02 | AC | 62 ms
19,784 KB |
testcase_03 | AC | 61 ms
21,912 KB |
testcase_04 | AC | 62 ms
23,808 KB |
testcase_05 | AC | 62 ms
21,980 KB |
testcase_06 | AC | 61 ms
21,904 KB |
testcase_07 | AC | 62 ms
21,932 KB |
testcase_08 | AC | 61 ms
21,936 KB |
testcase_09 | AC | 61 ms
23,924 KB |
testcase_10 | AC | 64 ms
21,748 KB |
testcase_11 | AC | 62 ms
21,884 KB |
testcase_12 | AC | 62 ms
21,772 KB |
testcase_13 | AC | 152 ms
29,204 KB |
testcase_14 | AC | 207 ms
29,444 KB |
testcase_15 | AC | 178 ms
29,132 KB |
testcase_16 | AC | 87 ms
24,044 KB |
testcase_17 | AC | 176 ms
27,644 KB |
testcase_18 | AC | 68 ms
21,924 KB |
testcase_19 | AC | 80 ms
26,128 KB |
testcase_20 | AC | 77 ms
21,840 KB |
testcase_21 | AC | 139 ms
27,000 KB |
testcase_22 | AC | 285 ms
27,640 KB |
testcase_23 | AC | 524 ms
32,368 KB |
testcase_24 | AC | 473 ms
32,220 KB |
testcase_25 | AC | 494 ms
34,472 KB |
testcase_26 | AC | 418 ms
32,256 KB |
testcase_27 | AC | 457 ms
32,220 KB |
testcase_28 | AC | 204 ms
31,028 KB |
testcase_29 | AC | 515 ms
34,380 KB |
testcase_30 | AC | 220 ms
32,304 KB |
testcase_31 | AC | 215 ms
28,976 KB |
testcase_32 | AC | 460 ms
30,168 KB |
testcase_33 | AC | 585 ms
34,416 KB |
testcase_34 | AC | 226 ms
33,872 KB |
testcase_35 | AC | 523 ms
32,392 KB |
testcase_36 | AC | 62 ms
23,800 KB |
ソースコード
using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var c = NList; var (h, w) = (c[0], c[1]); var map = NArr(h - 2); var INF = int.MaxValue / 2; var dp = new int[map.Length][]; for (var i = 0; i < dp.Length; ++i) dp[i] = Enumerable.Repeat(INF, w).ToArray(); var q = new PriorityQueue<Pair>(h * w, false); for (var i = 0; i < map.Length; ++i) if (map[i][0] > 0) { q.Enqueue(new Pair(i, 0, map[i][0])); dp[i][0] = map[i][0]; } var mx = new int[] { -1, -1, -1, 0, 0, 1, 1, 1 }; var my = new int[] { -1, 0, 1, -1, 1, -1, 0, 1 }; while (q.Count > 0) { var cur = q.Dequeue(); if (dp[cur.X][cur.Y] != cur.Val) continue; for (var i = 0; i < mx.Length; ++i) { var nx = cur.X + mx[i]; var ny = cur.Y + my[i]; if (nx < 0 || nx >= map.Length || ny < 0 || ny >= w) continue; if (map[nx][ny] < 0) continue; if (dp[nx][ny] <= cur.Val + map[nx][ny]) continue; dp[nx][ny] = cur.Val + map[nx][ny]; q.Enqueue(new Pair(nx, ny, dp[nx][ny])); } } var ans = INF; for (var i = 0; i < dp.Length; ++i) ans = Math.Min(ans, dp[i][w - 1]); WriteLine(ans == INF ? -1 : ans); } class Pair : IComparable<Pair> { public int X; public int Y; public int Val; public Pair(int x, int y, int val) { X = x; Y = y; Val = val; } public int CompareTo(Pair b) { return Val.CompareTo(b.Val); } } class PriorityQueue<T> where T : IComparable<T> { public T[] List; public int Count; bool IsTopMax; public PriorityQueue(int count, bool isTopMax) { IsTopMax = isTopMax; List = new T[Math.Max(128, count)]; } public void Enqueue(T value) { if (Count == List.Length) { var newlist = new T[List.Length * 2]; for (var i = 0; i < List.Length; ++i) newlist[i] = List[i]; List = newlist; } var pos = Count; List[pos] = value; ++Count; while (pos > 0) { var parent = (pos - 1) / 2; if (Calc(List[parent], List[pos], true)) break; Swap(parent, pos); pos = parent; } } public T Dequeue() { --Count; Swap(0, Count); var pos = 0; while (true) { var child = pos * 2 + 1; if (child >= Count) break; if (child + 1 < Count && Calc(List[child + 1], List[child], false)) ++child; if (Calc(List[pos], List[child], true)) break; Swap(pos, child); pos = child; } return List[Count]; } bool Calc(T a, T b, bool equalVal) { var ret = a.CompareTo(b); if (ret == 0 && equalVal) return true; return IsTopMax ? ret > 0 : ret < 0; } void Swap(int a, int b) { var tmp = List[a]; List[a] = List[b]; List[b] = tmp; } } }