結果

問題 No.709 優勝可能性
ユーザー dot_haraaidot_haraai
提出日時 2021-06-04 15:57:46
言語 Nim
(2.0.2)
結果
TLE  
実行時間 -
コード長 2,992 bytes
コンパイル時間 4,856 ms
コンパイル使用メモリ 88,448 KB
実行使用メモリ 13,952 KB
最終ジャッジ日時 2024-04-29 18:57:59
合計ジャッジ時間 10,015 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 3 ms
5,376 KB
testcase_03 AC 3 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 3 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 3 ms
5,376 KB
testcase_10 TLE -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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, 8) Warning: imported and not used: 'critbits' [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, 18) Warning: imported and not used: 'future' [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')


type SegTree = object
  tree :seq[HashSet[int]]
  n:int

proc initSegTree(baseArr:seq[HashSet[int]]):SegTree=
  var n = baseArr.len
  var m = 1
  while m < n:
    m*=2
  result = SegTree()
  result.n = m
  result.tree = newseqwith(2*m-1,initHashSet[int]())
  for i, v in baseArr:
    result.tree[m-1+i]=v
  for idx in countdown(m-2,0):
    result.tree[idx] = result.tree[idx*2+1]+result.tree[idx*2+2]

proc get(segTree:SegTree,ql,qr:int,k:int=0,left:int=0,right:int= -1):HashSet[int]=
  var right=right
  if right<0:
    right = segTree.n
  #echo ql,", ", qr, ", ",left,", ", right
  if ql>=right or qr<=left:
    return initHashSet[int]()
  if ql <= left and right <= qr:
    return segTree.tree[k]
  var
    vl = segTree.get(ql,qr,2*k+1,left,(left+right).div(2))
    vr = segTree.get(ql,qr,2*k+2,(left+right).div(2),right)
  return vl+vr

proc set(segTree:var SegTree,idx:int,value:HashSet[int])=
  var k = segTree.n - 1 + idx
  segTree.tree[k] = value
  while k>=1:
    k = (k-1).div(2)
    if segTree.tree[k] == segTree.tree[2*k+1]+segTree.tree[2*k+2]:
      break
    else:
      segTree.tree[k] = segTree.tree[2*k+1]+segTree.tree[2*k+2]

var baseArr = newseqwith(50,initHashSet[int]())

for i in 0..<10:
  baseArr[i] = @[i].toHashSet

var segTree = baseArr.initSegTree()

#echo segTree.tree

segTree.set(0,@[5].toHashSet())

#echo segTree.tree
proc solveSegTree()=
  var
    n = scan()
    m = scan()
    r = newseqwith(n,newseqwith(m,scan()))
    maxParam = newseqwith(m,0)
    maxParamPlayer = newseqwith(m,initHashSet[int]())
    segTree = maxParamPlayer.initSegTree()
  
  for k in 0..<n:
    for p in 0..<m:
      var t = segTree.get(p,p+1)
      if maxparam[p] < r[k][p]:
        maxparam[p] = r[k][p]
        t.clear()
        t.incl(k)
      elif maxparam[p] == r[k][p]:
        t.incl(k)
      segTree.set(p,t)
    
    
    echo segTree.get(0,m).len
    #echo segTree.tree




proc solve()=
  var
    n = scan()
    m = scan()
    r = newseqwith(n,newseqwith(m,scan()))
    maxParam = newseqwith(m,0)
    maxParamPlayer = newseqwith(m,initHashSet[int]())
  for k in 0..<n:
    for p in 0..<m:
      if maxparam[p] < r[k][p]:
        maxparam[p] = r[k][p]
        maxParamPlayer[p].clear()
        maxParamPlayer[p].incl(k)
      elif maxparam[p] == r[k][p]:
        maxParamPlayer[p].incl(k)
    #echo k, ", ", maxParamPlayer
    var t = maxParamPlayer[0]
    for p in 1..<m:
      t = t + maxParamPlayer[p]
    echo t.len


  

  
solveSegTree()
0