Submission #1473524
Source Code Expand
import strutils, sequtils, algorithm, math let tmp = stdin.readline.split.map(parseInt) (N, M) = (tmp[0], tmp[1]) var edge = newSeqWith(N, newSeq[int]()) for i in 0..<M: let e = stdin.readline.split.mapIt(it.parseInt-1) (a, b) = (e[0], e[1]) edge[a].add(b) edge[b].add(a) var used = newSeq[bool](N) let (s, t) = (0, edge[0][0]) used[s] = true used[t] = true var ans = newSeqWith(2, newSeq[int]()) ans[0].add(s + 1) ans[1].add(t + 1) for i, start in @[s, t]: var v = start while edge[v].anyIt(not used[it]): for c in edge[v]: if not used[c]: v = c used[c] = true ans[i].add(c + 1) break echo(ans.mapIt(it.len).sum) (ans[0].reversed & ans[1]).mapIt(it.intToStr).join(" ").echo
Submission Info
Submission Time | |
---|---|
Task | B - Hamiltonish Path |
User | n_knuu |
Language | Nim (0.13.0) |
Score | 500 |
Code Size | 780 Byte |
Status | AC |
Exec Time | 114 ms |
Memory | 23664 KB |
Compile Error
Hint: system [Processing] Hint: Main [Processing] Hint: strutils [Processing] Hint: parseutils [Processing] Hint: sequtils [Processing] Hint: algorithm [Processing] Hint: math [Processing] Hint: times [Processing] Hint: [Link] Hint: operation successful (15207 lines compiled; 2.019 sec total; 16.169MB; Release Build) [SuccessX]
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 75 ms | 9340 KB |
subtask_1_02.txt | AC | 21 ms | 2300 KB |
subtask_1_03.txt | AC | 67 ms | 9980 KB |
subtask_1_04.txt | AC | 78 ms | 7932 KB |
subtask_1_05.txt | AC | 77 ms | 7932 KB |
subtask_1_06.txt | AC | 78 ms | 8188 KB |
subtask_1_07.txt | AC | 85 ms | 14588 KB |
subtask_1_08.txt | AC | 84 ms | 14460 KB |
subtask_1_09.txt | AC | 114 ms | 23664 KB |
subtask_1_10.txt | AC | 34 ms | 6012 KB |
subtask_1_11.txt | AC | 42 ms | 6396 KB |
subtask_1_12.txt | AC | 1 ms | 256 KB |
subtask_1_13.txt | AC | 1 ms | 256 KB |