結果
問題 | No.1439 Let's Compare!!!! |
ユーザー | McGregorsh |
提出日時 | 2022-07-18 12:43:13 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,864 bytes |
コンパイル時間 | 899 ms |
コンパイル使用メモリ | 87,068 KB |
実行使用メモリ | 109,972 KB |
最終ジャッジ日時 | 2023-09-13 01:34:57 |
合計ジャッジ時間 | 7,892 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 231 ms
92,452 KB |
testcase_01 | AC | 230 ms
92,452 KB |
testcase_02 | AC | 225 ms
92,272 KB |
testcase_03 | AC | 231 ms
92,404 KB |
testcase_04 | AC | 229 ms
92,520 KB |
testcase_05 | AC | 222 ms
92,256 KB |
testcase_06 | AC | 222 ms
92,196 KB |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | AC | 408 ms
93,812 KB |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
ソースコード
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 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 = list(input()) t = list(input()) q = int(input()) for i in range(q): c, x, y = input().split() x = int(x) y = int(y) x -= 1 if c == 'S': s[x] = str(y) else: t[x] = str(y) #print(s) #print(t) score1 = int(''.join(s)) score2 = int(''.join(t)) if score1 > score2: print('>') elif score1 == score2: print('=') else: print('<') if __name__ == '__main__': main()