結果
| 問題 |
No.761 平均値ゲーム
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2021-06-19 18:21:25 |
| 言語 | Nim (2.2.0) |
| 結果 |
AC
|
| 実行時間 | 102 ms / 2,000 ms |
| コード長 | 1,017 bytes |
| コンパイル時間 | 3,056 ms |
| コンパイル使用メモリ | 86,528 KB |
| 実行使用メモリ | 16,640 KB |
| 最終ジャッジ日時 | 2024-06-22 22:14:39 |
| 合計ジャッジ時間 | 9,797 ms |
|
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 100 |
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated] /home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport] /home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport] /home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport] /home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport] /home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport] /home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport] /home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport] /home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport] /home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport] /home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]
ソースコード
import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
return int(c) - int('0')
proc dfs(a:seq[int]):bool=
if a.len==0:
return false
var n = a.len
var mean = (a.sum()+n-1).div(n)
result = false
if a.filterIt(it<mean).len!=a.len and not dfs(a.filterIt(it<mean)):
result = true
if a.filterIt(it>=mean).len!=a.len and not dfs(a.filterIt(it>=mean)):
result = true
#echo a, ", ",mean, ", ", result
return
proc solve()=
var
n = scan()
a = newseqwith(n,scan())
if dfs(a):
echo "First"
else:
echo "Second"
solve()