結果
問題 | No.360 増加門松列 |
ユーザー | McGregorsh |
提出日時 | 2022-10-27 12:53:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 274 ms / 2,000 ms |
コード長 | 1,774 bytes |
コンパイル時間 | 283 ms |
コンパイル使用メモリ | 86,916 KB |
実行使用メモリ | 93,632 KB |
最終ジャッジ日時 | 2023-09-18 06:36:26 |
合計ジャッジ時間 | 7,268 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 274 ms
93,260 KB |
testcase_01 | AC | 265 ms
93,296 KB |
testcase_02 | AC | 257 ms
93,280 KB |
testcase_03 | AC | 250 ms
92,504 KB |
testcase_04 | AC | 263 ms
93,180 KB |
testcase_05 | AC | 259 ms
93,244 KB |
testcase_06 | AC | 257 ms
93,432 KB |
testcase_07 | AC | 258 ms
93,424 KB |
testcase_08 | AC | 263 ms
93,136 KB |
testcase_09 | AC | 259 ms
93,092 KB |
testcase_10 | AC | 254 ms
93,316 KB |
testcase_11 | AC | 251 ms
92,380 KB |
testcase_12 | AC | 259 ms
93,248 KB |
testcase_13 | AC | 258 ms
93,124 KB |
testcase_14 | AC | 259 ms
93,292 KB |
testcase_15 | AC | 253 ms
93,348 KB |
testcase_16 | AC | 253 ms
92,464 KB |
testcase_17 | AC | 258 ms
93,396 KB |
testcase_18 | AC | 260 ms
93,248 KB |
testcase_19 | AC | 259 ms
93,632 KB |
testcase_20 | AC | 259 ms
93,288 KB |
testcase_21 | AC | 257 ms
93,356 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(): D = i_list() for per in permutations(D, 7): juge = True for j in range(1, 6): a = per[j-1] b = per[j] c = per[j+1] if a < c: if c < b or b < a: continue else: juge = False else: juge = False if juge: print('YES') exit() print('NO') if __name__ == '__main__': main()