結果
問題 | No.203 ゴールデン・ウィーク(1) |
ユーザー | McGregorsh |
提出日時 | 2023-03-14 22:00:09 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 152 ms / 1,000 ms |
コード長 | 1,629 bytes |
コンパイル時間 | 166 ms |
コンパイル使用メモリ | 81,844 KB |
実行使用メモリ | 88,352 KB |
最終ジャッジ日時 | 2023-10-18 12:05:11 |
合計ジャッジ時間 | 6,029 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 150 ms
88,348 KB |
testcase_01 | AC | 150 ms
88,348 KB |
testcase_02 | AC | 152 ms
88,344 KB |
testcase_03 | AC | 151 ms
88,336 KB |
testcase_04 | AC | 151 ms
88,348 KB |
testcase_05 | AC | 149 ms
88,348 KB |
testcase_06 | AC | 147 ms
88,352 KB |
testcase_07 | AC | 148 ms
88,344 KB |
testcase_08 | AC | 149 ms
88,340 KB |
testcase_09 | AC | 150 ms
88,348 KB |
testcase_10 | AC | 149 ms
88,344 KB |
testcase_11 | AC | 149 ms
88,332 KB |
testcase_12 | AC | 150 ms
88,344 KB |
testcase_13 | AC | 149 ms
88,352 KB |
testcase_14 | AC | 150 ms
88,340 KB |
testcase_15 | AC | 151 ms
88,340 KB |
testcase_16 | AC | 149 ms
88,344 KB |
testcase_17 | AC | 150 ms
88,340 KB |
testcase_18 | AC | 150 ms
88,348 KB |
testcase_19 | AC | 151 ms
88,344 KB |
testcase_20 | AC | 151 ms
88,344 KB |
testcase_21 | AC | 151 ms
88,340 KB |
testcase_22 | AC | 150 ms
88,340 KB |
testcase_23 | AC | 151 ms
88,348 KB |
testcase_24 | AC | 149 ms
88,348 KB |
testcase_25 | AC | 151 ms
88,344 KB |
testcase_26 | AC | 151 ms
88,348 KB |
testcase_27 | AC | 152 ms
88,348 KB |
testcase_28 | AC | 149 ms
88,344 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(): A = input() B = input() C = A + B ans = 0 for i in range(14): cou = 0 for j in range(14): if i + j >= 14: break if C[i+j] == 'o': cou += 1 else: break ans = max(ans, cou) print(ans) if __name__ == '__main__': main()