結果

問題 No.989 N×Mマス計算(K以上)
ユーザー dot_haraaidot_haraai
提出日時 2021-03-31 19:56:08
言語 Nim
(2.0.2)
結果
WA  
実行時間 -
コード長 1,094 bytes
コンパイル時間 5,077 ms
コンパイル使用メモリ 86,440 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-05-08 23:16:22
合計ジャッジ時間 6,747 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 WA -
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 2 ms
6,944 KB
testcase_10 AC 52 ms
6,940 KB
testcase_11 AC 43 ms
6,940 KB
testcase_12 AC 58 ms
6,944 KB
testcase_13 AC 27 ms
6,940 KB
testcase_14 AC 81 ms
6,944 KB
testcase_15 AC 23 ms
6,940 KB
testcase_16 AC 44 ms
6,944 KB
testcase_17 AC 26 ms
6,940 KB
testcase_18 AC 36 ms
6,944 KB
testcase_19 AC 45 ms
6,944 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(2, 8) Warning: imported and not used: 'critbits' [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]

ソースコード

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
    n = scan()
    m = scan()
    k = scan()
    op = read()
    b = newseqwith(m,scan()).sorted(SortOrder.Ascending)
    a = newseqwith(n,scan()).sorted(SortOrder.Descending)
    aidx=0
  if op=="*":
    for bidx in 0..<m:
      while aidx<n and a[aidx]*b[bidx]>=k:
        aidx+=1
      aidx = max(0,aidx-1)
      if aidx>=0:
        result+=aidx+1
  else:
    for bidx in 0..<m:
      while aidx<n and a[aidx]+b[bidx]>=k:
        aidx+=1
      aidx = max(0,aidx-1)
      if aidx>=0:
        result+=aidx+1
      
      

  
echo solve()
0