結果

問題 No.1043 直列大学
コンテスト
ユーザー dot_haraai
提出日時 2021-06-01 22:50:48
言語 Nim
(2.2.0)
結果
AC  
実行時間 273 ms / 2,000 ms
コード長 1,982 bytes
コンパイル時間 4,174 ms
コンパイル使用メモリ 88,628 KB
実行使用メモリ 163,048 KB
最終ジャッジ日時 2024-12-22 20:15:40
合計ジャッジ時間 9,866 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 28
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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():int=
  var
    md = 1000000007
    n = scan()
    m = scan()
    v = newseqwith(n,scan())
    r = newseqwith(m,scan())
    vsize = 100*1000#n*v.max()
    rsize = 100*1000#m*r.max()
    a = scan()
    b = scan()

    makev = newseqwith(n+1,newseqwith(vsize+1,0))
    maker = newseqwith(m+1,newseqwith(rsize+1,0))
    cumv = newseqwith(vsize+1,0)
    cumr = newseqwith(rsize+1,0)
  makev[0][0]=1
  maker[0][0]=1
  for i in 1..n:
    var idx = i-1
    for val in 0..vsize:
      if val-v[idx]>=0:
        makev[i][val] = makev[i-1][val] + makev[i-1][val-v[idx]]
      else:
        makev[i][val] = makev[i-1][val]
      makev[i][val].mod=md


  for i in 1..m:
    var idx = i-1
    for val in 0..rsize:
      if val-r[idx]>=0:
        maker[i][val] = maker[i-1][val] + maker[i-1][val-r[idx]]
      else:
        maker[i][val] = maker[i-1][val]
      maker[i][val].mod=md
  for val in 1..vsize:
    cumv[val]=cumv[val-1]+makev[n][val]
    cumv[val]=(cumv[val].mod(md)+md).mod(md)
  cumr[0]=1
  cumv[0]=1
  for val in 1..rsize:
    cumr[val]=cumr[val-1]+maker[m][val]
    cumr[val]=(cumr[val].mod(md)+md).mod(md)

  
  #echo cumr
  for idx in 1..vsize:# vの値で走査
    var
      right = idx.div(a)
      left = (idx+b-1).div(b)
    #echo idx,", ", right, ", ", left
    var t = cumr[min(right,rsize)]-cumr[max(0,min(rsize,left-1))]
    t = (t.mod(md)+md).mod(md)
    result+=makev[n][idx]*t
    result.mod=md




  


  

  
echo solve()
0