結果

問題 No.583 鉄道同好会
コンテスト
ユーザー dot_haraai
提出日時 2021-06-02 17:44:41
言語 Nim
(2.2.0)
結果
AC  
実行時間 71 ms / 2,000 ms
コード長 1,188 bytes
コンパイル時間 4,184 ms
コンパイル使用メモリ 87,500 KB
実行使用メモリ 9,088 KB
最終ジャッジ日時 2024-11-15 11:26:13
合計ジャッジ時間 4,766 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 16
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(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]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [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()
    es = newseqwith(n,newseq[int]())
  for i in 0..<m:
    var  
      a = scan()
      b = scan()
    es[a].add(b)
    es[b].add(a)
  var
    even = 0
    odd=0
  for i in 0..<n:
    if es[i].len.mod(2)==0:
      even+=1
    else:
      odd+=1

  var
    touch = newseqwith(n,false)
    s = 0
  for idx in 0..<n:
    if es[idx].len==0:
      touch[idx] = true
    else:
      s = idx

  proc dfs(p:int)=
    touch[p]=true
    for nxt in es[p]:
      if not touch[nxt]:
        dfs(nxt)


  
  dfs(s)
  #echo touch
  if (odd==0 or odd==2) and touch.allIt(it):
    echo "YES"
  else:
    echo "NO"
  
solve()
0