結果

問題 No.989 N×Mマス計算（K以上）
ユーザー dot_haraai
提出日時 2021-03-31 20:15:09
言語 Nim
(2.2.0)
結果
AC  
実行時間 73 ms / 2,000 ms
コード長 999 bytes
コンパイル時間 4,652 ms
コンパイル使用メモリ 88,040 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-12-15 07:39:12
合計ジャッジ時間 5,385 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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
      result+=aidx
  else:
    for bidx in 0..<m:
      while aidx<n and a[aidx]+b[bidx]>=k:
        aidx+=1
      result+=aidx
      
      

  
echo solve()
0