結果
問題 | No.1424 Ultrapalindrome |
ユーザー | dot_haraai |
提出日時 | 2021-06-02 21:39:37 |
言語 | Nim (2.0.2) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,450 bytes |
コンパイル時間 | 4,044 ms |
コンパイル使用メモリ | 88,576 KB |
実行使用メモリ | 12,800 KB |
最終ジャッジ日時 | 2024-04-27 14:37:56 |
合計ジャッジ時間 | 5,976 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,944 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 1 ms
6,940 KB |
testcase_09 | AC | 59 ms
9,472 KB |
testcase_10 | AC | 59 ms
9,344 KB |
testcase_11 | AC | 41 ms
7,296 KB |
testcase_12 | AC | 54 ms
9,216 KB |
testcase_13 | AC | 15 ms
6,944 KB |
testcase_14 | AC | 43 ms
7,680 KB |
testcase_15 | AC | 2 ms
6,944 KB |
testcase_16 | AC | 34 ms
6,940 KB |
testcase_17 | AC | 41 ms
7,424 KB |
testcase_18 | AC | 27 ms
6,944 KB |
testcase_19 | AC | 43 ms
6,944 KB |
testcase_20 | AC | 11 ms
6,940 KB |
testcase_21 | AC | 32 ms
6,944 KB |
testcase_22 | AC | 21 ms
6,944 KB |
testcase_23 | AC | 5 ms
6,944 KB |
testcase_24 | AC | 10 ms
6,940 KB |
testcase_25 | AC | 10 ms
6,940 KB |
testcase_26 | AC | 52 ms
6,940 KB |
testcase_27 | AC | 67 ms
10,752 KB |
testcase_28 | AC | 55 ms
7,808 KB |
testcase_29 | AC | 63 ms
12,416 KB |
testcase_30 | AC | 62 ms
12,800 KB |
testcase_31 | RE | - |
コンパイルメッセージ
/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(2, 8) Warning: imported and not used: 'critbits' [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]
ソースコード
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() es = newseqwith(n,newseq[int]()) mv = -1 for i in 0..<n-1: var a = scan()-1 b = scan()-1 es[a].add(b) es[b].add(a) if es[a].len>=3: mv = a #echo es.join("\n") proc dfs(par,p:int):int= if es[p].len==1: return 1 else: for nxt in es[p]: if par == nxt:continue return 1+dfs(p,nxt) # 葉が2枚しかない場合は可能 if es.filterIt(it.len==1).len==2: echo "Yes" # 枝分かれしている頂点が一つしかない # 一つしかないならmvがそれに該当する elif es.filterIt(it.len>2).len==1: #echo "mv:", mv var t = initHashSet[int]() for nxt in es[mv]: #echo mv,",",nxt,",", dfs(mv,nxt) t.incl(dfs(mv,nxt)) if t.len==1: echo "Yes" else: echo "No" elif n == 1: echo "Yes" else: echo "No" solve()