#437358 (C#(csc)) No.1005 BOT対策

• 問題: No.1005 BOT対策
• ユーザー: eSeF
• 提出日時: 2020-03-03 13:26:35
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 25 ms / 2,000 ms
• コード長: 6,883 bytes
• コンパイル時間: 1,765 ms
• コンパイル使用メモリ: 120,348 KB
• 実行使用メモリ: 25,832 KB
• 最終ジャッジ日時: 2024-10-14 10:20:45
• 合計ジャッジ時間: 3,443 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	24 ms; 23,532 KB
testcase_01	AC	24 ms; 23,404 KB
testcase_02	AC	24 ms; 23,272 KB
testcase_03	AC	24 ms; 23,528 KB
testcase_04	AC	24 ms; 23,600 KB
testcase_05	AC	25 ms; 25,832 KB
testcase_06	AC	25 ms; 24,044 KB
testcase_07	AC	24 ms; 25,684 KB
testcase_08	AC	24 ms; 25,676 KB
testcase_09	AC	24 ms; 23,400 KB
testcase_10	AC	25 ms; 25,572 KB
testcase_11	AC	24 ms; 23,524 KB
testcase_12	AC	24 ms; 25,552 KB
testcase_13	AC	24 ms; 23,852 KB
testcase_14	AC	24 ms; 25,832 KB
testcase_15	AC	25 ms; 25,820 KB
testcase_16	AC	25 ms; 25,444 KB
testcase_17	AC	25 ms; 25,564 KB
testcase_18	AC	24 ms; 23,600 KB
testcase_19	AC	24 ms; 25,680 KB
testcase_20	AC	24 ms; 23,656 KB
testcase_21	AC	24 ms; 21,428 KB
testcase_22	AC	24 ms; 23,656 KB
testcase_23	AC	24 ms; 23,724 KB
testcase_24	AC	24 ms; 23,536 KB
testcase_25	AC	25 ms; 25,428 KB
testcase_26	AC	24 ms; 25,552 KB
testcase_27	AC	24 ms; 25,444 KB
testcase_28	AC	25 ms; 25,700 KB
testcase_29	AC	23 ms; 23,656 KB

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using static System.Math;
using static System.Array;
using static AtCoder.Tool;
using static AtCoder.CalcL;
namespace AtCoder
{
    class AC
    {
        const int MOD = 1000000007;
        //const int MOD = 998244353;
        const int INF = int.MaxValue / 2;
        const long SINF = long.MaxValue / 2;
        const double EPS = 1e-8;
        static readonly int[] dI = { 0, 1, 0, -1 };
        static readonly int[] dJ = { 1, 0, -1, 0 };
        //static List<List<int>> G = new List<List<int>>();
        //List<List<Edge>> G = new List<List<Edge>>();
        //static List<Edge> E = new List<Edge>();
        static void Main(string[] args)
        {
            //var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            //Console.SetOut(sw);
            var cin = new Scanner();

            var S = Console.ReadLine();
            var T = Console.ReadLine();
            int L = T.Length;
            if (L == 1)
            {
                Console.WriteLine(S.Contains(T[0]) ? -1 : 0);
                return;
            }
            var z = Z_algorithm(T + S);
            int ans = 0;
            for(var i = L; i + L - 1 < S.Length + L; i++)
            {
                if (z[i] >= L) { ans++;i += L - 2; }
            }
            Console.WriteLine(ans);

            //Console.Out.Flush();
        }
        static int[] Z_algorithm(string S)
        {
            int L = S.Length;
            var ret = new int[L];
            int i = 1, j = 0;
            ret[0] = L;
            while (i < L)
            {
                while (i + j < L && (S[i + j] == S[j])) j++;
                ret[i] = j;
                if (j == 0) { i++; continue; }
                int k = 1;
                while (i + k < L && (k + ret[k] < j))
                {
                    ret[i + k] = ret[k];
                    k++;
                }
                i += k;
                j -= k;
            }
            return ret;
        }
        struct Edge
        {
            public int from;

            public int to;
            public long dist;
            public Edge(int t, long c)
            {
                from = -1;
                to = t;
                dist = c;
            }
            public Edge(int f, int t, long c)
            {
                from = f;
                to = t;
                dist = c;
            }

        }
    }
    static class Permutation<T>
    {
        private static void Search(List<T[]> perms, Stack<T> stack, T[] a)
        {
            int N = a.Length;
            if (N == 0)
            {
                perms.Add(stack.Reverse().ToArray());
            }
            else
            {
                var b = new T[N - 1];
                Array.Copy(a, 1, b, 0, N - 1);
                for (int i = 0; i < a.Length; ++i)
                {
                    stack.Push(a[i]);
                    Search(perms, stack, b);
                    if (i < b.Length) { b[i] = a[i]; }
                    stack.Pop();
                }
            }
        }
        public static IEnumerable<T[]> All(IEnumerable<T> src)
        {
            var perms = new List<T[]>();
            Search(perms, new Stack<T>(), src.ToArray());
            return perms;
        }
    }
    public class Scanner
    {
        public int[] ReadSplitInt()
        {
            return ConvertAll(Console.ReadLine().Split(), int.Parse);
        }
        public long[] ReadSplitLong()
        {
            return ConvertAll(Console.ReadLine().Split(), long.Parse);
        }
        public double[] ReadSplit_Double()
        {
            return ConvertAll(Console.ReadLine().Split(), double.Parse);
        }
    }
    public static class Tool
    {
        static public void Initialize<T>(ref T[] array, T initialvalue)
        {
            for (var i = 0; i < array.Length; i++)
            {
                array[i] = initialvalue;
            }
        }
        static public void Swap<T>(ref T a, ref T b)
        {
            T keep = a;
            a = b;
            b = keep;
        }

        static public void Display<T>(T[,] array2d, int n, int m)
        {
            for (var i = 0; i < n; i++)
            {
                for (var j = 0; j < m; j++)
                {
                    Console.Write($"{array2d[i, j]} ");
                }
                Console.WriteLine();
            }
        }

        static public long LPow(int a, int b)
        {
            return (long)Pow(a, b);
        }
    }
    static public class CalcI
    {
        public static int Gcd(int a, int b)
        {
            if (a * b == 0) { return Max(a, b); }
            return a % b == 0 ? b : Gcd(b, a % b);
        }
        public static int Lcm(int a, int b)
        {
            int g = Gcd(a, b);
            return a / g * b;
        }
        public static int Ceil(int n, int div)
        {
            return (n + div - 1) / div;
        }
    }
    static public class CalcL
    {
        public static long Gcd(long a, long b)
        {
            if (a * b == 0) { return Max(a, b); }
            return a % b == 0 ? b : Gcd(b, a % b);
        }
        public static long Lcm(long a, long b)
        {
            long g = Gcd(a, b);
            return a / g * b;
        }
        public static long Ceil(long n, long div)
        {
            return (n + div - 1) / div;
        }
    }
    class Modulo
    {
        private const long M = 1000000007;
        //private const int M = 998244353;
        private readonly long[] m_facs;
        public long Mul(long a, long b)
        {
            return ((a * b) % M);
        }
        public Modulo(long n)
        {
            m_facs = new long[n + 1];
            m_facs[0] = 1;
            for (long i = 1; i <= n; ++i)
            {
                m_facs[i] = Mul(m_facs[i - 1], i);
            }
        }
        public long Fac(long n)
        {
            return m_facs[n];
        }
        public long Pow(long a, long m)
        {
            switch (m)
            {
                case 0:
                    return 1L;
                case 1:
                    return a;
                default:
                    long p1 = Pow(a, m / 2);
                    long p2 = Mul(p1, p1);
                    return ((m % 2) == 0) ? p2 : Mul(p2, a);
            }
        }
        public long Div(long a, long b)
        {
            return Mul(a, Pow(b, M - 2));
        }
        public long Ncr(long n, long r)
        {
            if (n < r) { return 0; }
            if (n == r) { return 1; }
            long res = Fac(n);
            res = Div(res, Fac(r));
            res = Div(res, Fac(n - r));
            return res;
        }
        public Modulo() { }
    }
}