結果
問題 | No.2030 Googol Strings |
ユーザー | McGregorsh |
提出日時 | 2022-08-05 22:23:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 385 ms / 2,000 ms |
コード長 | 2,047 bytes |
コンパイル時間 | 281 ms |
コンパイル使用メモリ | 86,808 KB |
実行使用メモリ | 97,796 KB |
最終ジャッジ日時 | 2023-10-13 23:38:00 |
合計ジャッジ時間 | 7,092 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 334 ms
94,628 KB |
testcase_01 | AC | 255 ms
92,384 KB |
testcase_02 | AC | 233 ms
92,260 KB |
testcase_03 | AC | 220 ms
92,316 KB |
testcase_04 | AC | 297 ms
94,336 KB |
testcase_05 | AC | 241 ms
92,956 KB |
testcase_06 | AC | 251 ms
96,448 KB |
testcase_07 | AC | 273 ms
97,796 KB |
testcase_08 | AC | 276 ms
97,736 KB |
testcase_09 | AC | 287 ms
92,812 KB |
testcase_10 | AC | 289 ms
92,928 KB |
testcase_11 | AC | 312 ms
92,992 KB |
testcase_12 | AC | 385 ms
94,172 KB |
testcase_13 | AC | 363 ms
94,152 KB |
testcase_14 | AC | 262 ms
92,676 KB |
testcase_15 | AC | 317 ms
93,284 KB |
testcase_16 | AC | 274 ms
93,672 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 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()) for i in range(n): x = input() y = input() len_x = len(x) len_y = len(y) nagasa = max(len_x, len_y) * 2 now = 0 pointx = 0 pointy = 0 juge = False while now < nagasa: if x[pointx] < y[pointy]: print('Y') juge = True break if x[pointx] > y[pointy]: print('X') juge = True break now += 1 pointx += 1 pointy += 1 pointx %= len_x pointy %= len_y if juge == False: if len_x > len_y: print('X') else: print('Y') if __name__ == '__main__': main()