結果
問題 | No.1707 Simple Range Reverse Problem |
ユーザー | McGregorsh |
提出日時 | 2022-07-25 19:18:56 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 293 ms / 2,000 ms |
コード長 | 1,913 bytes |
コンパイル時間 | 299 ms |
コンパイル使用メモリ | 87,112 KB |
実行使用メモリ | 93,632 KB |
最終ジャッジ日時 | 2023-09-22 04:29:27 |
合計ジャッジ時間 | 7,774 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 274 ms
92,328 KB |
testcase_01 | AC | 276 ms
93,136 KB |
testcase_02 | AC | 276 ms
93,228 KB |
testcase_03 | AC | 277 ms
93,224 KB |
testcase_04 | AC | 273 ms
93,132 KB |
testcase_05 | AC | 270 ms
92,964 KB |
testcase_06 | AC | 273 ms
93,180 KB |
testcase_07 | AC | 275 ms
93,052 KB |
testcase_08 | AC | 273 ms
93,508 KB |
testcase_09 | AC | 278 ms
93,364 KB |
testcase_10 | AC | 274 ms
93,268 KB |
testcase_11 | AC | 272 ms
93,148 KB |
testcase_12 | AC | 271 ms
93,516 KB |
testcase_13 | AC | 285 ms
93,632 KB |
testcase_14 | AC | 284 ms
93,588 KB |
testcase_15 | AC | 293 ms
93,332 KB |
testcase_16 | AC | 289 ms
93,364 KB |
testcase_17 | AC | 283 ms
93,172 KB |
testcase_18 | AC | 289 ms
93,428 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 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(): t = int(input()) for i in range(t): n = int(input()) A = i_list() base = [] for j in range(2): for k in range(1, n+1): base.append(k) #print(base) juge = False for l in range(n): new = base[l:l+n+1][::-1] lines = base[:l] + new + base[l+n+1:] #print(lines) if lines == A: juge = True break if A == base: juge = True if juge: print('Yes') else: print('No') if __name__ == '__main__': main()