結果

問題 No.1005 BOT対策
ユーザー cozy_saunacozy_sauna
提出日時 2022-03-09 20:14:49
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,073 bytes
コンパイル時間 187 ms
コンパイル使用メモリ 82,040 KB
実行使用メモリ 67,332 KB
最終ジャッジ日時 2024-09-13 20:21:20
合計ジャッジ時間 3,235 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
65,156 KB
testcase_01 AC 57 ms
65,636 KB
testcase_02 AC 58 ms
64,848 KB
testcase_03 AC 58 ms
65,472 KB
testcase_04 WA -
testcase_05 AC 57 ms
65,448 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 59 ms
64,540 KB
testcase_09 AC 58 ms
65,340 KB
testcase_10 AC 60 ms
65,296 KB
testcase_11 AC 59 ms
65,124 KB
testcase_12 WA -
testcase_13 AC 59 ms
65,936 KB
testcase_14 AC 59 ms
65,972 KB
testcase_15 AC 60 ms
66,776 KB
testcase_16 AC 58 ms
65,036 KB
testcase_17 AC 58 ms
64,896 KB
testcase_18 AC 59 ms
66,204 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 59 ms
65,028 KB
testcase_22 AC 59 ms
64,696 KB
testcase_23 AC 59 ms
64,740 KB
testcase_24 AC 59 ms
65,500 KB
testcase_25 AC 59 ms
65,116 KB
testcase_26 AC 59 ms
67,140 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 59 ms
64,716 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from sys import setrecursionlimit, stdin
from collections import defaultdict, deque
from itertools import permutations, combinations, product
from functools import lru_cache
from random import sample, choice, randint, random
from bisect import bisect_left, bisect_right
from heapq import heappush, heappop
from math import factorial, exp
from copy import copy, deepcopy
from time import time

setrecursionlimit(1 << 20)
readline = stdin.readline
# @lru_cache(maxsize = None)
INF = 10 ** 18
MOD = 998244353
# MOD = 1000000007
DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]
ALP = 26
''' Input '''
def I(): return int(readline())
def ST(): return readline()[:-1]
def LI(): return list(map(int, readline().split()))
def LII(): return list(map(lambda x: int(x) - 1, readline().split()))
def SPI(): return map(int, readline().split())
def SPII(): return map(lambda x: int(x) - 1, readline().split())
def FIE(x): return [readline()[:-1] for _ in [0] * x]
def NODE(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b = map(int, input().split())
        node[a - 1].append(b - 1)
        node[b - 1].append(a - 1)
    return node 

def NODE_W(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b, c = map(int, input().split())
        node[a - 1].append((b - 1, c))
        node[b - 1].append((a - 1, c))
    return node

''' Array '''
def cmin(dp, i, x):
    if x < dp[i]: dp[i] = x
def cmax(dp, i, x):
    if x > dp[i]: dp[i] = x

''' Sorted Array '''
# x <= A[i] (minimum i meeting the requirement)
def binary(sortedA, x): return bisect_left(sortedA, x)
# x < A[i] (minimum i meeting the requirement)
def binary2(sortedA, x): return bisect_right(sortedA, x + 1)
# number of x in A
def quantity(sortedA, x): return bisect_right(sortedA, x) - bisect_left(sortedA, x)

''' Alphabet '''
def id_a(s): return ord(s) - ord('a')
def id_A(s): return ord(s) - ord('A')
def st_a(i): return chr(ord('a') + i)
def st_A(i): return chr(ord('A') + i)

''' Other'''
def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]
def nynx(y, x, ly = INF, lx = INF): return [(y + dy, x + dx) for dy, dx in DYDX if 0 <= y + dy < ly and 0 <= x + dx < lx]
def gen(x, *args):
    ret = [x] * args[-1]
    for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]
    return ret
def is_prime(x):
    if x == 1 or x % 2 == 0: return x == 2
    f = 3
    while f * f <= x:
        if x % f == 0: return False 
        f += 2
    return True 

''' Output '''
def puts(E):
    for e in E: print(e)
def pprint(E): 
    print()
    for e in E: print(e)
def yn(x): print("Yes" if x else "No")
def blank(arr): print(" ".join(map(str, arr)))
def debug(*args):
    if DEBUG:
        for e in args: print(e)
DEBUG = False
###############################################################################################

S = ST()
N = len(S)
T = ST()
K = len(T)

A = []
for i in range(N - K + 1):
    if T == S[i:i + K]: A.append((i, i + K))

now = -1
ans = 0
for L, R in A:
    if L < now: continue
    ans += 1
    now = R 

print(ans)
0