結果
問題 | No.240 ナイト散歩 |
ユーザー | Goryudyuma |
提出日時 | 2018-02-17 21:28:48 |
言語 | Scala(Beta) (3.4.0) |
結果 |
AC
|
実行時間 | 986 ms / 2,000 ms |
コード長 | 1,976 bytes |
コンパイル時間 | 10,179 ms |
コンパイル使用メモリ | 257,420 KB |
実行使用メモリ | 64,280 KB |
最終ジャッジ日時 | 2023-09-12 16:34:51 |
合計ジャッジ時間 | 45,068 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 970 ms
63,528 KB |
testcase_01 | AC | 971 ms
63,768 KB |
testcase_02 | AC | 969 ms
64,280 KB |
testcase_03 | AC | 980 ms
63,568 KB |
testcase_04 | AC | 980 ms
63,452 KB |
testcase_05 | AC | 986 ms
63,364 KB |
testcase_06 | AC | 967 ms
63,572 KB |
testcase_07 | AC | 967 ms
63,520 KB |
testcase_08 | AC | 965 ms
63,420 KB |
testcase_09 | AC | 970 ms
63,792 KB |
testcase_10 | AC | 971 ms
63,524 KB |
testcase_11 | AC | 985 ms
63,528 KB |
testcase_12 | AC | 963 ms
63,636 KB |
testcase_13 | AC | 977 ms
63,340 KB |
testcase_14 | AC | 966 ms
63,860 KB |
testcase_15 | AC | 972 ms
63,384 KB |
testcase_16 | AC | 968 ms
63,428 KB |
testcase_17 | AC | 964 ms
63,412 KB |
testcase_18 | AC | 969 ms
63,480 KB |
testcase_19 | AC | 968 ms
63,396 KB |
testcase_20 | AC | 979 ms
63,360 KB |
testcase_21 | AC | 972 ms
63,612 KB |
testcase_22 | AC | 978 ms
63,424 KB |
testcase_23 | AC | 980 ms
63,408 KB |
testcase_24 | AC | 965 ms
63,900 KB |
testcase_25 | AC | 979 ms
63,536 KB |
testcase_26 | AC | 966 ms
63,540 KB |
testcase_27 | AC | 973 ms
63,652 KB |
testcase_28 | AC | 967 ms
63,432 KB |
testcase_29 | AC | 976 ms
63,336 KB |
testcase_30 | AC | 984 ms
63,696 KB |
testcase_31 | AC | 968 ms
63,504 KB |
testcase_32 | AC | 966 ms
63,676 KB |
testcase_33 | AC | 981 ms
63,524 KB |
ソースコード
import java.util.Scanner import scala.collection.Searching._ import scala.annotation.tailrec import scala.collection.immutable.Queue import scala.collection.mutable import scala.io.StdIn.readLine class IUnionFind(val size: Int) { private case class Node(var parent: Option[Int], var treeSize: Int) private val nodes = Array.fill[Node](size)(new Node(None, 1)) def union(t1: Int, t2: Int): IUnionFind = { if (t1 == t2) return this val root1 = root(t1) val root2 = root(t2) if (root1 == root2) return this val node1 = nodes(root1) val node2 = nodes(root2) if (node1.treeSize < node2.treeSize) { node1.parent = Some(t2) node2.treeSize += node1.treeSize } else { node2.parent = Some(t1) node1.treeSize += node2.treeSize } this } def connected(t1: Int, t2: Int): Boolean = t1 == t2 || root(t1) == root(t2) @tailrec private def root(t: Int): Int = nodes(t).parent match { case None => t case Some(p) => root(p) } } object Main { def solve(sc: => Scanner): Unit = { val X, Y = sc.nextInt var que = mutable.Queue[(Int, Int)]() que += ((10, 10)) val P = Array.fill(20)(Array.fill(20)(-1)) P(10)(10) = 0 val Q = Array((2, 1), (1, 2), (2, -1), (-1, 2), (-2, 1), (1, -2), (-1, -2), (-2, -1)) while (que.size > 0) { val now = que.dequeue if (P(now._1)(now._2) < 3) ( for (diff <- Q) { val next = (now._1 + diff._1, now._2 + diff._2) if (P(next._1)(next._2) == -1) { P(next._1)(next._2) = P(now._1)(now._2) + 1 que += next } }) } println(if (0 <= X + 10 && X + 10 < 20 && 0 <= Y + 10 && Y + 10 < 20 && P(X + 10)(Y + 10) != -1) ("YES") else ("NO")) } def gcd(i: Int, j: Int): Int = { if (i < j) (gcd(j, i)) else (if (j == 0) (i) else (gcd(j, i % j))) } def main(args: Array[String]): Unit = { val sc: Scanner = new Scanner(System.in) solve(sc) } }