結果

問題 No.709 優勝可能性
ユーザー dot_haraai
提出日時 2021-06-04 16:13:00
言語 Nim
(2.2.0)
結果
AC  
実行時間 393 ms / 3,500 ms
コード長 1,196 bytes
コンパイル時間 5,764 ms
コンパイル使用メモリ 87,900 KB
実行使用メモリ 66,048 KB
最終ジャッジ日時 2024-11-19 01:49:31
合計ジャッジ時間 9,280 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
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(2, 8) Warning: imported and not used: 'critbits' [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()=
  var
    n = scan()
    m = scan()
    r = newseqwith(n,newseqwith(m,scan()))
    maxParam = newseqwith(m,0)
    maxParamPlayer = newseqwith(m,initHashSet[int]())
    isMax = newseqwith(n,0)
    ninzuu:int
  for k in 0..<n:
    for p in 0..<m:
      if maxparam[p] < r[k][p]:
        for player in maxParamPlayer[p]:
          isMax[player]-=(1 shl p)
          if isMax[player] == 0:
            ninzuu-=1
        maxparam[p] = r[k][p]
        maxParamPlayer[p].clear()
      if maxparam[p] == r[k][p]:
        maxParamPlayer[p].incl(k)
        if isMax[k] == 0:
          ninzuu+=1
        isMax[k] += 1 shl p
    
    echo ninzuu


  

  
solve()
0