結果
問題 | No.1944 ∞ |
ユーザー | ripity |
提出日時 | 2022-05-20 21:38:28 |
言語 | Kotlin (1.9.23) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,019 bytes |
コンパイル時間 | 18,230 ms |
コンパイル使用メモリ | 461,708 KB |
実行使用メモリ | 63,384 KB |
最終ジャッジ日時 | 2023-10-20 12:02:40 |
合計ジャッジ時間 | 33,161 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 328 ms
55,400 KB |
testcase_01 | AC | 323 ms
55,404 KB |
testcase_02 | AC | 324 ms
55,396 KB |
testcase_03 | AC | 301 ms
51,928 KB |
testcase_04 | AC | 308 ms
51,920 KB |
testcase_05 | AC | 305 ms
51,920 KB |
testcase_06 | AC | 308 ms
51,920 KB |
testcase_07 | AC | 299 ms
51,920 KB |
testcase_08 | AC | 302 ms
51,928 KB |
testcase_09 | AC | 305 ms
51,912 KB |
testcase_10 | AC | 311 ms
51,920 KB |
testcase_11 | AC | 319 ms
55,388 KB |
testcase_12 | AC | 328 ms
55,408 KB |
testcase_13 | AC | 325 ms
55,408 KB |
testcase_14 | AC | 328 ms
55,408 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 398 ms
58,012 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 399 ms
58,688 KB |
testcase_21 | WA | - |
testcase_22 | AC | 392 ms
58,044 KB |
testcase_23 | AC | 330 ms
55,448 KB |
testcase_24 | AC | 351 ms
57,524 KB |
testcase_25 | AC | 409 ms
58,816 KB |
testcase_26 | AC | 406 ms
58,740 KB |
testcase_27 | AC | 399 ms
58,052 KB |
testcase_28 | AC | 406 ms
58,032 KB |
testcase_29 | AC | 336 ms
55,468 KB |
testcase_30 | AC | 406 ms
58,032 KB |
testcase_31 | AC | 407 ms
58,012 KB |
testcase_32 | AC | 411 ms
58,024 KB |
testcase_33 | AC | 478 ms
61,112 KB |
testcase_34 | AC | 468 ms
61,092 KB |
testcase_35 | AC | 468 ms
61,100 KB |
ソースコード
import java.io.* import java.util.* import kotlin.math.* fun main() { // val T = nextInt() // repeat(T) {solve()} // pw.flush() solve() pw.flush() } fun solve() { val N = nextInt() val x = nextDouble() val y = nextDouble() val d = hypot(x, y) val r0 = nextDouble() val r = nextIntarr(N-1) if( N == 1 ) { if( r0*r0 == x*x + y*y ) pw.println("Yes") else pw.println("No") return } if( (r0+2*r.sum()).toDouble() >= d ) pw.println("Yes") else pw.println("No") } fun printArray(a: Array<Long>) { a.forEach{ print("$it ") } println() } /* struct begin */ data class Pii(val fi: Int, val se: Int) data class Edge(val from: Int, val to: Int, val w: Long) class BinaryIndexedTree(n: Int) { val N = n var a = Array<Long>(N+1) {0L} fun sum(i: Int): Long { var idx = i+1 var res = 0L while( idx > 0 ) { res += a[idx] idx -= idx and (-idx) } return res } fun add(i: Int, x: Long) { var idx = i+1 while( idx <= N ) { a[idx] += x idx += idx and (-idx) } } } class UnionFind(N: Int) { var parent = Array<Int>(N) {it} var rank = Array<Int>(N) {1} var size = Array<Int>(N) {1} fun root(x: Int): Int { if( parent[x] == x ) { return x }else { parent[x] = root(parent[x]) return parent[x] } } fun unite(x: Int, y: Int) { val rx = root(x) val ry = root(y) if( rx == ry ) return if( rank[rx] > rank[ry] ) { parent[ry] = rx size[rx] += size[ry] }else { parent[rx] = ry size[ry] += size[rx] if( rank[rx] == rank[ry] ) rank[ry]++ } } fun same(x: Int, y: Int): Boolean = (root(x) == root(y)) fun getSize(x: Int): Int = size[root(x)] } /* struct end */ /* math begin */ fun intceil(x: Double) = ceil(x).toInt() fun intfloor(x: Double) = floor(x).toInt() fun gcd(x: Int, y: Int): Int { var a = max(x, y) var b = min(x, y) var r: Int do { r = a%b a = b b = r }while( r > 0 ) return a } /* math end */ /* I/O begin */ var st = StringTokenizer("") val br = System.`in`.bufferedReader() val pw = PrintWriter(System.out, false) fun nextInt() = next().toInt() fun nextLong() = next().toLong() fun nextLine() = br.readLine()!! fun nextDouble() = next().toDouble() fun nextIntarr(n: Int) = Array<Int>(n) {nextInt()} fun nextStrarr(n: Int) = Array<String>(n) {next()} fun nextLongarr(n: Int) = Array<Long>(n) {nextLong()} fun next(): String { if( !st.hasMoreTokens() ) st = StringTokenizer(br.readLine()!!) return st.nextToken() } /* I/O end */