結果
問題 | No.2034 Anti Lexicography |
ユーザー | McGregorsh |
提出日時 | 2022-08-12 23:32:13 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 166 ms / 2,000 ms |
コード長 | 1,750 bytes |
コンパイル時間 | 156 ms |
コンパイル使用メモリ | 81,712 KB |
実行使用メモリ | 102,004 KB |
最終ジャッジ日時 | 2023-10-24 11:52:30 |
合計ジャッジ時間 | 3,878 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 137 ms
88,496 KB |
testcase_01 | AC | 137 ms
88,492 KB |
testcase_02 | AC | 143 ms
88,492 KB |
testcase_03 | AC | 140 ms
88,500 KB |
testcase_04 | AC | 140 ms
88,492 KB |
testcase_05 | AC | 160 ms
101,792 KB |
testcase_06 | AC | 159 ms
101,996 KB |
testcase_07 | AC | 155 ms
101,800 KB |
testcase_08 | AC | 161 ms
102,000 KB |
testcase_09 | AC | 162 ms
101,804 KB |
testcase_10 | AC | 164 ms
102,004 KB |
testcase_11 | AC | 166 ms
101,996 KB |
testcase_12 | AC | 165 ms
102,000 KB |
testcase_13 | AC | 141 ms
88,680 KB |
testcase_14 | AC | 140 ms
88,676 KB |
testcase_15 | AC | 142 ms
88,676 KB |
testcase_16 | AC | 145 ms
88,680 KB |
testcase_17 | AC | 140 ms
88,676 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(): n = int(input()) s = input() ans = {'a':'z', 'b':'y', 'c':'x', 'd':'w', 'e':'v', 'f':'u', 'g':'t', 'h':'s', 'i':'r', 'j':'q', 'k':'p', 'l':'o', 'm':'n', 'n':'m', 'o':'l', 'p':'k', 'q':'j', 'r':'i', 's':'h', 't':'g', 'u':'f', 'v':'e', 'w':'d', 'x':'c', 'y':'b', 'z':'a'} line = [] for i in range(n): line.append(ans[s[i]]) print(''.join(line)) if __name__ == '__main__': main()