結果
問題 | No.1647 Travel in Mitaru city 2 |
ユーザー | ansain |
提出日時 | 2021-08-20 23:33:08 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,391 ms / 2,500 ms |
コード長 | 2,401 bytes |
コンパイル時間 | 247 ms |
コンパイル使用メモリ | 12,672 KB |
実行使用メモリ | 111,284 KB |
最終ジャッジ日時 | 2024-04-22 08:15:29 |
合計ジャッジ時間 | 46,073 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
10,752 KB |
testcase_01 | AC | 29 ms
10,752 KB |
testcase_02 | AC | 28 ms
10,880 KB |
testcase_03 | AC | 28 ms
11,008 KB |
testcase_04 | AC | 35 ms
11,904 KB |
testcase_05 | AC | 28 ms
10,752 KB |
testcase_06 | AC | 28 ms
11,008 KB |
testcase_07 | AC | 38 ms
12,416 KB |
testcase_08 | AC | 1,003 ms
101,672 KB |
testcase_09 | AC | 926 ms
94,060 KB |
testcase_10 | AC | 1,013 ms
102,156 KB |
testcase_11 | AC | 799 ms
84,596 KB |
testcase_12 | AC | 812 ms
83,976 KB |
testcase_13 | AC | 836 ms
87,680 KB |
testcase_14 | AC | 1,047 ms
104,560 KB |
testcase_15 | AC | 1,031 ms
103,340 KB |
testcase_16 | AC | 962 ms
97,720 KB |
testcase_17 | AC | 862 ms
87,936 KB |
testcase_18 | AC | 836 ms
87,496 KB |
testcase_19 | AC | 978 ms
105,160 KB |
testcase_20 | AC | 962 ms
98,600 KB |
testcase_21 | AC | 1,011 ms
106,884 KB |
testcase_22 | AC | 1,038 ms
106,452 KB |
testcase_23 | AC | 1,078 ms
107,072 KB |
testcase_24 | AC | 953 ms
99,292 KB |
testcase_25 | AC | 1,017 ms
102,108 KB |
testcase_26 | AC | 1,042 ms
106,936 KB |
testcase_27 | AC | 1,391 ms
108,900 KB |
testcase_28 | AC | 1,233 ms
111,164 KB |
testcase_29 | AC | 1,181 ms
111,160 KB |
testcase_30 | AC | 1,048 ms
104,356 KB |
testcase_31 | AC | 1,212 ms
111,284 KB |
testcase_32 | AC | 1,159 ms
109,432 KB |
testcase_33 | AC | 972 ms
101,148 KB |
testcase_34 | AC | 1,199 ms
111,160 KB |
testcase_35 | AC | 1,008 ms
101,572 KB |
testcase_36 | AC | 1,336 ms
111,160 KB |
testcase_37 | AC | 1,189 ms
111,032 KB |
testcase_38 | AC | 953 ms
95,240 KB |
testcase_39 | AC | 861 ms
88,584 KB |
testcase_40 | AC | 960 ms
94,192 KB |
testcase_41 | AC | 893 ms
88,916 KB |
testcase_42 | AC | 965 ms
94,812 KB |
testcase_43 | AC | 30 ms
11,008 KB |
testcase_44 | AC | 92 ms
26,496 KB |
testcase_45 | AC | 742 ms
75,392 KB |
testcase_46 | AC | 894 ms
75,264 KB |
testcase_47 | AC | 764 ms
75,264 KB |
testcase_48 | AC | 809 ms
75,392 KB |
testcase_49 | AC | 752 ms
75,264 KB |
testcase_50 | AC | 727 ms
75,264 KB |
ソースコード
import sys from collections import defaultdict, Counter, deque from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate import operator from math import sqrt, gcd, factorial # from math import isqrt, prod, comb #python3.8用(notpypy) #from bisect import bisect_left, bisect_right #from functools import lru_cache, reduce #from heapq import heappush, heappop, heapify, heappushpop, heapreplace #import numpy as np #import networkx as nx #from networkx.utils import UnionFind #from numba import njit, b1, i1, i4, i8, f8 # numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1 #from scipy.sparse import csr_matrix #from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree def input(): return sys.stdin.readline().rstrip() def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no) def main(): sys.setrecursionlimit(10**5+1) mod = 10**9+7 mod2 = 998244353 h, w, n = map(int, input().split()) xy = [list(map(lambda x: int(x)-1, input().split())) for i in range(n)] graph = [[] for i in range(h+w)] for i, (x, y) in enumerate(xy): graph[x].append([y+h, i+1]) graph[y+h].append([x, i+1]) visited = [0]*(h+w) points = [] edges = [] def dfs(u, p): visited[u] = 1 for v, num in graph[u]: if v != p: if visited[v]==1: #print(points) #print(edges) if v<h: ans=edges[points.index(v)+1:]+[num] else: ans=[num]+edges[points.index(v)+1:] print(len(ans)) print(*ans) #print(points) #for aa in ans: # print(xy[aa-1][0],xy[aa-1][1]+h) exit() points.append(v) edges.append(num) dfs(v, u) points.pop() edges.pop() for i in range(h): if visited[i]==0: points=[i] edges=[-1] #print(i) dfs(i, -1) print(-1) if __name__ == '__main__': main()