結果

問題 No.629 グラフの中に眠る門松列
ユーザー McGregorshMcGregorsh
提出日時 2022-06-30 21:02:50
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,750 bytes
コンパイル時間 257 ms
コンパイル使用メモリ 82,408 KB
実行使用メモリ 230,520 KB
最終ジャッジ日時 2024-11-24 20:42:12
合計ジャッジ時間 85,097 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 105 ms
177,280 KB
testcase_01 AC 110 ms
88,576 KB
testcase_02 AC 107 ms
88,576 KB
testcase_03 AC 112 ms
90,268 KB
testcase_04 AC 109 ms
88,448 KB
testcase_05 AC 116 ms
176,896 KB
testcase_06 AC 111 ms
196,864 KB
testcase_07 AC 107 ms
88,576 KB
testcase_08 WA -
testcase_09 AC 113 ms
88,448 KB
testcase_10 AC 115 ms
90,392 KB
testcase_11 AC 116 ms
88,576 KB
testcase_12 AC 110 ms
90,244 KB
testcase_13 AC 107 ms
88,448 KB
testcase_14 AC 105 ms
90,380 KB
testcase_15 AC 110 ms
88,576 KB
testcase_16 AC 107 ms
200,320 KB
testcase_17 AC 106 ms
88,576 KB
testcase_18 AC 106 ms
206,464 KB
testcase_19 AC 108 ms
88,960 KB
testcase_20 AC 109 ms
199,808 KB
testcase_21 WA -
testcase_22 AC 131 ms
210,176 KB
testcase_23 AC 314 ms
94,848 KB
testcase_24 TLE -
testcase_25 TLE -
testcase_26 TLE -
testcase_27 TLE -
testcase_28 AC 140 ms
89,908 KB
testcase_29 AC 145 ms
89,760 KB
testcase_30 TLE -
testcase_31 TLE -
testcase_32 TLE -
testcase_33 TLE -
testcase_34 TLE -
testcase_35 TLE -
testcase_36 TLE -
testcase_37 TLE -
testcase_38 TLE -
testcase_39 TLE -
testcase_40 TLE -
testcase_41 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def get_distance(x1, y1, x2, y2):
	  d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
	  return d
def rotate(table):
   	  n_fild = []
   	  for x in zip(*table[::-1]):
   	  	  n_fild.append(x)
   	  return n_fild
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
MOD = 10 ** 9 + 7
MOD2 = 998244353


def main():
   
   n, m = i_map()
   score = i_list()
   nums = [[] for i in range(n)]
   for i in range(m):
   	  a, b = i_map()
   	  a -= 1
   	  b -= 1
   	  nums[a].append(b)
   	  nums[b].append(a)
   
   def dfs(now, p, count):
   	  #print(count)
   	  if len(count) == 3:
   	  	  if len(set(count)) == 3:
   	  	  	  if min(count) == count[1] or max(count) == count[1]:
   	  	  	  	  print('YES')
   	  	  	  	  exit()
   	  	  	  else:
   	  	  	  	  count = count[1:]
   	  	  	  	  for i in nums[now]:
   	  	  	  	  	  if i == p or juge[i]:
   	  	  	  	  	  	  continue
   	  	  	  	  	  count.append(score[i])
   	  	  	  	  	  juge[i] = True
   	  	  	  	  	  dfs(i, now, count)
   	  	  	  	  	  count = count[:2]
   	  	  	  	  	  juge[i] = False
   	  	  else:
   	  	  	  count = count[1:]
   	  	  	  for j in nums[now]:
   	  	  	  	  if j == p or juge[j]:
   	  	  	  	  	  continue
   	  	  	  	  count.append(score[j])
   	  	  	  	  juge[j] = True
   	  	  	  	  dfs(j, now, count)
   	  	  	  	  count = count[:2]
   	  	  	  	  juge[j] = False
   	  else:
   	  	  for k in nums[now]:
   	  	  	  if k == p or juge[k]:
   	  	  	  	  continue
   	  	  	  count.append(score[k])
   	  	  	  juge[k] = True
   	  	  	  dfs(k, now, count)
   	  	  	  count = count[:2]
   	  	  	  juge[k] = False
   	  
   	  
   	  
   
   juge = [False] * n
   for i in range(n):
   	  if juge[i] == False:
   	  	  dfs(i, -1, [score[i]])
   print('NO')
   
if __name__ == '__main__':
    main()
0