結果
問題 | No.927 Second Permutation |
ユーザー | McGregorsh |
提出日時 | 2023-05-07 22:35:44 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,655 bytes |
コンパイル時間 | 267 ms |
コンパイル使用メモリ | 82,580 KB |
実行使用メモリ | 97,032 KB |
最終ジャッジ日時 | 2024-05-03 17:53:48 |
合計ジャッジ時間 | 6,581 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 142 ms
89,532 KB |
testcase_01 | AC | 140 ms
89,424 KB |
testcase_02 | AC | 143 ms
89,228 KB |
testcase_03 | AC | 139 ms
89,180 KB |
testcase_04 | AC | 139 ms
89,728 KB |
testcase_05 | AC | 139 ms
89,644 KB |
testcase_06 | AC | 138 ms
89,564 KB |
testcase_07 | WA | - |
testcase_08 | AC | 153 ms
90,692 KB |
testcase_09 | AC | 142 ms
90,048 KB |
testcase_10 | AC | 172 ms
92,436 KB |
testcase_11 | AC | 179 ms
96,104 KB |
testcase_12 | AC | 162 ms
91,280 KB |
testcase_13 | AC | 145 ms
89,844 KB |
testcase_14 | AC | 163 ms
93,312 KB |
testcase_15 | AC | 159 ms
91,248 KB |
testcase_16 | AC | 176 ms
97,032 KB |
testcase_17 | AC | 181 ms
97,024 KB |
testcase_18 | AC | 178 ms
96,648 KB |
testcase_19 | AC | 178 ms
96,940 KB |
testcase_20 | AC | 179 ms
96,768 KB |
testcase_21 | AC | 182 ms
96,784 KB |
testcase_22 | AC | 181 ms
96,660 KB |
testcase_23 | AC | 183 ms
96,948 KB |
testcase_24 | AC | 160 ms
96,512 KB |
testcase_25 | AC | 158 ms
93,568 KB |
testcase_26 | AC | 153 ms
91,952 KB |
testcase_27 | AC | 153 ms
91,084 KB |
testcase_28 | AC | 167 ms
95,440 KB |
testcase_29 | AC | 148 ms
94,156 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(): X = list(input()) XX = deepcopy(X) X.sort(reverse=True) for i in range(len(X)-1, -2, -1): if X[i] != X[i-1]: X[i-1], X[i] = X[i], X[i-1] break if X != XX: if X[0] == '0': print(-1) else: print(''.join(X)) else: print(-1) if __name__ == '__main__': main()