結果
問題 | No.2732 Similar Permutations |
ユーザー | flygon |
提出日時 | 2024-04-19 23:14:01 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,464 bytes |
コンパイル時間 | 318 ms |
コンパイル使用メモリ | 82,332 KB |
実行使用メモリ | 190,188 KB |
最終ジャッジ日時 | 2024-04-19 23:15:07 |
合計ジャッジ時間 | 26,161 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
54,528 KB |
testcase_01 | WA | - |
testcase_02 | RE | - |
testcase_03 | WA | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | RE | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | RE | - |
testcase_12 | AC | 200 ms
116,772 KB |
testcase_13 | AC | 175 ms
117,276 KB |
testcase_14 | AC | 169 ms
117,132 KB |
testcase_15 | AC | 173 ms
116,872 KB |
testcase_16 | AC | 145 ms
112,256 KB |
testcase_17 | AC | 150 ms
113,056 KB |
testcase_18 | AC | 166 ms
116,128 KB |
testcase_19 | AC | 178 ms
117,408 KB |
testcase_20 | AC | 201 ms
116,036 KB |
testcase_21 | AC | 171 ms
108,688 KB |
testcase_22 | AC | 136 ms
105,032 KB |
testcase_23 | AC | 165 ms
106,636 KB |
testcase_24 | AC | 147 ms
103,032 KB |
testcase_25 | AC | 157 ms
105,332 KB |
testcase_26 | AC | 143 ms
104,872 KB |
testcase_27 | AC | 153 ms
105,196 KB |
testcase_28 | AC | 130 ms
102,256 KB |
testcase_29 | AC | 143 ms
106,748 KB |
testcase_30 | AC | 127 ms
102,180 KB |
testcase_31 | AC | 150 ms
107,132 KB |
testcase_32 | AC | 137 ms
104,356 KB |
testcase_33 | AC | 157 ms
106,888 KB |
testcase_34 | AC | 120 ms
101,084 KB |
testcase_35 | AC | 145 ms
107,132 KB |
testcase_36 | AC | 136 ms
104,508 KB |
testcase_37 | AC | 145 ms
106,888 KB |
testcase_38 | AC | 135 ms
105,308 KB |
testcase_39 | AC | 142 ms
107,068 KB |
testcase_40 | AC | 132 ms
105,612 KB |
testcase_41 | AC | 155 ms
107,044 KB |
testcase_42 | AC | 125 ms
104,024 KB |
testcase_43 | AC | 147 ms
107,312 KB |
testcase_44 | AC | 111 ms
99,732 KB |
testcase_45 | AC | 145 ms
106,972 KB |
testcase_46 | AC | 136 ms
105,192 KB |
testcase_47 | AC | 146 ms
107,264 KB |
testcase_48 | AC | 119 ms
101,952 KB |
testcase_49 | AC | 145 ms
107,428 KB |
testcase_50 | AC | 127 ms
102,124 KB |
testcase_51 | AC | 145 ms
107,752 KB |
testcase_52 | AC | 129 ms
105,872 KB |
testcase_53 | AC | 190 ms
124,728 KB |
testcase_54 | AC | 184 ms
124,896 KB |
testcase_55 | AC | 188 ms
125,156 KB |
testcase_56 | AC | 181 ms
125,264 KB |
testcase_57 | AC | 135 ms
110,336 KB |
testcase_58 | AC | 157 ms
114,272 KB |
testcase_59 | AC | 152 ms
114,940 KB |
testcase_60 | AC | 136 ms
110,372 KB |
testcase_61 | AC | 132 ms
109,212 KB |
testcase_62 | AC | 168 ms
120,356 KB |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | WA | - |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | WA | - |
testcase_70 | WA | - |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | WA | - |
testcase_75 | WA | - |
testcase_76 | WA | - |
testcase_77 | WA | - |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | WA | - |
testcase_83 | WA | - |
testcase_84 | WA | - |
testcase_85 | WA | - |
testcase_86 | WA | - |
testcase_87 | WA | - |
testcase_88 | WA | - |
testcase_89 | WA | - |
testcase_90 | WA | - |
testcase_91 | WA | - |
testcase_92 | WA | - |
testcase_93 | WA | - |
testcase_94 | WA | - |
testcase_95 | WA | - |
testcase_96 | WA | - |
testcase_97 | WA | - |
testcase_98 | WA | - |
testcase_99 | WA | - |
testcase_100 | WA | - |
testcase_101 | WA | - |
testcase_102 | WA | - |
ソースコード
import sys sys.setrecursionlimit(5*10**5) input = sys.stdin.readline from collections import defaultdict, deque, Counter from heapq import heappop, heappush from bisect import bisect_left, bisect_right from math import gcd n = int(input()) a = list(map(int,input().split())) if len(set(a)) != n: x = [[] for i in range(max(a)+10)] for i in range(n): x[a[i]].append(i) ok = 1 p1 = list(range(1, n+1)) p2 = list(range(1, n+1)) for i in range(max(a)+10): if len(x[i]) >= 2: s,t = x[i][0], x[i][1] p2[t], p2[s] = p2[s], p2[t] break else: ok = 0 p1 = [0]*(n) p2 = [0]*(n) s = set([i for i in range(1, n+1)]) mx = max(a) sa = set(a) pos = [-1]*(mx+1) for i in range(n): pos[a[i]] = i for xi in range(n): x = a[xi] for yi in range(i, n): y = a[yi] d = y-x if y + d > mx:break if 1 + 2 * d > n:break if y+d in sa: zi = pos[y+2*d] p1[xi], p1[yi], p1[zi] = 1+d, 1+d+d, 1 p2[xi], p2[yi], p2[zi] = 1+d+d, 1, 1+d ok = 1 s.discard(1) s.discard(1+d) s.discard(1+d+d) s = list(s) for i in range(n): if p1[i]: continue num = s.pop() p1[i] = num p2[i] = num if ok: print(*p1) print(*p2) else: print(-1)