結果

問題 No.629 グラフの中に眠る門松列
ユーザー McGregorshMcGregorsh
提出日時 2022-06-30 21:09:40
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,783 bytes
コンパイル時間 287 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 175,960 KB
最終ジャッジ日時 2024-05-03 17:44:11
合計ジャッジ時間 9,431 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 125 ms
175,960 KB
testcase_01 AC 125 ms
83,200 KB
testcase_02 AC 125 ms
83,584 KB
testcase_03 AC 123 ms
83,032 KB
testcase_04 AC 123 ms
83,496 KB
testcase_05 AC 124 ms
83,456 KB
testcase_06 AC 122 ms
83,408 KB
testcase_07 AC 123 ms
83,088 KB
testcase_08 AC 121 ms
83,328 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 120 ms
83,432 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 123 ms
83,328 KB
testcase_15 AC 120 ms
83,028 KB
testcase_16 AC 125 ms
83,416 KB
testcase_17 WA -
testcase_18 AC 117 ms
83,392 KB
testcase_19 WA -
testcase_20 AC 124 ms
83,328 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 TLE -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
権限があれば一括ダウンロードができます

ソースコード

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] or i < now:
   	  	  	  	  	  	  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] or j < now:
   	  	  	  	  	  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] or k < now:
   	  	  	  	  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