結果
問題 | No.204 ゴールデン・ウィーク(2) |
ユーザー | McGregorsh |
提出日時 | 2023-05-15 21:31:09 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 255 ms / 1,000 ms |
コード長 | 1,976 bytes |
コンパイル時間 | 365 ms |
コンパイル使用メモリ | 87,076 KB |
実行使用メモリ | 92,480 KB |
最終ジャッジ日時 | 2023-08-20 20:52:40 |
合計ジャッジ時間 | 14,694 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 243 ms
92,112 KB |
testcase_01 | AC | 251 ms
92,148 KB |
testcase_02 | AC | 252 ms
92,380 KB |
testcase_03 | AC | 251 ms
92,376 KB |
testcase_04 | AC | 251 ms
92,104 KB |
testcase_05 | AC | 249 ms
92,388 KB |
testcase_06 | AC | 246 ms
92,372 KB |
testcase_07 | AC | 249 ms
92,372 KB |
testcase_08 | AC | 253 ms
92,472 KB |
testcase_09 | AC | 246 ms
92,160 KB |
testcase_10 | AC | 253 ms
92,364 KB |
testcase_11 | AC | 254 ms
92,480 KB |
testcase_12 | AC | 249 ms
92,184 KB |
testcase_13 | AC | 244 ms
92,372 KB |
testcase_14 | AC | 247 ms
92,360 KB |
testcase_15 | AC | 249 ms
92,224 KB |
testcase_16 | AC | 248 ms
92,380 KB |
testcase_17 | AC | 254 ms
92,360 KB |
testcase_18 | AC | 251 ms
92,364 KB |
testcase_19 | AC | 254 ms
92,440 KB |
testcase_20 | AC | 254 ms
92,320 KB |
testcase_21 | AC | 255 ms
91,996 KB |
testcase_22 | AC | 252 ms
92,136 KB |
testcase_23 | AC | 248 ms
92,156 KB |
testcase_24 | AC | 244 ms
92,404 KB |
testcase_25 | AC | 248 ms
92,264 KB |
testcase_26 | AC | 252 ms
92,364 KB |
testcase_27 | AC | 247 ms
91,568 KB |
testcase_28 | AC | 252 ms
92,472 KB |
testcase_29 | AC | 252 ms
92,236 KB |
testcase_30 | AC | 250 ms
92,368 KB |
testcase_31 | AC | 247 ms
92,264 KB |
testcase_32 | AC | 251 ms
92,336 KB |
testcase_33 | AC | 250 ms
92,260 KB |
testcase_34 | AC | 250 ms
92,384 KB |
testcase_35 | AC | 245 ms
92,016 KB |
testcase_36 | AC | 250 ms
92,312 KB |
testcase_37 | AC | 251 ms
92,208 KB |
testcase_38 | AC | 249 ms
92,472 KB |
testcase_39 | AC | 248 ms
92,340 KB |
testcase_40 | AC | 245 ms
92,092 KB |
testcase_41 | AC | 247 ms
92,044 KB |
testcase_42 | AC | 247 ms
92,220 KB |
testcase_43 | AC | 249 ms
92,388 KB |
testcase_44 | AC | 250 ms
92,460 KB |
testcase_45 | AC | 251 ms
92,336 KB |
testcase_46 | AC | 250 ms
92,112 KB |
testcase_47 | AC | 250 ms
92,324 KB |
testcase_48 | AC | 250 ms
92,384 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(): D = int(input()) C1 = input() C2 = input() C = ('x' * 20) + C1 + C2 + ('x' * 20) score = 0 for i in range(54): juge = False cou = 0 cost = 0 for j in range(i, 54): if juge: if C[j] == 'x': cost += 1 if j - 1 >= 0: if C[j-1] == 'o': break else: if C[j] == 'x': cost += 1 juge = True if cost <= D: cou += 1 else: break #print(i, score, cost) score = max(score, cou) print(score) if __name__ == '__main__': main()