結果
問題 | No.771 しおり |
ユーザー | dot_haraai |
提出日時 | 2021-06-02 16:58:55 |
言語 | Nim (2.0.2) |
結果 |
AC
|
実行時間 | 465 ms / 2,000 ms |
コード長 | 1,212 bytes |
コンパイル時間 | 4,790 ms |
コンパイル使用メモリ | 86,976 KB |
実行使用メモリ | 50,964 KB |
最終ジャッジ日時 | 2024-07-22 07:28:34 |
合計ジャッジ時間 | 10,035 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 458 ms
49,884 KB |
testcase_01 | AC | 45 ms
7,680 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 1 ms
6,944 KB |
testcase_13 | AC | 1 ms
6,944 KB |
testcase_14 | AC | 2 ms
6,940 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 1 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,940 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 1 ms
6,944 KB |
testcase_22 | AC | 2 ms
6,944 KB |
testcase_23 | AC | 1 ms
6,940 KB |
testcase_24 | AC | 2 ms
6,944 KB |
testcase_25 | AC | 214 ms
24,432 KB |
testcase_26 | AC | 5 ms
6,944 KB |
testcase_27 | AC | 47 ms
7,680 KB |
testcase_28 | AC | 99 ms
13,696 KB |
testcase_29 | AC | 46 ms
7,680 KB |
testcase_30 | AC | 455 ms
49,164 KB |
testcase_31 | AC | 465 ms
49,996 KB |
testcase_32 | AC | 10 ms
6,940 KB |
testcase_33 | AC | 457 ms
49,188 KB |
testcase_34 | AC | 456 ms
50,964 KB |
testcase_35 | AC | 11 ms
6,940 KB |
testcase_36 | AC | 3 ms
6,944 KB |
testcase_37 | AC | 4 ms
6,944 KB |
testcase_38 | AC | 10 ms
6,940 KB |
testcase_39 | AC | 4 ms
6,940 KB |
testcase_40 | AC | 211 ms
24,408 KB |
testcase_41 | AC | 457 ms
49,668 KB |
testcase_42 | AC | 460 ms
50,348 KB |
testcase_43 | AC | 46 ms
7,680 KB |
testcase_44 | AC | 464 ms
49,124 KB |
testcase_45 | AC | 457 ms
49,384 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, 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 popCount(v:int):int= var x = v while x>0: result+=(x and 1) x = x shr 1 proc solve():int= var n = scan() ab = newseqwith(n,(scan(),scan())) dp = newseqwith(2^n,newseqwith(n,int.high.div(4))) for s in 1..<2^n: if s.popCount==1: for i in 0..<n: if (s and (1 shl i)) > 0: dp[s][i]=0 else: # iを追加したとき、jが最後に追加されていたときの最善値 for i in 0..<n: for j in 0..<n: if (s and (1 shl i)) > 0 and (s and (1 shl j)) > 0 and i!=j: dp[s][i].min=max(dp[s-(1 shl i)][j],ab[j][1]-ab[j][0]+ab[i][0]) return dp[2^n-1].min() echo solve()