結果
問題 | No.355 数当てゲーム(2) |
ユーザー |
|
提出日時 | 2021-05-29 14:24:52 |
言語 | Nim (2.2.0) |
結果 |
AC
|
実行時間 | 26 ms / 2,000 ms |
コード長 | 2,573 bytes |
コンパイル時間 | 5,233 ms |
コンパイル使用メモリ | 87,792 KB |
実行使用メモリ | 25,464 KB |
平均クエリ数 | 32.46 |
最終ジャッジ日時 | 2024-07-17 03:04:16 |
合計ジャッジ時間 | 9,345 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 52 |
コンパイルメッセージ
/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, 37) Warning: imported and not used: 'deques' [UnusedImport] /home/judge/data/code/Main.nim(1, 25) Warning: imported and not used: 'sequtils' [UnusedImport] /home/judge/data/code/Main.nim(2, 44) Warning: imported and not used: 'heapqueue' [UnusedImport] /home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [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] /home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
ソースコード
import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsetsimport critbits, future, strformat, deques,heapqueuetemplate `max=`(x,y) = x = max(x,y)template `min=`(x,y) = x = min(x,y)template `mod=`(x,y) = x = x mod ytemplate 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().parseIntproc scanf(): float = read().parseFloatproc toInt(c:char): int =return int(c) - int('0')proc getAns(v:seq[int])=vart = va0:inta1:intt.sort()echo t.join(" ")(a0,a1) = (scan(),scan())if a0 == 4:quit()while t.nextPermutation:echo t.join(" ")(a0,a1) = (scan(),scan())if a0 == 4:quit()#return tproc solve()=varlower = [0,1,2,3,4]upper = [5,6,7,8,9]lowerMax = 0lowerMaxSeq:seq[int]upperMax = 0upperMaxSeq:seq[int]a0:inta1:intfor i in 0..4:var t = lower[0..<i] & lower[i+1..<5]echo t.join(" ")(a0,a1) = (scan(),scan())if a0 == 4:returnif a0+a1 > lowerMax:lowerMax = a0+a1lowerMaxSeq = tfor i in 0..4:var t = upper[0..<i] & upper[i+1..<5]echo t.join(" ")(a0,a1) = (scan(),scan())if a0 == 4:returnif a0+a1 > upperMax:upperMax = a0+a1upperMaxSeq = tif (lowerMax,upperMax) == (4,0):lowerMaxSeq.getAnselif (lowerMax,upperMax) == (0,4):upperMaxSeq.getAnselif (lowerMax,upperMax) == (3,1):for i in 0..<4:for j in 0..<4:var t = lowerMaxSeq[0..<i] & lowerMaxSeq[i+1..<4] & @[upperMaxSeq[j]]echo t.join(" ")(a0,a1)=(scan(),scan())if a0 == 4:returnif a0+a1 == 4:getAns(t)returnelif (lowerMax,upperMax) == (1,3):for i in 0..<4:for j in 0..<4:var t = upperMaxSeq[0..<i] & upperMaxSeq[i+1..<4] & @[lowerMaxSeq[j]]echo t.join(" ")(a0,a1)=(scan(),scan())if a0 == 4:returnif a0+a1 == 4:getAns(t)returnelif (lowerMax,upperMax) == (2,2):for i in 0..<3:for j in i+1..<4:for k in 0..<3:for l in k+1..<4:var t = @[lowerMaxSeq[i],lowerMaxSeq[j],upperMaxSeq[k],upperMaxSeq[l]]echo t.join(" ")(a0,a1)=(scan(),scan())if a0 == 4:returnif a0+a1 == 4:getAns(t)returnsolve()