結果
問題 | No.629 グラフの中に眠る門松列 |
ユーザー | McGregorsh |
提出日時 | 2023-05-16 22:49:36 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,931 bytes |
コンパイル時間 | 1,026 ms |
コンパイル使用メモリ | 86,652 KB |
実行使用メモリ | 94,444 KB |
最終ジャッジ日時 | 2023-08-21 10:07:46 |
合計ジャッジ時間 | 14,800 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 235 ms
92,332 KB |
testcase_01 | AC | 238 ms
92,152 KB |
testcase_02 | AC | 237 ms
92,156 KB |
testcase_03 | AC | 233 ms
92,196 KB |
testcase_04 | AC | 236 ms
92,120 KB |
testcase_05 | AC | 234 ms
91,956 KB |
testcase_06 | AC | 232 ms
92,308 KB |
testcase_07 | AC | 232 ms
92,088 KB |
testcase_08 | WA | - |
testcase_09 | AC | 233 ms
92,268 KB |
testcase_10 | AC | 237 ms
92,156 KB |
testcase_11 | AC | 233 ms
92,168 KB |
testcase_12 | AC | 237 ms
92,004 KB |
testcase_13 | AC | 235 ms
92,308 KB |
testcase_14 | AC | 236 ms
92,216 KB |
testcase_15 | AC | 238 ms
92,152 KB |
testcase_16 | AC | 245 ms
92,112 KB |
testcase_17 | AC | 237 ms
92,232 KB |
testcase_18 | AC | 246 ms
92,268 KB |
testcase_19 | AC | 239 ms
92,348 KB |
testcase_20 | AC | 237 ms
92,284 KB |
testcase_21 | WA | - |
testcase_22 | AC | 249 ms
92,844 KB |
testcase_23 | AC | 273 ms
93,488 KB |
testcase_24 | AC | 265 ms
93,876 KB |
testcase_25 | AC | 303 ms
94,148 KB |
testcase_26 | AC | 303 ms
94,176 KB |
testcase_27 | AC | 269 ms
94,160 KB |
testcase_28 | AC | 244 ms
92,628 KB |
testcase_29 | AC | 266 ms
94,076 KB |
testcase_30 | AC | 271 ms
94,152 KB |
testcase_31 | AC | 274 ms
94,252 KB |
testcase_32 | AC | 266 ms
94,168 KB |
testcase_33 | AC | 268 ms
94,084 KB |
testcase_34 | AC | 264 ms
94,200 KB |
testcase_35 | AC | 260 ms
94,004 KB |
testcase_36 | AC | 260 ms
94,240 KB |
testcase_37 | AC | 265 ms
94,444 KB |
testcase_38 | AC | 264 ms
94,072 KB |
testcase_39 | AC | 264 ms
94,192 KB |
testcase_40 | AC | 270 ms
94,220 KB |
testcase_41 | AC | 269 ms
93,772 KB |
ソースコード
import sys, re from fractions import Fraction 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, ROUND_HALF_UP 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() A = i_list() G = [[] for i in range(N)] for i in range(M): a, b = i_map() a -= 1 b -= 1 G[a].append(b) G[b].append(a) for i in range(N): for j in G[i]: for k in G[i]: p = set() p.add(A[i]) p.add(A[j]) p.add(A[k]) if len(p) == 3: if A[i] < A[j] > A[k]: print('YES') exit() if A[i] > A[j] < A[k]: print('YES') exit() print('NO') if __name__ == '__main__': main()