結果

問題 No.1647 Travel in Mitaru city 2
ユーザー ProgrammerryokiProgrammerryoki
提出日時 2021-08-13 22:37:28
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 1,188 bytes
コンパイル時間 247 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 100,096 KB
最終ジャッジ日時 2024-10-03 20:32:40
合計ジャッジ時間 5,536 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 5 TLE * 1 -- * 42
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

from sys import stdin, setrecursionlimit
setrecursionlimit(10**6)
input = stdin.readline
H,W,N = [int(i) for i in input().split()]
odd = {}
even = {}
points = []
for ind in range(N):
x,y = [int(i) for i in input().split()]
points.append((x,y))
if x not in even:
even[x] = set()
if y not in odd:
odd[y] = set()
for i,j in points:
if i == x:
even[i].add(ind+1)
even[x].add(ind+1)
if j == y:
odd[j].add(ind+1)
odd[y].add(ind+1)
# print(odd)
# print(even)
ord = []
seen = set()
start = 0
def dfs(x,y,order):
global seen, ord
rodd = len(seen)&1
graph = odd if rodd else even
nxt = y if rodd else x
for n in graph[nxt]:
if n not in seen:
seen.add(n)
i,j = points[n-1]
dfs(i,j,order+[n])
seen.remove(n)
else:
if n == start and len(order) >= 4:
ord = order
raise ConnectionError
try:
start = 1
seen.add(1)
dfs(points[0][0], points[0][1], [1])
print(-1)
except ConnectionError:
print(len(ord))
print(" ".join(str(i) for i in ord))
exit()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0