結果
問題 | No.240 ナイト散歩 |
ユーザー | nokonoko |
提出日時 | 2017-09-24 08:27:47 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 31 ms / 2,000 ms |
コード長 | 4,832 bytes |
コンパイル時間 | 1,191 ms |
コンパイル使用メモリ | 119,136 KB |
実行使用メモリ | 27,480 KB |
最終ジャッジ日時 | 2024-11-14 06:52:14 |
合計ジャッジ時間 | 3,389 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 30 ms
27,224 KB |
testcase_01 | AC | 29 ms
25,140 KB |
testcase_02 | AC | 31 ms
25,088 KB |
testcase_03 | AC | 31 ms
25,260 KB |
testcase_04 | AC | 31 ms
25,216 KB |
testcase_05 | AC | 31 ms
27,352 KB |
testcase_06 | AC | 30 ms
27,016 KB |
testcase_07 | AC | 30 ms
25,228 KB |
testcase_08 | AC | 30 ms
27,132 KB |
testcase_09 | AC | 30 ms
26,512 KB |
testcase_10 | AC | 30 ms
25,224 KB |
testcase_11 | AC | 30 ms
25,460 KB |
testcase_12 | AC | 30 ms
27,220 KB |
testcase_13 | AC | 31 ms
25,220 KB |
testcase_14 | AC | 30 ms
27,476 KB |
testcase_15 | AC | 31 ms
25,264 KB |
testcase_16 | AC | 30 ms
27,088 KB |
testcase_17 | AC | 30 ms
24,956 KB |
testcase_18 | AC | 30 ms
24,468 KB |
testcase_19 | AC | 31 ms
24,964 KB |
testcase_20 | AC | 30 ms
27,480 KB |
testcase_21 | AC | 30 ms
25,348 KB |
testcase_22 | AC | 30 ms
25,096 KB |
testcase_23 | AC | 30 ms
27,272 KB |
testcase_24 | AC | 31 ms
25,436 KB |
testcase_25 | AC | 30 ms
24,852 KB |
testcase_26 | AC | 30 ms
25,348 KB |
testcase_27 | AC | 30 ms
26,656 KB |
testcase_28 | AC | 30 ms
23,088 KB |
testcase_29 | AC | 31 ms
27,120 KB |
testcase_30 | AC | 30 ms
25,352 KB |
testcase_31 | AC | 31 ms
25,092 KB |
testcase_32 | AC | 30 ms
25,228 KB |
testcase_33 | AC | 31 ms
27,376 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.Int64; using DEC = System.Double; class Program { public static IO IO = new IO(); static void Main(string[] args) { INT[] xy = IO.INT(' '); PAIR<POINT<INT>, INT> a = new PAIR<POINT<INT>, INT>(new POINT<INT>(xy[0], xy[1], 0), 0); BFSPOINT<INT> q = new BFSPOINT<INT>(100, -100); string o = "NO"; q.PUSH(0, 0, 0, 0); while (q.SIZE() != 0) { PAIR<POINT<INT>, INT> x = q.POP(); if (x.SAME(a)) { o = "YES"; break; } if (x.VALUE < 3) { x.VALUE++; q.PUSH(x.KEY.X - 2, x.KEY.Y - 1, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X - 2, x.KEY.Y + 1, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X - 1, x.KEY.Y - 2, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X - 1, x.KEY.Y + 2, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X + 1, x.KEY.Y - 2, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X + 1, x.KEY.Y + 2, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X + 2, x.KEY.Y - 1, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X + 2, x.KEY.Y + 1, x.KEY.Z, x.VALUE); } } IO.WRITE(o); IO.FLUSH(); } public static int BIT(INT n) { int ret = 0; for (int i = 0; i < 32; i++) { if ((1 << i & n) != 0) { ret++; } } return ret; } } public class BFSPOINT<T> : QUEUE<PAIR<POINT<INT>, T>> { private bool[,,] f; private INT MIN; public BFSPOINT(INT max, INT min = 0) : base(max) { MIN = min; f = new bool[max - min, max - min, max - min]; } 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 - MIN; INT y = k.Y - MIN; INT z = k.Z - MIN; INT max = m - MIN; if (x >= 0 && x < max && y >= 0 && y < max && z >= 0 && z < max && !f[x, y, z]) { f[x, y, z] = 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 S = new StringBuilder(); private T R<T>(Func<string, T> f) { return f(Console.ReadLine()); } private T[] R<T>(Func<string, T> f, char c) { return STR().Split(c).Select(f).ToArray(); } private T[] R<T>(Func<string, 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<string, 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, string> f, T v, bool lf = true) { S.Append(f(v)); if (lf) { S.Append('\n'); } if (S.Length >= WMAX) { FLUSH(); } } public STR STR() { return R(s => s); } public STR[] STR(char c) { return R(s => s, c); } public STR[] STR(int l) { return R(s => s, l); } public STR[][] STR(int l, char c) { return R(s => s, l, c); } public INT INT() { return R(long.Parse); } public INT[] INT(char c) { return R(long.Parse, c); } public INT[] INT(int l) { return R(long.Parse, l); } public INT[][] INT(int l, char c) { return R(long.Parse, l, c); } public DEC DEC() { return R(double.Parse); } public DEC[] DEC(char c) { return R(double.Parse, c); } public DEC[] DEC(int l) { return R(double.Parse, l); } public DEC[][] DEC(int l, char c) { return R(double.Parse, l, c); } public void WRITE(object s, bool lf = true) { W(v => v.ToString(), s, lf); } public void FLUSH() { Console.Write(S); S.Length = 0; } }