結果

問題 No.1647 Travel in Mitaru city 2
ユーザー ansainansain
提出日時 2021-08-13 23:33:09
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
WA  
実行時間 -
コード長 2,337 bytes
コンパイル時間 395 ms
コンパイル使用メモリ 12,672 KB
実行使用メモリ 111,280 KB
最終ジャッジ日時 2024-10-03 23:43:56
合計ジャッジ時間 49,932 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 34 ms
10,752 KB
testcase_01 AC 31 ms
10,752 KB
testcase_02 AC 32 ms
10,880 KB
testcase_03 AC 32 ms
10,880 KB
testcase_04 WA -
testcase_05 AC 31 ms
10,880 KB
testcase_06 AC 32 ms
10,880 KB
testcase_07 AC 43 ms
12,288 KB
testcase_08 AC 1,145 ms
101,660 KB
testcase_09 AC 1,017 ms
94,116 KB
testcase_10 AC 1,117 ms
102,228 KB
testcase_11 AC 869 ms
84,648 KB
testcase_12 AC 909 ms
84,148 KB
testcase_13 AC 920 ms
87,764 KB
testcase_14 AC 1,137 ms
105,892 KB
testcase_15 AC 1,169 ms
104,548 KB
testcase_16 AC 1,117 ms
97,848 KB
testcase_17 AC 925 ms
87,988 KB
testcase_18 AC 921 ms
87,552 KB
testcase_19 AC 1,081 ms
105,216 KB
testcase_20 AC 1,021 ms
98,544 KB
testcase_21 AC 1,120 ms
107,260 KB
testcase_22 AC 1,151 ms
106,444 KB
testcase_23 AC 1,136 ms
107,104 KB
testcase_24 AC 1,055 ms
99,292 KB
testcase_25 AC 1,115 ms
102,100 KB
testcase_26 AC 1,166 ms
107,064 KB
testcase_27 AC 1,612 ms
109,284 KB
testcase_28 AC 1,296 ms
110,004 KB
testcase_29 AC 1,291 ms
111,156 KB
testcase_30 AC 1,109 ms
104,568 KB
testcase_31 AC 1,261 ms
111,280 KB
testcase_32 AC 1,274 ms
109,684 KB
testcase_33 AC 1,086 ms
101,404 KB
testcase_34 AC 1,309 ms
111,152 KB
testcase_35 AC 1,099 ms
101,824 KB
testcase_36 AC 1,298 ms
110,000 KB
testcase_37 AC 1,290 ms
111,156 KB
testcase_38 AC 1,082 ms
95,100 KB
testcase_39 AC 943 ms
88,568 KB
testcase_40 AC 1,021 ms
94,448 KB
testcase_41 AC 980 ms
89,040 KB
testcase_42 AC 1,064 ms
94,680 KB
testcase_43 AC 33 ms
11,008 KB
testcase_44 AC 102 ms
26,624 KB
testcase_45 AC 827 ms
75,136 KB
testcase_46 AC 972 ms
75,136 KB
testcase_47 AC 807 ms
75,264 KB
testcase_48 AC 912 ms
75,520 KB
testcase_49 WA -
testcase_50 RE -
権限があれば一括ダウンロードができます

ソースコード

diff #

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 and v<=h:
                    #print(points)
                    #print(edges)
                    ans=edges[points.index(v)+1:]+[num]
                    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()
0