結果

問題 No.1536 仕切り直し
ユーザー dot_haraaidot_haraai
提出日時 2021-06-07 21:31:54
言語 Nim
(2.0.2)
結果
RE  
実行時間 -
コード長 1,845 bytes
コンパイル時間 4,208 ms
コンパイル使用メモリ 87,680 KB
実行使用メモリ 31,872 KB
最終ジャッジ日時 2024-05-04 00:51:27
合計ジャッジ時間 5,667 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 6 ms
5,376 KB
testcase_04 AC 30 ms
14,336 KB
testcase_05 RE -
testcase_06 AC 3 ms
5,376 KB
testcase_07 AC 4 ms
5,376 KB
testcase_08 AC 23 ms
11,264 KB
testcase_09 AC 32 ms
13,952 KB
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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]

ソースコード

diff #

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 solve()=
  var
    n = scan()
    m = scan()
    a = @[0] & newseqwith(n,scan())
    dp = newseqwith(m+1,newseqwith(n+1,0))
    frm = newseqwith(m+1,newseqwith(n+1,false))
  
  for i in 1..n:
    dp[0][i] = dp[0][i-1]+a[i]
  for shikiri in 1..m:
    for i in 1..n:
      # shikiriが偶数:iより前に偶数枚の仕切りが入っているので、a[i]は加算する
      # shikiriが奇数:iより前に偶数枚の仕切りが入っているので、a[i]は減算する
      if shikiri.mod(2)==0:
        if dp[shikiri-1][i-1]+a[i] > dp[shikiri][i-1]+a[i]:
          frm[shikiri][i]=true
        dp[shikiri][i] = max(dp[shikiri-1][i-1],dp[shikiri][i-1])+a[i]
      else:
        if dp[shikiri-1][i-1]-a[i] > dp[shikiri][i-1]-a[i]:
          frm[shikiri][i]=true
        dp[shikiri][i] = max(dp[shikiri-1][i-1],dp[shikiri][i-1])-a[i]
  #echo dp.join("\n")

  var
    maxIdx = -1
    maxV = -int.high.div(4)
  #echo dp.join("\n")
  #echo frm.join("\n")
  for i in 0..m:
    if dp[i][^1]>maxV:
      maxV = dp[i][^1]
      maxIdx = i
  var
    y = maxIdx
    x = n
    ans = newseq[int]()
  while (y,x) != (0,0):
    if frm[y][x]:
      ans.add(x-1)
      y = y-1
      x = x-1
    else:
      x = x-1
  for i in 0..<m:
    if ans.len>i:
      echo ans[i]
    else:
      echo n
  
  
  
  
solve()

0