結果
問題 | No.648 お や す み |
ユーザー | Goryudyuma |
提出日時 | 2018-02-09 22:29:18 |
言語 | Scala(Beta) (3.4.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,616 bytes |
コンパイル時間 | 8,934 ms |
コンパイル使用メモリ | 251,112 KB |
実行使用メモリ | 63,904 KB |
最終ジャッジ日時 | 2023-09-12 16:14:56 |
合計ジャッジ時間 | 93,824 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 956 ms
62,536 KB |
testcase_02 | AC | 963 ms
63,112 KB |
testcase_03 | AC | 957 ms
62,504 KB |
testcase_04 | AC | 964 ms
62,508 KB |
testcase_05 | AC | 974 ms
62,544 KB |
testcase_06 | AC | 963 ms
62,712 KB |
testcase_07 | AC | 954 ms
62,524 KB |
testcase_08 | AC | 966 ms
62,672 KB |
testcase_09 | AC | 973 ms
62,560 KB |
testcase_10 | AC | 967 ms
62,820 KB |
testcase_11 | AC | 943 ms
62,508 KB |
testcase_12 | AC | 945 ms
62,692 KB |
testcase_13 | AC | 952 ms
62,712 KB |
testcase_14 | AC | 968 ms
62,764 KB |
testcase_15 | AC | 964 ms
62,516 KB |
testcase_16 | AC | 957 ms
62,816 KB |
testcase_17 | AC | 963 ms
62,800 KB |
testcase_18 | AC | 977 ms
62,988 KB |
testcase_19 | AC | 974 ms
62,712 KB |
testcase_20 | AC | 945 ms
62,756 KB |
testcase_21 | AC | 958 ms
62,576 KB |
testcase_22 | AC | 973 ms
62,596 KB |
testcase_23 | AC | 972 ms
62,572 KB |
testcase_24 | AC | 949 ms
62,752 KB |
testcase_25 | AC | 952 ms
62,620 KB |
testcase_26 | AC | 964 ms
62,892 KB |
testcase_27 | AC | 979 ms
62,568 KB |
testcase_28 | AC | 955 ms
62,792 KB |
testcase_29 | AC | 957 ms
62,548 KB |
testcase_30 | AC | 960 ms
62,816 KB |
testcase_31 | AC | 960 ms
62,544 KB |
testcase_32 | AC | 928 ms
63,568 KB |
testcase_33 | AC | 942 ms
62,552 KB |
testcase_34 | AC | 945 ms
62,744 KB |
testcase_35 | AC | 932 ms
62,776 KB |
testcase_36 | AC | 926 ms
62,572 KB |
testcase_37 | AC | 940 ms
62,532 KB |
testcase_38 | AC | 929 ms
62,492 KB |
testcase_39 | AC | 931 ms
62,620 KB |
testcase_40 | AC | 937 ms
62,500 KB |
testcase_41 | AC | 968 ms
62,728 KB |
testcase_42 | AC | 942 ms
62,592 KB |
testcase_43 | AC | 950 ms
62,520 KB |
testcase_44 | AC | 959 ms
62,584 KB |
testcase_45 | AC | 948 ms
62,544 KB |
testcase_46 | AC | 954 ms
62,548 KB |
testcase_47 | AC | 957 ms
62,612 KB |
testcase_48 | AC | 950 ms
62,540 KB |
testcase_49 | AC | 957 ms
62,424 KB |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | AC | 932 ms
62,936 KB |
testcase_61 | AC | 935 ms
62,540 KB |
testcase_62 | AC | 933 ms
62,992 KB |
testcase_63 | AC | 945 ms
62,760 KB |
testcase_64 | AC | 950 ms
62,572 KB |
testcase_65 | AC | 925 ms
62,536 KB |
testcase_66 | AC | 925 ms
62,580 KB |
testcase_67 | AC | 928 ms
62,668 KB |
testcase_68 | AC | 936 ms
62,448 KB |
testcase_69 | AC | 950 ms
62,664 KB |
testcase_70 | AC | 952 ms
62,512 KB |
testcase_71 | AC | 937 ms
63,052 KB |
testcase_72 | AC | 954 ms
62,600 KB |
testcase_73 | AC | 959 ms
62,492 KB |
testcase_74 | AC | 959 ms
62,732 KB |
testcase_75 | AC | 955 ms
62,656 KB |
testcase_76 | AC | 955 ms
63,264 KB |
testcase_77 | WA | - |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | AC | 964 ms
62,548 KB |
testcase_83 | AC | 961 ms
62,548 KB |
ソースコード
import java.util.Scanner import scala.collection.Searching._ import scala.annotation.tailrec import scala.collection.immutable.Queue 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 = { var N = sc.nextLong var minV = 0L var maxV = N while (minV + 1L < maxV) { val midV = ((minV + maxV) / 2L): Long if (midV * (midV + 1) / 2 > N) { maxV = midV } else { minV = midV } } if (((minV * (minV + 1)) / 2L) == N) { println("YES") println(minV) } else { println("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) } }