結果
問題 | No.355 数当てゲーム(2) |
ユーザー | dot_haraai |
提出日時 | 2021-05-29 14:24:52 |
言語 | Nim (2.0.2) |
結果 |
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 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 25 ms
24,592 KB |
testcase_01 | AC | 23 ms
24,976 KB |
testcase_02 | AC | 24 ms
25,232 KB |
testcase_03 | AC | 24 ms
24,592 KB |
testcase_04 | AC | 25 ms
25,232 KB |
testcase_05 | AC | 23 ms
25,232 KB |
testcase_06 | AC | 25 ms
24,848 KB |
testcase_07 | AC | 24 ms
24,976 KB |
testcase_08 | AC | 23 ms
25,232 KB |
testcase_09 | AC | 25 ms
24,592 KB |
testcase_10 | AC | 24 ms
24,592 KB |
testcase_11 | AC | 23 ms
24,976 KB |
testcase_12 | AC | 24 ms
24,976 KB |
testcase_13 | AC | 24 ms
24,592 KB |
testcase_14 | AC | 23 ms
24,848 KB |
testcase_15 | AC | 25 ms
24,848 KB |
testcase_16 | AC | 24 ms
24,604 KB |
testcase_17 | AC | 24 ms
24,592 KB |
testcase_18 | AC | 23 ms
25,232 KB |
testcase_19 | AC | 24 ms
24,592 KB |
testcase_20 | AC | 26 ms
24,952 KB |
testcase_21 | AC | 23 ms
24,568 KB |
testcase_22 | AC | 24 ms
25,464 KB |
testcase_23 | AC | 23 ms
24,568 KB |
testcase_24 | AC | 25 ms
25,208 KB |
testcase_25 | AC | 24 ms
24,824 KB |
testcase_26 | AC | 23 ms
25,208 KB |
testcase_27 | AC | 23 ms
24,824 KB |
testcase_28 | AC | 25 ms
25,208 KB |
testcase_29 | AC | 23 ms
24,568 KB |
testcase_30 | AC | 24 ms
24,940 KB |
testcase_31 | AC | 24 ms
24,796 KB |
testcase_32 | AC | 25 ms
24,952 KB |
testcase_33 | AC | 24 ms
24,824 KB |
testcase_34 | AC | 23 ms
25,208 KB |
testcase_35 | AC | 24 ms
24,812 KB |
testcase_36 | AC | 24 ms
24,556 KB |
testcase_37 | AC | 25 ms
24,940 KB |
testcase_38 | AC | 24 ms
24,556 KB |
testcase_39 | AC | 23 ms
24,940 KB |
testcase_40 | AC | 23 ms
25,196 KB |
testcase_41 | AC | 23 ms
24,812 KB |
testcase_42 | AC | 24 ms
24,556 KB |
testcase_43 | AC | 24 ms
24,940 KB |
testcase_44 | AC | 24 ms
24,544 KB |
testcase_45 | AC | 24 ms
24,428 KB |
testcase_46 | AC | 23 ms
25,460 KB |
testcase_47 | AC | 23 ms
25,196 KB |
testcase_48 | AC | 24 ms
24,940 KB |
testcase_49 | AC | 23 ms
24,940 KB |
testcase_50 | AC | 23 ms
24,940 KB |
testcase_51 | AC | 24 ms
24,556 KB |
コンパイルメッセージ
/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, intsets import critbits, future, strformat, deques,heapqueue 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 getAns(v:seq[int])= var t = v a0:int a1:int t.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 t proc solve()= var lower = [0,1,2,3,4] upper = [5,6,7,8,9] lowerMax = 0 lowerMaxSeq:seq[int] upperMax = 0 upperMaxSeq:seq[int] a0:int a1:int for i in 0..4: var t = lower[0..<i] & lower[i+1..<5] echo t.join(" ") (a0,a1) = (scan(),scan()) if a0 == 4: return if a0+a1 > lowerMax: lowerMax = a0+a1 lowerMaxSeq = t for i in 0..4: var t = upper[0..<i] & upper[i+1..<5] echo t.join(" ") (a0,a1) = (scan(),scan()) if a0 == 4: return if a0+a1 > upperMax: upperMax = a0+a1 upperMaxSeq = t if (lowerMax,upperMax) == (4,0): lowerMaxSeq.getAns elif (lowerMax,upperMax) == (0,4): upperMaxSeq.getAns elif (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: return if a0+a1 == 4: getAns(t) return elif (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: return if a0+a1 == 4: getAns(t) return elif (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: return if a0+a1 == 4: getAns(t) return solve()