結果
問題 | No.2732 Similar Permutations |
ユーザー | flygon |
提出日時 | 2024-04-19 22:41:47 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,322 bytes |
コンパイル時間 | 309 ms |
コンパイル使用メモリ | 82,268 KB |
実行使用メモリ | 151,508 KB |
最終ジャッジ日時 | 2024-04-19 22:42:47 |
合計ジャッジ時間 | 28,275 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
55,152 KB |
testcase_01 | AC | 40 ms
55,640 KB |
testcase_02 | AC | 217 ms
99,312 KB |
testcase_03 | AC | 401 ms
115,048 KB |
testcase_04 | AC | 140 ms
88,004 KB |
testcase_05 | AC | 125 ms
85,448 KB |
testcase_06 | AC | 84 ms
79,424 KB |
testcase_07 | AC | 288 ms
106,292 KB |
testcase_08 | AC | 159 ms
90,308 KB |
testcase_09 | AC | 105 ms
82,432 KB |
testcase_10 | AC | 653 ms
151,508 KB |
testcase_11 | AC | 92 ms
79,732 KB |
testcase_12 | AC | 197 ms
116,668 KB |
testcase_13 | AC | 201 ms
116,828 KB |
testcase_14 | AC | 196 ms
116,828 KB |
testcase_15 | AC | 203 ms
116,884 KB |
testcase_16 | AC | 165 ms
112,132 KB |
testcase_17 | AC | 165 ms
112,980 KB |
testcase_18 | AC | 194 ms
116,168 KB |
testcase_19 | AC | 198 ms
116,768 KB |
testcase_20 | AC | 192 ms
116,560 KB |
testcase_21 | AC | 188 ms
108,692 KB |
testcase_22 | AC | 177 ms
104,648 KB |
testcase_23 | AC | 183 ms
106,556 KB |
testcase_24 | AC | 140 ms
102,464 KB |
testcase_25 | AC | 184 ms
105,376 KB |
testcase_26 | AC | 167 ms
104,776 KB |
testcase_27 | AC | 169 ms
105,216 KB |
testcase_28 | AC | 148 ms
102,284 KB |
testcase_29 | AC | 166 ms
106,368 KB |
testcase_30 | AC | 144 ms
102,264 KB |
testcase_31 | AC | 165 ms
106,420 KB |
testcase_32 | AC | 156 ms
104,576 KB |
testcase_33 | AC | 173 ms
106,804 KB |
testcase_34 | AC | 136 ms
101,120 KB |
testcase_35 | AC | 166 ms
107,264 KB |
testcase_36 | AC | 152 ms
104,448 KB |
testcase_37 | AC | 162 ms
106,864 KB |
testcase_38 | AC | 149 ms
105,088 KB |
testcase_39 | AC | 154 ms
106,752 KB |
testcase_40 | AC | 144 ms
105,416 KB |
testcase_41 | AC | 162 ms
106,880 KB |
testcase_42 | AC | 144 ms
103,680 KB |
testcase_43 | AC | 164 ms
106,880 KB |
testcase_44 | AC | 123 ms
99,712 KB |
testcase_45 | AC | 177 ms
107,264 KB |
testcase_46 | AC | 152 ms
104,960 KB |
testcase_47 | AC | 160 ms
107,520 KB |
testcase_48 | AC | 129 ms
101,760 KB |
testcase_49 | AC | 174 ms
107,264 KB |
testcase_50 | AC | 129 ms
101,760 KB |
testcase_51 | AC | 172 ms
107,136 KB |
testcase_52 | AC | 143 ms
105,472 KB |
testcase_53 | AC | 235 ms
124,732 KB |
testcase_54 | AC | 217 ms
124,976 KB |
testcase_55 | AC | 223 ms
124,856 KB |
testcase_56 | AC | 210 ms
124,848 KB |
testcase_57 | AC | 152 ms
110,336 KB |
testcase_58 | AC | 184 ms
114,304 KB |
testcase_59 | AC | 164 ms
114,688 KB |
testcase_60 | AC | 154 ms
110,640 KB |
testcase_61 | AC | 151 ms
109,184 KB |
testcase_62 | AC | 189 ms
120,064 KB |
testcase_63 | AC | 42 ms
54,656 KB |
testcase_64 | AC | 43 ms
54,528 KB |
testcase_65 | AC | 41 ms
54,784 KB |
testcase_66 | AC | 42 ms
54,528 KB |
testcase_67 | AC | 42 ms
54,912 KB |
testcase_68 | AC | 45 ms
55,040 KB |
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: a = [[a[i], i] for i in range(n)] a.sort() ok = 0 p1 = [0]*(n) p2 = [0]*(n) s = set([i for i in range(1, n+1)]) for i in range(2, n): x,xi = a[i-2] y,yi = a[i-1] z,zi = a[i] d1 = y-x d2 = z-y if z-x < n and d1 == d2: p1[xi], p1[yi], p1[zi] = 1+d1, 1+d1+d2, 1 p2[xi], p2[yi], p2[zi] = 1+d1+d2, 1, 1+d1 ok = 1 s.discard(1) s.discard(1+d1) s.discard(1+d1+d2) break 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)