結果

問題 No.517 壊れたアクセサリー
コンテスト
ユーザー dot_haraai
提出日時 2021-06-02 21:05:28
言語 Nim
(2.2.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 1,723 bytes
コンパイル時間 4,170 ms
コンパイル使用メモリ 89,604 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-15 16:42:22
合計ジャッジ時間 5,183 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 15
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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()
    clue1 = newseqwith(n,read())
    m = scan()
    clue2 = newseqwith(m,read())
    es = newseqwith(26,newseq[int]())
    ies = newseqwith(26,newseq[int]())
    app = newseqwith(26,false)
  for clue in clue1 & clue2:
    for c in clue:
      app[c.ord-'A'.ord]=true
    for i in 0..<clue.len-1:
      if clue[i+1].ord-'A'.ord notin es[clue[i].ord-'A'.ord]:
        es[clue[i].ord-'A'.ord].add(clue[i+1].ord-'A'.ord)
        ies[clue[i+1].ord-'A'.ord].add(clue[i].ord-'A'.ord)
  #echo es.join("\n")
  var s = -1
  for idx, v in app:
    if v:
      s = idx
      break
  var
    v = s
    touch = newseqwith(26,false)
  while ies[v].len>0:
    v = ies[v][0]
    # ループがあったら不可能
    if touch[v]:
      echo -1
      return
    touch[v]=true
  # ループがなければ始点についている
  touch.fill(false)
  var res = newseq[char]()
  res.add((v+'A'.ord).chr)
  touch[v]=true
  while es[v].len>0:
    if es[v].len>1:
      echo -1
      return
    v = es[v][0]
    touch[v]=true
    res.add((v+'A'.ord).chr)
  for i in 0..<26:
    if app[i] and not touch[i]:
      echo -1
      return
  echo res.join("")


      

  

  
solve()
0