Submission #6413276


Source Code Expand

import sequtils, strutils, algorithm

type Bit = distinct seq[int]
proc newBit(n: int): Bit = Bit(newSeq[int](n+1))
proc `[]`(b: Bit, n: int): int = seq[int](b)[n]
proc `[]=`(b: var Bit, n,x: int) = seq[int](b)[n] = x
proc len(b: Bit): int = len(seq[int](b))
proc max(b: Bit, x: int): int =
  var x = x
  while x>0:
    result = max(result, b[x])
    x -= x and -x
proc update(b: var Bit, x,m: int) =
  var x = x
  while x<len(b):
    if b[x] >= m:
      break
    b[x] = m
    x += x and -x

var
  bit = newBit(100_000)
  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.max(h-1)+1)

echo bit.max(100_000)

Submission Info

Submission Time
Task D - プレゼント
User glia269
Language Nim (0.13.0)
Score 100
Code Size 930 Byte
Status AC
Exec Time 74 ms
Memory 5944 KB

Compile Error

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

Judge Result

Set Name Sample Subtask0 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 4
AC × 19
AC × 34
Set Name Test Cases
Sample sample0.txt, sample1.txt, sample2.txt, sample3.txt
Subtask0 subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, sample0.txt, sample1.txt, sample2.txt, sample3.txt
All sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
sample0.txt AC 1 ms 1024 KB
sample1.txt AC 1 ms 1024 KB
sample2.txt AC 1 ms 1024 KB
sample3.txt AC 1 ms 1024 KB
subtask0_0.txt AC 1 ms 1152 KB
subtask0_1.txt AC 1 ms 1024 KB
subtask0_10.txt AC 2 ms 1280 KB
subtask0_11.txt AC 2 ms 1280 KB
subtask0_12.txt AC 2 ms 1280 KB
subtask0_13.txt AC 2 ms 1280 KB
subtask0_14.txt AC 2 ms 1280 KB
subtask0_2.txt AC 1 ms 1024 KB
subtask0_3.txt AC 1 ms 1152 KB
subtask0_4.txt AC 2 ms 1152 KB
subtask0_5.txt AC 1 ms 1024 KB
subtask0_6.txt AC 2 ms 1280 KB
subtask0_7.txt AC 2 ms 1280 KB
subtask0_8.txt AC 2 ms 1152 KB
subtask0_9.txt AC 1 ms 1152 KB
subtask1_0.txt AC 45 ms 3584 KB
subtask1_1.txt AC 2 ms 1280 KB
subtask1_10.txt AC 57 ms 5944 KB
subtask1_11.txt AC 60 ms 5944 KB
subtask1_12.txt AC 74 ms 5944 KB
subtask1_13.txt AC 74 ms 5944 KB
subtask1_14.txt AC 74 ms 5944 KB
subtask1_2.txt AC 12 ms 1792 KB
subtask1_3.txt AC 63 ms 4992 KB
subtask1_4.txt AC 74 ms 5944 KB
subtask1_5.txt AC 11 ms 1792 KB
subtask1_6.txt AC 55 ms 4992 KB
subtask1_7.txt AC 30 ms 3584 KB
subtask1_8.txt AC 64 ms 5120 KB
subtask1_9.txt AC 33 ms 3584 KB