結果

問題 No.1280 Beyond C
ユーザー dot_haraai
提出日時 2021-03-21 11:10:04
言語 Nim
(2.2.0)
結果
AC  
実行時間 98 ms / 2,000 ms
コード長 874 bytes
コンパイル時間 4,059 ms
コンパイル使用メモリ 86,272 KB
実行使用メモリ 9,344 KB
最終ジャッジ日時 2024-11-22 02:11:56
合計ジャッジ時間 6,215 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 23
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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():float=
  var
    (n,m,c)=(scan(),scan(),scan())
    a = newseqwith(n,scan()).sorted(SortOrder.Ascending)
    b = newseqwith(m,scan()).sorted(SortOrder.Descending)
    ia=0
    ib=0
    cnt = 0
  while ia<n:
    while ib<m and a[ia]*b[ib]>c:
      ib+=1
    cnt+=ib
    ia+=1
  return cnt.float/(n*m).float


  
  

  
echo solve()
0