結果
| 問題 | No.323 yuki国 |
| ユーザー |
 nokonoko
|
| 提出日時 | 2017-09-24 10:43:06 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 3,419 ms / 5,000 ms |
| コード長 | 5,265 bytes |
| コンパイル時間 | 1,308 ms |
| コンパイル使用メモリ | 111,872 KB |
| 実行使用メモリ | 318,292 KB |
| 最終ジャッジ日時 | 2024-06-28 12:41:43 |
| 合計ジャッジ時間 | 27,584 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 6 |
| other | AC * 32 |
コンパイルメッセージ
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.Text;using System.Collections.Generic;using STR = System.String;using INT = System.Int32;using DEC = System.Double;class Program{public static IO IO = new IO();static void Main(string[] args){INT[] hw = IO.I(' ');INT[] a = IO.I(' ');INT[] b = IO.I(' ');STR[] s = IO.S(hw[0]);PAIR<POINT<INT>, INT> c = new PAIR<POINT<INT>, INT>(new POINT<INT>(b[0], b[1], b[2]), 0);BFSPOINT<INT> q = new BFSPOINT<INT>(1001 * hw[0] * hw[1], 5000, hw[0], hw[1], 1, 0, 0);string o = "No";q.PUSH(a[0], a[1], a[2], 0);while (q.SIZE() != 0){PAIR<POINT<INT>, INT> x = q.POP();if (x.SAME(c)) { o = "Yes"; break; }if (x.KEY.Y - 1 >= 0){if (s[x.KEY.Y - 1][x.KEY.Z] == '*') { q.PUSH(x.KEY.X + 1, x.KEY.Y - 1, x.KEY.Z, x.VALUE + 1); }else { q.PUSH(x.KEY.X - 1, x.KEY.Y - 1, x.KEY.Z, x.VALUE + 1); }}if (x.KEY.Y + 1 < hw[0]){if (s[x.KEY.Y + 1][x.KEY.Z] == '*') { q.PUSH(x.KEY.X + 1, x.KEY.Y + 1, x.KEY.Z, x.VALUE + 1); }else { q.PUSH(x.KEY.X - 1, x.KEY.Y + 1, x.KEY.Z, x.VALUE + 1); }}if (x.KEY.Z - 1 >= 0){if (s[x.KEY.Y][x.KEY.Z - 1] == '*') { q.PUSH(x.KEY.X + 1, x.KEY.Y, x.KEY.Z - 1, x.VALUE + 1); }else { q.PUSH(x.KEY.X - 1, x.KEY.Y, x.KEY.Z - 1, x.VALUE + 1); }}if (x.KEY.Z + 1 < hw[1]){if (s[x.KEY.Y][x.KEY.Z + 1] == '*') { q.PUSH(x.KEY.X + 1, x.KEY.Y, x.KEY.Z + 1, x.VALUE + 1); }else { q.PUSH(x.KEY.X - 1, x.KEY.Y, x.KEY.Z + 1, x.VALUE + 1); }}}IO.W(o);IO.F();}}public class BFSPOINT<T> : QUEUE<PAIR<POINT<INT>, T>>{private bool[,,] f;private INT MAXX, MAXY, MAXZ, MINX, MINY, MINZ;public BFSPOINT(INT qmax, INT maxX, INT maxY, INT maxZ, INT minX = 0, INT minY = 0, INT minZ = 0) : base(qmax){MAXX = maxX; MAXY = maxY; MAXZ = maxZ; MINX = minX; MINY = minY; MINZ = minZ;f = new bool[MAXX - MINX, MAXY - MINY, MAXZ - MINZ];}public void PUSH(INT x, INT y, INT z, T value) { PUSH(new PAIR<POINT<INT>, T>(new POINT<INT>(x, y, z), value)); }public override void PUSH(PAIR<POINT<INT>, T> v){POINT<INT> k = v.KEY;INT x = k.X;INT y = k.Y;INT z = k.Z;if (x >= MINX && x < MAXX && y >= MINY && y < MAXY && z >= MINZ && z < MAXZ && !f[x - MINX, y - MINY, z - MINZ]){f[x - MINX, y - MINY, z - MINZ] = true; base.PUSH(v);}}}public class POINT<T> : IEquatable<POINT<T>> where T : IEquatable<T>{public T X;public T Y;public T Z;public POINT(T x, T y, T z) { X = x; Y = y; Z = z; }public bool SAME(POINT<T> b) { return Equals(b); }public bool Equals(POINT<T> b) { return X.Equals(b.X) && Y.Equals(b.Y) && Z.Equals(b.Z); }}public class QUEUE<T>{protected INT m;private INT s, e, c;private T[] q;public QUEUE(INT max) { m = max; q = new T[m]; CLEAR(); }public void CLEAR() { e = 0; s = 0; c = 0; }public INT SIZE() { return c; }public T TOP() { return q[0]; }public T POP() { T r = q[s++]; s %= m; c--; return r; }public virtual void PUSH(T v) { q[e++] = v; e %= m; c++; }public bool EMPTY() { return SIZE() == 0; }}public class PAIR<T, U> : IEquatable<PAIR<T, U>> where T : IEquatable<T>{public T KEY;public U VALUE;public PAIR(T key, U value) { KEY = key; VALUE = value; }public bool SAME(PAIR<T, U> b) { return Equals(b); }public bool Equals(PAIR<T, U> b) { return KEY.Equals(b.KEY); }}public class IO{private const int WMAX = 1000;private StringBuilder SB = new StringBuilder();private T R<T>(Func<STR, T> f) { return f(Console.ReadLine()); }private T[] R<T>(Func<STR, T> f, char c) { return S().Split(c).Select(f).ToArray(); }private T[] R<T>(Func<STR, T> f, INT l) { T[] r = new T[l]; for (INT i = 0; i < l; i++) { r[i] = R(f); } return r; }private T[][] R<T>(Func<STR, T> f, INT l, char c) { T[][] r = new T[l][]; for (INT i = 0; i < l; i++) { r[i] = R<T>(f, c); } return r; }private void W<T>(Func<T, STR> f, T v, bool lf = true) { SB.Append(f(v)); if (lf) { SB.Append('\n'); } if (SB.Length >= WMAX) { F(); } }public STR S() { return R(s => s); }public STR[] S(char c) { return R(s => s, c); }public STR[] S(INT l) { return R(s => s, l); }public STR[][] S(INT l, char c) { return R(s => s, l, c); }public INT I() { return R(INT.Parse); }public INT[] I(char c) { return R(INT.Parse, c); }public INT[] I(INT l) { return R(INT.Parse, l); }public INT[][] I(INT l, char c) { return R(INT.Parse, l, c); }public DEC D() { return R(DEC.Parse); }public DEC[] D(char c) { return R(DEC.Parse, c); }public DEC[] D(INT l) { return R(DEC.Parse, l); }public DEC[][] D(INT l, char c) { return R(DEC.Parse, l, c); }public void W(object s, bool lf = true) { W(v => v.ToString(), s, lf); }public void F() { Console.Write(SB); SB.Length = 0; }}