結果

問題 No.447 ゆきこーだーの雨と雪 (2)
ユーザー dot_haraaidot_haraai
提出日時 2021-05-30 15:52:02
言語 Nim
(2.0.2)
結果
WA  
実行時間 -
コード長 1,678 bytes
コンパイル時間 5,767 ms
コンパイル使用メモリ 90,112 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-11-08 20:49:59
合計ジャッジ時間 7,086 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(1, 66) Warning: imported and not used: 'lists' [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, 73) Warning: imported and not used: 'intsets' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [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()
    l = newseqwith(n,scan())
    aced = newseqwith(n,0)
    t = scan()
    names = newseq[string](t)
    problem = newseq[int](t)
  for i in 0..<t:
    (names[i],problem[i]) = (read(),read()[0].ord-'A'.ord)
  var
    uniqNames = names.deduplicate()
    players = uniqNames.len
    playerIds = initTable[string,int]()
    invPlayerIds = initTable[int,string]()
    score = newseqwith(players,newseqwith(n,0))
    subTime = newseqwith(players,0)
  for idx, name in uniqNames:
    playerIds[name] = idx
    invPlayerIds[idx] = name
  

  for i in 0..<t:
    var
      name = names[i]
      pid = playerIds[name]
      pr = problem[i]
    aced[pr]+=1
    score[pid][pr] = 50*l[pr] + ((50*l[pr]).float / (0.8+0.2*aced[pr].float)).floor.int
    subTime[pid]=i
  
  var
    scoreAndSubTime = newseqwith(players,(0,0,0))
  for pid in 0..<players:
    scoreAndSubTime[pid] = (int.high - score[pid].sum(),subTime[pid],pid)
  scoreAndSubTime.sort()
  for idx, (sc,subTime,pid) in scoreAndSubTime:
    echo fmt"{idx+1} {invPlayerIds[pid]} " & score[pid].join(" ") & fmt" {int.high - sc}"
    


  

  
    
  
  
  
solve()
0