結果
問題 | No.345 最小チワワ問題 |
ユーザー | McGregorsh |
提出日時 | 2023-03-15 00:05:46 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,561 bytes |
コンパイル時間 | 184 ms |
コンパイル使用メモリ | 81,492 KB |
実行使用メモリ | 88,432 KB |
最終ジャッジ日時 | 2023-10-18 12:09:37 |
合計ジャッジ時間 | 6,216 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 146 ms
88,228 KB |
testcase_01 | AC | 145 ms
88,232 KB |
testcase_02 | AC | 153 ms
88,232 KB |
testcase_03 | AC | 148 ms
88,236 KB |
testcase_04 | AC | 146 ms
88,228 KB |
testcase_05 | AC | 147 ms
88,232 KB |
testcase_06 | AC | 147 ms
88,240 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 146 ms
88,424 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 154 ms
88,428 KB |
testcase_15 | AC | 149 ms
88,424 KB |
testcase_16 | AC | 144 ms
88,228 KB |
testcase_17 | AC | 144 ms
88,232 KB |
testcase_18 | AC | 149 ms
88,432 KB |
testcase_19 | AC | 143 ms
88,240 KB |
testcase_20 | AC | 152 ms
88,224 KB |
testcase_21 | WA | - |
testcase_22 | AC | 143 ms
88,228 KB |
testcase_23 | AC | 146 ms
88,228 KB |
testcase_24 | AC | 145 ms
88,232 KB |
testcase_25 | AC | 146 ms
88,232 KB |
testcase_26 | AC | 147 ms
88,236 KB |
testcase_27 | AC | 149 ms
88,228 KB |
testcase_28 | WA | - |
testcase_29 | AC | 146 ms
88,224 KB |
testcase_30 | AC | 145 ms
88,220 KB |
testcase_31 | 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(): S = input() ans = INF for i in range(len(S)-2): for j in range(i+2, len(S)): if S[i] == 'c' and S[j] == 'w': if 'w' in S[i:j]: ans = min(ans, j-i+1) print(ans) if __name__ == '__main__': main()