結果
問題 | No.1439 Let's Compare!!!! |
ユーザー | McGregorsh |
提出日時 | 2023-05-19 22:03:42 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,040 bytes |
コンパイル時間 | 370 ms |
コンパイル使用メモリ | 87,284 KB |
実行使用メモリ | 116,816 KB |
最終ジャッジ日時 | 2023-08-22 23:59:23 |
合計ジャッジ時間 | 14,502 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 238 ms
92,604 KB |
testcase_01 | AC | 238 ms
92,456 KB |
testcase_02 | AC | 230 ms
92,360 KB |
testcase_03 | AC | 233 ms
92,596 KB |
testcase_04 | AC | 234 ms
92,596 KB |
testcase_05 | AC | 231 ms
92,580 KB |
testcase_06 | AC | 232 ms
92,604 KB |
testcase_07 | AC | 289 ms
95,252 KB |
testcase_08 | AC | 321 ms
96,504 KB |
testcase_09 | AC | 285 ms
94,828 KB |
testcase_10 | AC | 845 ms
116,408 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 833 ms
116,020 KB |
testcase_14 | AC | 847 ms
116,180 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | TLE | - |
ソースコード
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 = list(input()) T = list(input()) top = 0 for i in range(N): if S[i] != T[i]: top = i break Q = int(input()) for i in range(Q): c, x, y = s_map() x = int(x) x -= 1 if c == 'S': S[x] = y else: T[x] = y if top > x: if S[x] != T[x]: top = x elif top == x: if S[top] == T[top]: for j in range(top, N): if S[j] != T[j]: top = j break if S[top] == T[top]: print('=') elif S[top] > T[top]: print('>') else: print('<') if __name__ == '__main__': main()