結果

問題 No.110 しましまピラミッド
コンテスト
ユーザー dot_haraai
提出日時 2021-03-16 20:09:02
言語 Nim
(2.2.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 1,613 bytes
コンパイル時間 5,243 ms
コンパイル使用メモリ 86,400 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-08 09:44:38
合計ジャッジ時間 6,431 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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
    nw = scan()
    w = newseqwith(nw,scan()).sorted(SortOrder.Descending)
    nb = scan()
    b = newseqwith(nb,scan()).sorted(SortOrder.Descending)
    idxw=0
    idxb=0
    bottom = 0
    bottomc = 0
    res = 1
  #echo w
  #echo b
  
  bottom = w[0]
  bottomc = 0
  while true:
    if bottomc==0:# bottom==white
      while idxb<nb and b[idxb]>=w[idxw]:
        idxb+=1
      if idxb==nb:
        break
      else:
        bottomc = 1
        res+=1
    else:
      while idxw<nw and w[idxw]>=b[idxb]:
        idxw+=1
      if idxw==nw:
        break
      else:
        bottomc = 0
        res+=1
  result=res
  bottom = b[0]
  bottomc = 1
  idxw=0
  idxb=0
  res=1

  while true:
    if bottomc==0:# bottom==white
      while idxb<nb and b[idxb]>=w[idxw]:
        idxb+=1
      if idxb==nb:
        break
      else:
        bottomc = 1
        res+=1
    else:
      while idxw<nw and w[idxw]>=b[idxb]:
        idxw+=1
      if idxw==nw:
        break
      else:
        bottomc = 0
        res+=1
  result.max=res

  


  
  
  
  

  
echo solve()
0