結果
問題 | No.424 立体迷路 |
ユーザー | くれちー |
提出日時 | 2017-07-20 20:45:08 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 23 ms / 2,000 ms |
コード長 | 4,115 bytes |
コンパイル時間 | 803 ms |
コンパイル使用メモリ | 111,744 KB |
実行使用メモリ | 19,200 KB |
最終ジャッジ日時 | 2024-07-05 07:14:36 |
合計ジャッジ時間 | 2,072 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 23 ms
18,944 KB |
testcase_01 | AC | 23 ms
18,816 KB |
testcase_02 | AC | 23 ms
18,944 KB |
testcase_03 | AC | 23 ms
19,072 KB |
testcase_04 | AC | 23 ms
19,072 KB |
testcase_05 | AC | 22 ms
18,944 KB |
testcase_06 | AC | 23 ms
18,944 KB |
testcase_07 | AC | 23 ms
19,072 KB |
testcase_08 | AC | 22 ms
19,072 KB |
testcase_09 | AC | 22 ms
18,816 KB |
testcase_10 | AC | 22 ms
19,072 KB |
testcase_11 | AC | 22 ms
19,200 KB |
testcase_12 | AC | 22 ms
19,072 KB |
testcase_13 | AC | 22 ms
19,072 KB |
testcase_14 | AC | 22 ms
19,072 KB |
testcase_15 | AC | 22 ms
18,944 KB |
testcase_16 | AC | 21 ms
18,816 KB |
testcase_17 | AC | 22 ms
19,200 KB |
testcase_18 | AC | 22 ms
19,200 KB |
testcase_19 | AC | 22 ms
19,200 KB |
testcase_20 | AC | 22 ms
19,072 KB |
testcase_21 | AC | 21 ms
18,816 KB |
testcase_22 | AC | 21 ms
18,816 KB |
testcase_23 | AC | 22 ms
18,944 KB |
testcase_24 | AC | 22 ms
18,944 KB |
testcase_25 | AC | 22 ms
18,944 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.Collections; using System.Collections.Generic; using System.IO; using System.Linq; using System.Numerics; using System.Text; using static System.Console; using static System.Convert; using static System.Math; using static Extentions; class IO { int idx; string[] input; public IO(TextReader reader) { input = reader.ReadToEnd().Split(new[] { " ", Environment.NewLine }, StringSplitOptions.RemoveEmptyEntries); } T Get<T>(Func<string, T> parser) => parser(input[idx++]); public string S => Get(s => s); public char C => Get(char.Parse); public int I => Get(int.Parse); public long L => Get(long.Parse); public double F => Get(double.Parse); public decimal D => Get(decimal.Parse); public BigInteger B => Get(BigInteger.Parse); T[] Gets<T>(int n, Func<string, T> parser) => input.Skip((idx += n) - n).Take(n).Select(parser).ToArray(); public string[] Ss(int n) => Gets(n, s => s); public char[] Cs(int n) => Gets(n, char.Parse); public int[] Is(int n) => Gets(n, int.Parse); public long[] Ls(int n) => Gets(n, long.Parse); public double[] Fs(int n) => Gets(n, double.Parse); public decimal[] Ds(int n) => Gets(n, decimal.Parse); public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse); public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs)); public void Write(params object[] xs) => WriteLine(string.Join(" ", xs)); } class UnionFind { int[] tree; public int CountGroups => tree.Count(x => x < 0); public UnionFind(int length) { tree = Enumerable.Repeat(-1, length).ToArray(); } public bool Union(int x, int y) { x = this.Find(x); y = this.Find(y); if (x == y) return false; if (tree[x] > tree[y]) Swap(ref x, ref y); tree[x] += tree[y]; tree[y] = x; return true; } public int Find(int x) { if (tree[x] < 0) return x; return tree[x] = this.Find(tree[x]); } public bool IsSameGroup(int x, int y) => this.Find(x) == this.Find(y); } static class Extentions { public static void Swap<T>(ref T x, ref T y) { var tmp = x; x = y; y = tmp; } } static class Program { public static void Main() { #if !DEBUG SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false }); #endif Solve(new IO(In)); Out.Flush(); } static void Solve(IO io) { var h = io.I; var w = io.I; var sp = Encode(io.I - 1, io.I - 1); var gp = Encode(io.I - 1, io.I - 1); var b = new int[h, w]; var uf = new UnionFind(5050); for (var i = 0; i < h; i++) { var s = io.S; for (var j = 0; j < w; j++) b[i, j] = s[j] - '0'; } for (var i = 0; i < h; i++) { for (var j = 0; j < w; j++) { if (j == 0) continue; var p1 = Encode(i, j - 1); var p2 = Encode(i, j); if (CanMove(b[i, j - 1], b[i, j])) uf.Union(p1, p2); if (j == w - 1) continue; var p3 = Encode(i, j + 1); if (CanMove(b[i, j - 1], b[i, j], b[i, j + 1])) uf.Union(p1, p3); } } for (var j = 0; j < w; j++) { for (var i = 0; i < h; i++) { if (i == 0) continue; var p1 = Encode(i - 1, j); var p2 = Encode(i, j); if (CanMove(b[i - 1, j], b[i, j])) uf.Union(p1, p2); if (i == h - 1) continue; var p3 = Encode(i + 1, j); if (CanMove(b[i - 1, j], b[i, j], b[i + 1, j])) uf.Union(p1, p3); } } if (uf.IsSameGroup(sp, gp)) io.Write("YES"); else io.Write("NO"); } static int Encode(int x, int y) => x * 100 + y; static bool CanMove(int h1, int h2) => Abs(h1 - h2) <= 1; static bool CanMove(int h1, int h2, int h3) => h1 == h3 && h2 <= h1; }