結果
問題 | No.340 雪の足跡 |
ユーザー | eitaho |
提出日時 | 2016-03-23 14:44:47 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 780 ms / 1,000 ms |
コード長 | 5,119 bytes |
コンパイル時間 | 888 ms |
コンパイル使用メモリ | 119,824 KB |
実行使用メモリ | 66,712 KB |
最終ジャッジ日時 | 2024-04-09 21:01:12 |
合計ジャッジ時間 | 11,998 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
25,696 KB |
testcase_01 | AC | 31 ms
25,564 KB |
testcase_02 | AC | 28 ms
27,300 KB |
testcase_03 | AC | 30 ms
25,460 KB |
testcase_04 | AC | 30 ms
27,476 KB |
testcase_05 | AC | 28 ms
25,244 KB |
testcase_06 | AC | 34 ms
25,568 KB |
testcase_07 | AC | 30 ms
27,348 KB |
testcase_08 | AC | 30 ms
25,568 KB |
testcase_09 | AC | 30 ms
25,516 KB |
testcase_10 | AC | 34 ms
25,396 KB |
testcase_11 | AC | 39 ms
25,696 KB |
testcase_12 | AC | 36 ms
25,824 KB |
testcase_13 | AC | 41 ms
25,844 KB |
testcase_14 | AC | 73 ms
30,720 KB |
testcase_15 | AC | 84 ms
30,352 KB |
testcase_16 | AC | 68 ms
30,148 KB |
testcase_17 | AC | 93 ms
33,412 KB |
testcase_18 | AC | 82 ms
30,732 KB |
testcase_19 | AC | 90 ms
31,484 KB |
testcase_20 | AC | 609 ms
59,236 KB |
testcase_21 | AC | 600 ms
56,012 KB |
testcase_22 | AC | 33 ms
30,408 KB |
testcase_23 | AC | 636 ms
54,348 KB |
testcase_24 | AC | 612 ms
60,836 KB |
testcase_25 | AC | 556 ms
61,676 KB |
testcase_26 | AC | 138 ms
44,932 KB |
testcase_27 | AC | 54 ms
28,052 KB |
testcase_28 | AC | 118 ms
41,884 KB |
testcase_29 | AC | 657 ms
64,576 KB |
testcase_30 | AC | 439 ms
53,580 KB |
testcase_31 | AC | 751 ms
61,656 KB |
testcase_32 | AC | 780 ms
66,712 KB |
testcase_33 | AC | 576 ms
56,912 KB |
testcase_34 | AC | 774 ms
64,264 KB |
testcase_35 | AC | 618 ms
58,812 KB |
testcase_36 | AC | 610 ms
58,868 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.IO; using System.Linq; using System.Text; using System.Collections.Generic; using System.Diagnostics; using System.Numerics; using Enu = System.Linq.Enumerable; class Program { static readonly int INF = (int)1e9; static readonly string Impossible = "Odekakedekinai.."; static readonly int[] DR = { 0, 1, 0, -1 }; static readonly int[] DC = { 1, 0, -1, 0 }; public void Solve() { int W = Reader.Int(), H = Reader.Int(), N = Reader.Int(); var table = Reader.IntTable(N * 2); var row = Enu.Range(0, H).Select(i => new List<int>()).ToArray(); var col = Enu.Range(0, W).Select(i => new List<int>()).ToArray(); for (int ti = 1; ti < N * 2; ti += 2) { var t = table[ti]; for (int i = 0; i + 1 < t.Length; i++) { int r = t[i] / W, c = t[i] % W; int nr = t[i + 1] / W, nc = t[i + 1] % W; if (r != nr) { col[c].Add(Math.Min(r, nr) * 2 + 1); col[c].Add(Math.Max(r, nr) * 2); } else { row[r].Add(Math.Min(c, nc) * 2 + 1); row[r].Add(Math.Max(c, nc) * 2); } } } bool[, ,] G = new bool[H, W, 4]; for (int r = 0; r < H; r++) { int last = 0, balance = 0; row[r].Sort(); foreach (var p in row[r]) { int delta = p % 2 * 2 - 1; int pos = p / 2; if (balance > 0) for (int c = last; c < pos; c++) G[r, c, 0] = G[r, c + 1, 2] = true; balance += delta; last = pos; } } for (int c = 0; c < W; c++) { int last = 0, balance = 0; col[c].Sort(); foreach (var p in col[c]) { int delta = p % 2 * 2 - 1; int pos = p / 2; if (balance > 0) for (int r = last; r < pos; r++) G[r, c, 1] = G[r + 1, c, 3] = true; balance += delta; last = pos; } } int ans = BFS(G, H, W); Console.WriteLine(ans == INF ? Impossible : ans + ""); } private int BFS(bool[, ,] G, int H, int W) { if (H == 1 && W == 1) return 0; var minCost = new int[H, W]; for (int r = 0; r < H; r++) for (int c = 0; c < W; c++) minCost[r, c] = INF; minCost[0, 0] = 0; var que = new Queue<int>(); que.Enqueue(0); que.Enqueue(0); while (que.Count > 0) { int r = que.Dequeue(), c = que.Dequeue(); for (int d = 0; d < DR.Length; d++) if (G[r, c, d]) { int nr = r + DR[d], nc = c + DC[d]; int nextCost = minCost[r, c] + 1; if (nextCost < minCost[nr, nc]) { if (nr == H - 1 && nc == W - 1) return nextCost; minCost[nr, nc] = nextCost; que.Enqueue(nr); que.Enqueue(nc); } } } return INF; } } class Entry { static void Main() { new Program().Solve(); } } class Reader { private static TextReader reader = Console.In; private static readonly char[] separator = { ' ' }; private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; private static string[] A = new string[0]; private static int i; private static void Init() { A = new string[0]; } public static void Set(TextReader r) { reader = r; Init(); } public static void Set(string file) { reader = new StreamReader(file); Init(); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Next()).ToArray(); } public static string Line() { return reader.ReadLine().Trim(); } private static string[] Split(string s) { return s.Split(separator, op); } private static string Next() { CheckNext(); return A[i++]; } private static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }