結果
問題 | No.424 立体迷路 |
ユーザー | 紙ぺーぱー |
提出日時 | 2016-09-24 20:16:00 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 25 ms / 2,000 ms |
コード長 | 6,979 bytes |
コンパイル時間 | 1,108 ms |
コンパイル使用メモリ | 113,152 KB |
実行使用メモリ | 17,664 KB |
最終ジャッジ日時 | 2024-07-05 07:10:03 |
合計ジャッジ時間 | 2,585 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 25 ms
17,536 KB |
testcase_01 | AC | 25 ms
17,536 KB |
testcase_02 | AC | 23 ms
17,152 KB |
testcase_03 | AC | 24 ms
17,536 KB |
testcase_04 | AC | 23 ms
17,536 KB |
testcase_05 | AC | 24 ms
17,280 KB |
testcase_06 | AC | 23 ms
17,280 KB |
testcase_07 | AC | 24 ms
17,408 KB |
testcase_08 | AC | 23 ms
17,536 KB |
testcase_09 | AC | 23 ms
17,280 KB |
testcase_10 | AC | 24 ms
17,408 KB |
testcase_11 | AC | 23 ms
17,536 KB |
testcase_12 | AC | 23 ms
17,408 KB |
testcase_13 | AC | 23 ms
17,536 KB |
testcase_14 | AC | 23 ms
17,536 KB |
testcase_15 | AC | 23 ms
17,536 KB |
testcase_16 | AC | 24 ms
17,152 KB |
testcase_17 | AC | 24 ms
17,408 KB |
testcase_18 | AC | 23 ms
17,152 KB |
testcase_19 | AC | 25 ms
17,664 KB |
testcase_20 | AC | 24 ms
17,664 KB |
testcase_21 | AC | 23 ms
17,408 KB |
testcase_22 | AC | 23 ms
17,408 KB |
testcase_23 | AC | 23 ms
17,408 KB |
testcase_24 | AC | 25 ms
17,408 KB |
testcase_25 | AC | 25 ms
17,408 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.Linq; using System.Linq.Expressions; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; using Number = System.Int64; namespace Program { public class Solver { public void Solve() { var h = sc.Integer(); var w = sc.Integer(); var set = new DisjointSet(h * w); var a = sc.Integer(2); var b = sc.Integer(2); var s = Enumerate(h, x => sc.Scan()); int[] dx = { 1, 0, -1, 0 }; int[] dy = { 0, 1, 0, -1 }; for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) { for (int k = 0; k < 4; k++) { { var nx = i + dx[k]; var ny = j + dy[k]; if (nx < 0 || nx >= h || ny < 0 || ny >= w) continue; var u = s[i][j] - '0'; var v = s[nx][ny] - '0'; if (Math.Abs(u - v) <= 1) set.Unite(i * w + j, nx * w + ny); } { var nx = i + 2 * dx[k]; var ny = j + 2 * dy[k]; if (nx < 0 || nx >= h || ny < 0 || ny >= w) continue; var u = s[i][j] - '0'; var v = s[nx][ny] - '0'; var r = s[(i + nx) / 2][(j + ny) / 2] - '0'; if (u == v && u > r) set.Unite(i * w + j, nx * w + ny); } } } for (int i = 0; i < 2; i++) { a[i]--; b[i]--; } if (set.IsUnited(a[0] * w + a[1], b[0] * w + b[1])) IO.Printer.Out.WriteLine("YES"); else IO.Printer.Out.WriteLine("NO"); } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region main static class Ex { static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; public class Printer: StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); } public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public string ScanLine() { var sb = new StringBuilder(); for (var b = Char(); b != '\n'; b = (char)read()) if (b == 0) break; else if (b != '\r') sb.Append(b); return sb.ToString(); } public long Long() { if (isEof) return long.MinValue; long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != 0 && b != '-' && (b < '0' || '9' < b)); if (b == 0) return long.MinValue; if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; } private T[] enumerate<T>(int n, Func<T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public char[] Char(int n) { return enumerate(n, Char); } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } } } #endregion #region DisjointSet public class DisjointSet { int[] par; byte[] rank; public DisjointSet(int n) { par = new int[n]; for (int i = 0; i < n; i++) par[i] = -1; rank = new byte[n]; } public int this[int id] { get { if ((par[id] < 0)) return id; return par[id] = this[par[id]]; } } public bool Unite(int x, int y) { x = this[x]; y = this[y]; if (x == y) return false; if (rank[x] < rank[y]) { par[y] += par[x]; par[x] = y; } else { par[x] += par[y]; par[y] = x; if (rank[x] == rank[y]) rank[x]++; } return true; } public int Size(int x) { return -par[this[x]]; } public bool IsUnited(int x, int y) { return this[x] == this[y]; } } #endregion