結果
問題 | No.648 お や す み |
ユーザー | Goryudyuma |
提出日時 | 2018-02-09 22:39:29 |
言語 | Scala(Beta) (3.4.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,640 bytes |
コンパイル時間 | 11,008 ms |
コンパイル使用メモリ | 253,340 KB |
実行使用メモリ | 63,832 KB |
最終ジャッジ日時 | 2023-09-12 16:23:02 |
合計ジャッジ時間 | 89,866 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 923 ms
62,348 KB |
testcase_01 | AC | 927 ms
62,480 KB |
testcase_02 | AC | 921 ms
62,488 KB |
testcase_03 | AC | 926 ms
62,484 KB |
testcase_04 | AC | 927 ms
62,664 KB |
testcase_05 | AC | 914 ms
62,720 KB |
testcase_06 | AC | 933 ms
62,540 KB |
testcase_07 | AC | 927 ms
62,716 KB |
testcase_08 | AC | 1,046 ms
62,572 KB |
testcase_09 | AC | 928 ms
62,632 KB |
testcase_10 | AC | 931 ms
62,464 KB |
testcase_11 | AC | 920 ms
62,948 KB |
testcase_12 | AC | 927 ms
62,536 KB |
testcase_13 | AC | 931 ms
62,648 KB |
testcase_14 | AC | 920 ms
62,480 KB |
testcase_15 | AC | 927 ms
62,536 KB |
testcase_16 | AC | 928 ms
62,548 KB |
testcase_17 | AC | 929 ms
62,592 KB |
testcase_18 | AC | 927 ms
62,608 KB |
testcase_19 | AC | 919 ms
62,476 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 922 ms
62,564 KB |
testcase_31 | AC | 927 ms
62,580 KB |
testcase_32 | AC | 937 ms
62,644 KB |
testcase_33 | AC | 924 ms
62,544 KB |
testcase_34 | AC | 928 ms
62,536 KB |
testcase_35 | AC | 933 ms
62,548 KB |
testcase_36 | AC | 924 ms
62,556 KB |
testcase_37 | AC | 927 ms
62,720 KB |
testcase_38 | AC | 921 ms
62,676 KB |
testcase_39 | AC | 931 ms
62,324 KB |
testcase_40 | AC | 935 ms
62,644 KB |
testcase_41 | AC | 933 ms
62,776 KB |
testcase_42 | AC | 933 ms
62,580 KB |
testcase_43 | AC | 925 ms
62,468 KB |
testcase_44 | AC | 927 ms
62,524 KB |
testcase_45 | AC | 927 ms
62,788 KB |
testcase_46 | AC | 932 ms
62,856 KB |
testcase_47 | AC | 931 ms
62,900 KB |
testcase_48 | AC | 969 ms
62,704 KB |
testcase_49 | AC | 927 ms
62,496 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 | 919 ms
62,688 KB |
testcase_61 | AC | 924 ms
62,608 KB |
testcase_62 | AC | 932 ms
62,548 KB |
testcase_63 | AC | 923 ms
62,512 KB |
testcase_64 | AC | 924 ms
62,600 KB |
testcase_65 | AC | 923 ms
62,960 KB |
testcase_66 | AC | 916 ms
62,832 KB |
testcase_67 | AC | 922 ms
62,496 KB |
testcase_68 | AC | 926 ms
62,576 KB |
testcase_69 | AC | 932 ms
62,616 KB |
testcase_70 | AC | 919 ms
62,560 KB |
testcase_71 | AC | 932 ms
62,604 KB |
testcase_72 | AC | 930 ms
62,604 KB |
testcase_73 | AC | 939 ms
63,008 KB |
testcase_74 | AC | 929 ms
62,312 KB |
testcase_75 | AC | 923 ms
62,756 KB |
testcase_76 | AC | 918 ms
62,460 KB |
testcase_77 | WA | - |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | WA | - |
testcase_83 | WA | - |
ソースコード
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 = { val N = sc.nextLong var minV = 0L var maxV = (math.sqrt(N) + 10).toLong while (minV + 1L < maxV) { val midV = ((minV + maxV) / 2L): Long if (midV * (midV + 1) > N * 2) { maxV = midV } else { minV = midV } } if (((minV * (minV + 1))) == N * 2) { 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) } }