Submission #6413852

---

Source Code Expand

type BIT[T] = object
  data:seq[T]
  e:T
  f:proc (x,y:T):T
proc newBIT[T](n:int, e:T, f:proc(x,y:T):T):BIT[T] =
  BIT[T](data:newSeq[T](n+1), e:e, f:f)
proc `[]`[T](b:BIT[T], x:int):T = b.data[x]
proc `[]=`[T](b:var BIT[T], x:int, v:T) = b.data[x] = v
proc len[T](b:BIT[T]):int = len(b.data)
proc query[T](b:BIT[T], x:int):T =
  var x = x
  result = b.e
  while x>0:
    result = b.f(result, b[x])
    x -= x and -x
proc update[T](b:var BIT[T], x:int, m:T) =
  var x = x
  while x<len(b):
    b[x] = b.f(b[x], m)
    x += x and -x

##########

import sequtils, strutils, algorithm

proc abc038D() =
  var
    bit = newBit[int](100_000, 0, proc(x,y:int):int = max(x,y))
    whs = newSeq[(int, int)]()
  let n = stdin.readline.parseInt

  for _ in 1..n:
    let wh = stdin.readline.split.map(parseInt)
    whs.add((wh[0], wh[1]))
  whs.sort do(x,y:(int, int)) -> int:
    if x[0] == y[0]:  system.cmp[int](y[1], x[1])
    else:             system.cmp[int](x[0], y[0])

  for i,wh in whs:
    let (w, h) = wh
    bit.update(h, bit.query(h-1)+1)

  echo bit.query(100_000)

if isMainModule:
  abc038D()

Submission Info

Compile Error

Hint: system [Processing]
Hint: Main [Processing]
Hint: sequtils [Processing]
Hint: strutils [Processing]
Hint: parseutils [Processing]
Hint: algorithm [Processing]
Main.nim(40, 10) Hint: 'w' is declared but not used [XDeclaredButNotUsed]
Hint:  [Link]
Hint: operation successful (13345 lines compiled; 1.935 sec total; 14.148MB; Release Build) [SuccessX]

Judge Result