結果

問題 No.1043 直列大学
ユーザー dot_haraaidot_haraai
提出日時 2021-06-01 22:50:48
言語 Nim
(2.0.2)
結果
AC  
実行時間 350 ms / 2,000 ms
コード長 1,982 bytes
コンパイル時間 4,752 ms
コンパイル使用メモリ 74,756 KB
実行使用メモリ 165,608 KB
最終ジャッジ日時 2023-08-24 12:57:47
合計ジャッジ時間 11,919 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 18 ms
9,520 KB
testcase_01 AC 14 ms
7,960 KB
testcase_02 AC 30 ms
14,256 KB
testcase_03 AC 14 ms
7,932 KB
testcase_04 AC 14 ms
7,876 KB
testcase_05 AC 15 ms
7,812 KB
testcase_06 AC 14 ms
7,880 KB
testcase_07 AC 22 ms
11,008 KB
testcase_08 AC 22 ms
11,000 KB
testcase_09 AC 188 ms
85,500 KB
testcase_10 AC 219 ms
101,316 KB
testcase_11 AC 324 ms
150,532 KB
testcase_12 AC 350 ms
165,608 KB
testcase_13 AC 295 ms
137,196 KB
testcase_14 AC 313 ms
146,368 KB
testcase_15 AC 336 ms
159,296 KB
testcase_16 AC 306 ms
142,080 KB
testcase_17 AC 228 ms
105,380 KB
testcase_18 AC 226 ms
105,416 KB
testcase_19 AC 286 ms
134,136 KB
testcase_20 AC 220 ms
103,468 KB
testcase_21 AC 268 ms
124,104 KB
testcase_22 AC 278 ms
130,000 KB
testcase_23 AC 347 ms
163,460 KB
testcase_24 AC 249 ms
116,376 KB
testcase_25 AC 291 ms
136,388 KB
testcase_26 AC 312 ms
146,276 KB
testcase_27 AC 160 ms
73,768 KB
testcase_28 AC 287 ms
134,096 KB
testcase_29 AC 102 ms
47,456 KB
testcase_30 AC 220 ms
102,120 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]

ソースコード

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