結果
問題 | No.2034 Anti Lexicography |
ユーザー | McGregorsh |
提出日時 | 2022-08-12 23:34:45 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 169 ms / 2,000 ms |
コード長 | 1,699 bytes |
コンパイル時間 | 470 ms |
コンパイル使用メモリ | 81,824 KB |
実行使用メモリ | 102,180 KB |
最終ジャッジ日時 | 2023-10-24 11:55:24 |
合計ジャッジ時間 | 4,434 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 139 ms
88,372 KB |
testcase_01 | AC | 139 ms
88,372 KB |
testcase_02 | AC | 136 ms
88,372 KB |
testcase_03 | AC | 136 ms
88,372 KB |
testcase_04 | AC | 136 ms
88,372 KB |
testcase_05 | AC | 164 ms
101,952 KB |
testcase_06 | AC | 166 ms
102,168 KB |
testcase_07 | AC | 165 ms
101,968 KB |
testcase_08 | AC | 169 ms
102,152 KB |
testcase_09 | AC | 165 ms
101,984 KB |
testcase_10 | AC | 164 ms
102,172 KB |
testcase_11 | AC | 164 ms
102,168 KB |
testcase_12 | AC | 165 ms
102,180 KB |
testcase_13 | AC | 140 ms
88,824 KB |
testcase_14 | AC | 138 ms
88,836 KB |
testcase_15 | AC | 141 ms
88,864 KB |
testcase_16 | AC | 145 ms
88,864 KB |
testcase_17 | AC | 146 ms
88,860 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() mae = 'abcdefghijklm' usiro = 'zyxwvutsrqpon' ans = [] for i in range(n): if s[i] in mae: score = mae.index(s[i]) ans.append(usiro[score]) else: score = usiro.index(s[i]) ans.append(mae[score]) print(''.join(ans)) if __name__ == '__main__': main()