結果
問題 | No.2732 Similar Permutations |
ユーザー | flygon |
提出日時 | 2024-04-19 22:30:20 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,139 bytes |
コンパイル時間 | 248 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 126,464 KB |
最終ジャッジ日時 | 2024-04-19 22:30:56 |
合計ジャッジ時間 | 29,309 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
54,528 KB |
testcase_01 | AC | 44 ms
54,528 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 227 ms
117,008 KB |
testcase_13 | AC | 202 ms
117,012 KB |
testcase_14 | AC | 198 ms
116,756 KB |
testcase_15 | AC | 208 ms
116,892 KB |
testcase_16 | AC | 169 ms
112,512 KB |
testcase_17 | AC | 168 ms
112,384 KB |
testcase_18 | AC | 181 ms
115,712 KB |
testcase_19 | AC | 196 ms
116,752 KB |
testcase_20 | AC | 194 ms
116,288 KB |
testcase_21 | AC | 191 ms
108,692 KB |
testcase_22 | AC | 152 ms
104,832 KB |
testcase_23 | AC | 186 ms
106,144 KB |
testcase_24 | AC | 155 ms
102,656 KB |
testcase_25 | AC | 194 ms
105,236 KB |
testcase_26 | AC | 165 ms
104,576 KB |
testcase_27 | AC | 178 ms
104,704 KB |
testcase_28 | AC | 152 ms
101,888 KB |
testcase_29 | AC | 167 ms
106,240 KB |
testcase_30 | AC | 144 ms
102,144 KB |
testcase_31 | AC | 168 ms
106,624 KB |
testcase_32 | AC | 168 ms
104,192 KB |
testcase_33 | AC | 183 ms
107,008 KB |
testcase_34 | AC | 134 ms
101,504 KB |
testcase_35 | AC | 161 ms
106,880 KB |
testcase_36 | AC | 159 ms
104,320 KB |
testcase_37 | AC | 162 ms
106,880 KB |
testcase_38 | AC | 153 ms
105,216 KB |
testcase_39 | AC | 160 ms
106,624 KB |
testcase_40 | AC | 148 ms
105,600 KB |
testcase_41 | AC | 163 ms
107,008 KB |
testcase_42 | AC | 139 ms
103,680 KB |
testcase_43 | AC | 165 ms
107,136 KB |
testcase_44 | AC | 125 ms
99,712 KB |
testcase_45 | AC | 162 ms
106,880 KB |
testcase_46 | AC | 161 ms
104,832 KB |
testcase_47 | AC | 165 ms
107,392 KB |
testcase_48 | AC | 133 ms
101,632 KB |
testcase_49 | AC | 165 ms
107,264 KB |
testcase_50 | AC | 135 ms
101,760 KB |
testcase_51 | AC | 160 ms
107,392 KB |
testcase_52 | AC | 148 ms
105,472 KB |
testcase_53 | AC | 220 ms
124,704 KB |
testcase_54 | AC | 215 ms
125,008 KB |
testcase_55 | AC | 215 ms
124,952 KB |
testcase_56 | AC | 212 ms
124,948 KB |
testcase_57 | AC | 157 ms
110,464 KB |
testcase_58 | AC | 173 ms
114,432 KB |
testcase_59 | AC | 176 ms
114,816 KB |
testcase_60 | AC | 161 ms
110,044 KB |
testcase_61 | AC | 151 ms
108,800 KB |
testcase_62 | AC | 188 ms
120,320 KB |
testcase_63 | AC | 43 ms
54,400 KB |
testcase_64 | AC | 44 ms
54,528 KB |
testcase_65 | AC | 46 ms
54,528 KB |
testcase_66 | AC | 43 ms
54,272 KB |
testcase_67 | AC | 44 ms
54,272 KB |
testcase_68 | AC | 48 ms
54,272 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) for i in range(n): p1[a[i][1]] = i+1 p2[a[i][1]] = i+1 for i in range(2, n): x,xi = a[i-2] y,yi = a[i-1] z,zi = a[i] print(x,y,z) if x+2 == y+1 == z: p1[xi], p1[yi], p1[zi] = p1[yi], p1[zi], p1[xi] p2[xi], p2[yi], p2[zi] = p2[zi], p2[xi], p2[yi] ok = 1 break if ok: print(*p1) print(*p2) else: print(-1)