#609351 (C++14) No.1005 BOT対策

• 問題: No.1005 BOT対策
• ユーザー: ut0s
• 提出日時: 2021-01-23 00:46:43
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 9 ms / 2,000 ms
• コード長: 2,098 bytes
• コンパイル時間: 1,475 ms
• コンパイル使用メモリ: 163,376 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2025-01-01 20:13:29
• 合計ジャッジ時間: 2,030 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 28

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
/**
  @file 1005.cpp
  @title  No.1005 BOT対策 - yukicoder
  @url https://yukicoder.me/problems/no/1005
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long uLL;
typedef unsigned int uint;
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((int)(x).size())
#define REPI(i, a, b) for (LL i = LL(a); i < LL(b); ++i)
#define REP(i, N) for (LL i = LL(0); i < LL(N); ++i)
#define REPS(i, N) for (int i = 1; i <= (int)(N); i++)
#define RREP(i, N) for (int i = ((int)(N)-1); i >= 0; i--)
#define RREPS(i, N) for (int i = ((int)(N)); i > 0; i--)
#define chmax(ret, x) ret = max(ret, x)
#define chmin(ret, x) ret = min(ret, x)
#define FILL(x, e) memset(x, e, sizeof(x))
#define ZEROS(x) fill(x, 0)
#define SORT(x) sort(ALL(x))
#define RSORT(x) sort(RALL(x))
#define UNIQ(x) x.erase(unique(ALL(x)), x.end())
#define BIT(n) (1LL << (n))
#define OUT(x) cout << (x) << "\n"
#define DEBUG(x) cerr << #x << " : " << x << "\n"
#define DEBUG2(x, y) cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
const int MOD = 1e9 + 7;
void iostream_init() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.setf(ios::fixed);
  cout.precision(12);
  // cout.fill('0');
  // cout.width(3);
}
int main() {
  ::iostream_init();
  string S, T;
  cin >> S;
  cin >> T;
  int ans = 0;
  std::string::size_type pos = S.find(T);
  if (pos == std::string::npos) {
    OUT("0");
  } else if (SZ(T) == 1) {
    OUT("-1");
  } else {
    while (pos != std::string::npos) {
      string test;
      for (uint i = T.length() - 1; i != 0; i--) {
        // reset
        test = S;
        test.insert(pos + i, ".");
        if (test.substr(0, pos + T.length() + 1).find(T) == std::string::npos) {
          S = test;
          ans++;
          break;
        }
      }
      pos = S.find(T);
      // pos = S.find(T, pos + 1);
    }
    OUT(ans);
    // OUT(S);
  }
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX