結果
問題 | No.323 yuki国 |
ユーザー | nokonoko |
提出日時 | 2017-09-24 10:43:06 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 3,484 ms / 5,000 ms |
コード長 | 5,265 bytes |
コンパイル時間 | 2,823 ms |
コンパイル使用メモリ | 110,448 KB |
実行使用メモリ | 322,436 KB |
最終ジャッジ日時 | 2023-09-10 21:39:22 |
合計ジャッジ時間 | 30,787 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 64 ms
21,836 KB |
testcase_01 | AC | 65 ms
23,804 KB |
testcase_02 | AC | 63 ms
21,840 KB |
testcase_03 | AC | 65 ms
22,256 KB |
testcase_04 | AC | 63 ms
22,064 KB |
testcase_05 | AC | 81 ms
28,728 KB |
testcase_06 | AC | 67 ms
24,052 KB |
testcase_07 | AC | 64 ms
22,028 KB |
testcase_08 | AC | 3,101 ms
320,600 KB |
testcase_09 | AC | 790 ms
129,048 KB |
testcase_10 | AC | 64 ms
21,980 KB |
testcase_11 | AC | 64 ms
21,908 KB |
testcase_12 | AC | 64 ms
22,028 KB |
testcase_13 | AC | 678 ms
122,976 KB |
testcase_14 | AC | 3,113 ms
322,220 KB |
testcase_15 | AC | 618 ms
119,784 KB |
testcase_16 | AC | 1,516 ms
229,380 KB |
testcase_17 | AC | 683 ms
118,076 KB |
testcase_18 | AC | 69 ms
23,980 KB |
testcase_19 | AC | 1,894 ms
206,664 KB |
testcase_20 | AC | 82 ms
27,604 KB |
testcase_21 | AC | 3,482 ms
322,148 KB |
testcase_22 | AC | 244 ms
57,704 KB |
testcase_23 | AC | 3,484 ms
320,344 KB |
testcase_24 | AC | 120 ms
33,936 KB |
testcase_25 | AC | 680 ms
117,860 KB |
testcase_26 | AC | 121 ms
35,880 KB |
testcase_27 | AC | 3,300 ms
322,436 KB |
testcase_28 | AC | 727 ms
123,036 KB |
testcase_29 | AC | 727 ms
123,100 KB |
testcase_30 | AC | 64 ms
21,896 KB |
testcase_31 | AC | 65 ms
21,904 KB |
testcase_32 | AC | 70 ms
24,080 KB |
testcase_33 | AC | 69 ms
24,028 KB |
testcase_34 | AC | 73 ms
28,872 KB |
testcase_35 | AC | 64 ms
23,876 KB |
testcase_36 | AC | 67 ms
25,984 KB |
testcase_37 | AC | 64 ms
21,936 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.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; } }