結果

問題 No.1137 Circles
ユーザー dot_haraai
提出日時 2021-03-25 21:53:26
言語 Nim
(2.2.0)
結果
AC  
実行時間 60 ms / 2,000 ms
コード長 868 bytes
コンパイル時間 3,954 ms
コンパイル使用メモリ 86,272 KB
実行使用メモリ 10,752 KB
最終ジャッジ日時 2024-11-27 07:13:30
合計ジャッジ時間 4,913 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 22
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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')


const 
  le = -4*(10^5)
  re = 4*(10^5)

proc solve():int=
  var
    n = scan()
    x = newseqwith(n,0)
    r = newseqwith(n,0)
    
    cum:array[le..re,int]

  for i in 0..<n:
    var (x,r)=(2*scan(),2*scan())
    cum[x-r+1]+=1
    cum[x+r]-=1
  for i in le+1..re:
    cum[i]+=cum[i-1]
    result.max=cum[i]
  
  



  

  
echo solve()
0