結果
問題 | No.157 2つの空洞 |
ユーザー | eitaho |
提出日時 | 2015-03-04 20:32:30 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 615 ms / 2,000 ms |
コード長 | 3,461 bytes |
コンパイル時間 | 3,601 ms |
コンパイル使用メモリ | 108,664 KB |
実行使用メモリ | 23,780 KB |
最終ジャッジ日時 | 2023-09-06 12:03:42 |
合計ジャッジ時間 | 8,804 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 62 ms
21,852 KB |
testcase_01 | AC | 61 ms
21,708 KB |
testcase_02 | AC | 61 ms
19,588 KB |
testcase_03 | AC | 63 ms
23,780 KB |
testcase_04 | AC | 63 ms
21,680 KB |
testcase_05 | AC | 66 ms
21,620 KB |
testcase_06 | AC | 82 ms
19,756 KB |
testcase_07 | AC | 62 ms
21,860 KB |
testcase_08 | AC | 62 ms
23,660 KB |
testcase_09 | AC | 66 ms
23,652 KB |
testcase_10 | AC | 62 ms
23,740 KB |
testcase_11 | AC | 92 ms
21,712 KB |
testcase_12 | AC | 167 ms
21,760 KB |
testcase_13 | AC | 270 ms
21,744 KB |
testcase_14 | AC | 341 ms
21,744 KB |
testcase_15 | AC | 459 ms
21,756 KB |
testcase_16 | AC | 604 ms
21,672 KB |
testcase_17 | AC | 611 ms
21,704 KB |
testcase_18 | AC | 601 ms
21,800 KB |
testcase_19 | AC | 615 ms
21,824 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.Diagnostics; using System.Collections.Generic; using System.Text.RegularExpressions; using Enu = System.Linq.Enumerable; class Program { static readonly int INF = (int)1e9; static readonly int[] DR = { 0, 0, -1, 1 }; static readonly int[] DC = { -1, 1, 0, 0 }; void Solve() { int W = reader.Int(), H = reader.Int(); var grid = reader.StringArray(H); int[,] dist = new int[H * W, H * W]; Func<int, int, int> Id = (r, c) => r * W + c; Func<int, int, bool> IsInside = (r, c) => r >= 0 && r < H && c >= 0 && c < W; for (int a = 0; a < H * W; a++) for (int b = a + 1; b < H * W; b++) dist[a, b] = dist[b, a] = INF; for (int r = 0; r < H; r++) for (int c = 0; c < W; c++) for (int d = 0; d < DR.Length; d++) { int nr = r + DR[d], nc = c + DC[d]; if (IsInside(nr, nc)) dist[Id(r, c), Id(nr, nc)] = (grid[nr][nc] == '.') ? 0 : 1; } for (int c = 0; c < H * W; c++) for (int a = 0; a < H * W; a++) for (int b = 0; b < H * W; b++) dist[a, b] = Math.Min(dist[a, b], dist[a, c] + dist[c, b]); int ans = INF; for (int r = 0; r < H; r++) for (int c = 0; c < W; c++) for (int nr = 0; nr < H; nr++) for (int nc = 0; nc < W; nc++) if ((r != nr || c != nc) && grid[r][c] == '.' && grid[nr][nc] == '.') { int d = dist[Id(r, c), Id(nr, nc)]; if (d > 0) ans = Math.Min(ans, d); } Console.WriteLine(ans); } Reader reader = new Reader(Console.In); static void Main() { new Program().Solve(); } } class Reader { private readonly TextReader reader; private readonly char[] separator = { ' ' }; private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries; private string[] A = new string[0]; private int i; public Reader(TextReader r) { reader = r; } public Reader(string file) { reader = new StreamReader(file); } public bool HasNext() { return Enqueue(); } public string String() { return Dequeue(); } public int Int() { return int.Parse(Dequeue()); } public long Long() { return long.Parse(Dequeue()); } public double Double() { return double.Parse(Dequeue()); } public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); } public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public string Line() { return reader.ReadLine().Trim(); } private string[] Split(string s) { return s.Split(separator, removeOp); } private bool Enqueue() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return Enqueue(); A = Split(line); i = 0; return true; } private string Dequeue() { Enqueue(); return A[i++]; } }