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

• 問題: No.1005 BOT対策
• ユーザー: りあん
• 提出日時: 2020-03-06 22:27:28
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 29 ms / 2,000 ms
• コード長: 8,956 bytes
• コンパイル時間: 4,216 ms
• コンパイル使用メモリ: 122,548 KB
• 実行使用メモリ: 27,096 KB
• 最終ジャッジ日時: 2024-10-14 10:47:05
• 合計ジャッジ時間: 3,762 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	27 ms; 22,580 KB
testcase_01	AC	27 ms; 26,720 KB
testcase_02	AC	27 ms; 24,748 KB
testcase_03	AC	27 ms; 22,580 KB
testcase_04	AC	25 ms; 23,932 KB
testcase_05	AC	28 ms; 24,368 KB
testcase_06	AC	25 ms; 24,428 KB
testcase_07	AC	25 ms; 26,360 KB
testcase_08	AC	28 ms; 24,932 KB
testcase_09	AC	28 ms; 27,096 KB
testcase_10	AC	29 ms; 24,416 KB
testcase_11	AC	28 ms; 24,556 KB
testcase_12	AC	28 ms; 26,728 KB
testcase_13	AC	28 ms; 26,848 KB
testcase_14	AC	27 ms; 24,804 KB
testcase_15	AC	28 ms; 24,684 KB
testcase_16	AC	28 ms; 24,924 KB
testcase_17	AC	28 ms; 24,884 KB
testcase_18	AC	27 ms; 24,560 KB
testcase_19	AC	25 ms; 26,364 KB
testcase_20	AC	25 ms; 24,560 KB
testcase_21	AC	28 ms; 24,556 KB
testcase_22	AC	28 ms; 24,564 KB
testcase_23	AC	27 ms; 24,620 KB
testcase_24	AC	27 ms; 25,068 KB
testcase_25	AC	27 ms; 24,552 KB
testcase_26	AC	28 ms; 24,692 KB
testcase_27	AC	24 ms; 22,200 KB
testcase_28	AC	27 ms; 26,464 KB
testcase_29	AC	29 ms; 24,552 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.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 26); // 64 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        var s = sc.Str;
        var t = sc.Str;
        if (t.Length == 1 && s.Contains(t)) {
            Prt(-1);
            return;
        }
        var z = Strings.z_algo(t + s).Skip(t.Length).ToArray();
        int ans = 0;
        for (int i = s.Length - 1; i >= 0 ; i--)
        {
            if (z[i] >= t.Length) {
                ++ans;
                i -= t.Length - 2;
            }
        }
        Prt(ans);


    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(params bool[] conds) {
        foreach (var cond in conds) if (!cond) throw new Exception();
    }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static P[] adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();
    public static P[] adjacents(int i, int j, int h, int w)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]))
                                         .Where(p => inside(p.v1, p.v2, h, w)).ToArray();
    public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);
    public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
    public static void Deconstruct<T>(this IList<T> v, out T a) {
        a = v[0];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b) {
        a = v[0]; b = v[1];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c) {
        a = v[0]; b = v[1]; c = v[2];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c, out T d) {
        a = v[0]; b = v[1]; c = v[2]; d = v[3];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c, out T d, out T e) {
        a = v[0]; b = v[1]; c = v[2]; d = v[3]; e = v[4];
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
    }
    public void Multi<T, U, V>(out T a, out U b, out V c) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
    }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
    }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
    }
}

static class Strings {
    public static int[] z_algo<T>(IList<T> s, Func<T, T, bool> eq) {
        int n = s.Count;
        var res = new int[n];
        res[0] = n;
        int i = 1, j = 0;
        while (i < n) {
            while (i + j < n && eq(s[j], s[i + j])) ++j;
            res[i] = j;
            if (j == 0) {
                ++i;
                continue;
            }
            int k = 1;
            while (i + k < n && k + res[k] < j) {
                res[i + k] = res[k];
                ++k;
            }
            i += k;
            j -= k;
        }
        return res;
    }
    public static int[] z_algo(string s) => z_algo(s.ToCharArray(), (x, y) => x == y);

    public static int[] kmp<T>(IList<T> s, Func<T, T, bool> eq) {
        int n = s.Count;
        var res = new int[n + 1];
        res[0] = -1;
        int j = -1;
        for (int i = 0; i < n; ++i) {
            while (j >= 0 && !eq(s[i], s[j])) j = res[j];
            j++;
            res[i + 1] = j;
        }
        return res;
    }
    public static int[] kmp(string s) => kmp(s.ToCharArray(), (x, y) => x == y);

    public static int[] manacher<T>(IList<T> s, Func<T, T, bool> eq) {
        int n = s.Count;
        int i = 0, j = 0;
        var res = new int[n];
        while (i < n) {
            while (i - j >= 0 && i + j < n && eq(s[i - j], s[i + j])) ++j;
            res[i] = j;
            int k = 1;
            while (i - k >= 0 && i + k < n && k + res[i - k] < j) {
                res[i + k] = res[i - k];
                ++k;
            }
            i += k;
            j -= k;
        }
        return res;
    }
    public static int[] manacher(string s, bool extend = false, char dummy = '$') {
        if (extend) {
            var l = new char[s.Length * 2 - 1];
            for (int i = 0; i < l.Length; i++)
                l[i] = i % 2 == 0 ? s[i / 2] : dummy;

            return manacher(l, (x, y) => x == y);
        }
        else
            return manacher(s.ToCharArray(), (x, y) => x == y);
    }

}