結果
問題 | No.927 Second Permutation |
ユーザー |
|
提出日時 | 2022-03-09 18:49:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 105 ms / 2,000 ms |
コード長 | 3,158 bytes |
コンパイル時間 | 462 ms |
コンパイル使用メモリ | 82,248 KB |
実行使用メモリ | 81,632 KB |
最終ジャッジ日時 | 2024-09-13 18:46:11 |
合計ジャッジ時間 | 4,156 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
from sys import setrecursionlimit, stdinfrom collections import defaultdict, dequefrom itertools import permutations, combinations, productfrom functools import lru_cachefrom random import sample, choice, randint, randomfrom bisect import bisect_left, bisect_rightfrom heapq import heappush, heappopfrom math import factorial, expfrom copy import copy, deepcopyfrom time import timesetrecursionlimit(1 << 20)readline = stdin.readline# @lru_cache(maxsize = None)INF = 10 ** 18MOD = 998244353# MOD = 1000000007DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]ALP = 26''' Input '''def I(): return int(readline())def ST(): return readline()[:-1]def LI(): return list(map(int, readline().split()))def LII(): return list(map(lambda x: int(x) - 1, readline().split()))def SPI(): return map(int, readline().split())def SPII(): return map(lambda x: int(x) - 1, readline().split())def FIE(x): return [readline()[:-1] for _ in [0] * x]def NODE(N, edge):node = [[] for _ in [0] * N]for _ in [0] * edge:a, b = map(int, input().split())node[a - 1].append(b - 1)node[b - 1].append(a - 1)return nodedef NODE_W(N, edge):node = [[] for _ in [0] * N]for _ in [0] * edge:a, b, c = map(int, input().split())node[a - 1].append((b - 1, c))node[b - 1].append((a - 1, c))return node''' Array '''def cmin(dp, i, x):if x < dp[i]: dp[i] = xdef cmax(dp, i, x):if x > dp[i]: dp[i] = x''' Sorted Array '''# x <= A[i] (minimum i meeting the requirement)def binary(sortedA, x): return bisect_left(sortedA, x)# x < A[i] (minimum i meeting the requirement)def binary2(sortedA, x): return bisect_right(sortedA, x + 1)# number of x in Adef quantity(sortedA, x): return bisect_right(sortedA, x) - bisect_left(sortedA, x)''' Alphabet '''def id_a(s): return ord(s) - ord('a')def id_A(s): return ord(s) - ord('A')def st_a(i): return chr(ord('a') + i)def st_A(i): return chr(ord('A') + i)''' Other'''def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]def nynx(y, x, ly = INF, lx = INF): return [(y + dy, x + dx) for dy, dx in DYDX if 0 <= y + dy < ly and 0 <= x + dx < lx]def gen(x, *args):ret = [x] * args[-1]for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]return retdef is_prime(x):if x == 1 or x % 2 == 0: return x == 2f = 3while f * f <= x:if x % f == 0: return Falsef += 2return True''' Output '''def puts(E):for e in E: print(e)def pprint(E):print()for e in E: print(e)def yn(x): print("Yes" if x else "No")def blank(arr): print(" ".join(map(str, arr)))def debug(*args):if DEBUG:for e in args: print(e)DEBUG = False###############################################################################################def sauna():X = ST()if len(set(X)) == 1: return -1if sum(e != '0' for e in X) == 1: return -1X = sorted(list(X))[::-1]for i in range(len(X) - 1)[::-1]:if X[i] != X[i+1]:X[i], X[i+1] = X[i+1], X[i]breakreturn ''.join(X)print(sauna())