結果
問題 | No.204 ゴールデン・ウィーク(2) |
ユーザー | McGregorsh |
提出日時 | 2023-05-15 00:37:24 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,092 bytes |
コンパイル時間 | 426 ms |
コンパイル使用メモリ | 87,000 KB |
実行使用メモリ | 92,352 KB |
最終ジャッジ日時 | 2023-08-20 09:04:50 |
合計ジャッジ時間 | 14,120 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 233 ms
92,248 KB |
testcase_05 | AC | 234 ms
92,136 KB |
testcase_06 | AC | 234 ms
92,056 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 235 ms
92,096 KB |
testcase_30 | AC | 233 ms
92,232 KB |
testcase_31 | AC | 234 ms
92,016 KB |
testcase_32 | AC | 232 ms
92,096 KB |
testcase_33 | AC | 236 ms
92,352 KB |
testcase_34 | AC | 235 ms
92,244 KB |
testcase_35 | AC | 235 ms
92,348 KB |
testcase_36 | AC | 237 ms
92,232 KB |
testcase_37 | AC | 234 ms
92,024 KB |
testcase_38 | AC | 237 ms
92,256 KB |
testcase_39 | AC | 237 ms
92,088 KB |
testcase_40 | AC | 236 ms
92,120 KB |
testcase_41 | WA | - |
testcase_42 | AC | 234 ms
92,264 KB |
testcase_43 | AC | 234 ms
92,228 KB |
testcase_44 | AC | 231 ms
92,100 KB |
testcase_45 | AC | 232 ms
92,128 KB |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
ソースコード
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 = C1 + C2 score = 0 for i in range(14): ans = 0 juge = False cou = 0 p = INF for j in range(14): if i + j < 14: if juge: if C[i+j] == 'o': ans += 1 else: cou += 1 ans += 1 else: if C[i+j] == 'o': ans += 1 else: juge = True cou += 1 ans += 1 if cou > D: p = i + j break if p != INF: ans -= 1 cou -= 1 score = max(score, ans + (D - cou)) print(score) if __name__ == '__main__': main()