結果

問題 No.1373 Directed Operations
コンテスト
ユーザー dot_haraai
提出日時 2021-03-20 19:49:25
言語 Nim
(2.2.0)
結果
AC  
実行時間 57 ms / 2,000 ms
コード長 924 bytes
コンパイル時間 6,384 ms
コンパイル使用メモリ 87,648 KB
実行使用メモリ 9,472 KB
最終ジャッジ日時 2024-11-21 09:17:15
合計ジャッジ時間 8,496 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 19
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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()=
  var
    n = scan()
    a = newseq[(int,int)]()
    res = newseqwith(n-1,0)
    p=true
  for i in 0..<n-1:
    a.add((scan(),i))
  a.sort(SortOrder.Descending)
  for i in 0..<n-1:
    var (length,idx)=a[i]
    if i+length<=n-1:
      res[idx]= n-(i+length)
    else:
      p=false
      break
  if p:
    echo "YES"
    echo res.join("\n")
  else:
    echo "NO"


  

  
solve()
0