#591720 (C#(csc)) No.1313 N言っちゃダメゲーム (4)

• 問題: No.1313 N言っちゃダメゲーム (4)
• ユーザー: EmKjp
• 提出日時: 2020-12-10 20:56:51
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 36 ms / 2,000 ms
• コード長: 8,561 bytes
• コンパイル時間: 1,075 ms
• コンパイル使用メモリ: 117,720 KB
• 実行使用メモリ: 29,776 KB
• 最終ジャッジ日時: 2024-09-19 20:41:57
• 合計ジャッジ時間: 3,245 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	24 ms; 23,932 KB
testcase_01	AC	25 ms; 24,060 KB
testcase_02	AC	24 ms; 24,064 KB
testcase_03	AC	25 ms; 25,968 KB
testcase_04	AC	25 ms; 25,776 KB
testcase_05	AC	25 ms; 24,056 KB
testcase_06	AC	25 ms; 23,804 KB
testcase_07	AC	23 ms; 23,932 KB
testcase_08	AC	25 ms; 23,988 KB
testcase_09	AC	24 ms; 26,032 KB
testcase_10	AC	24 ms; 23,932 KB
testcase_11	AC	24 ms; 23,800 KB
testcase_12	AC	24 ms; 25,908 KB
testcase_13	AC	32 ms; 23,812 KB
testcase_14	AC	32 ms; 27,860 KB
testcase_15	AC	32 ms; 25,652 KB
testcase_16	AC	33 ms; 25,700 KB
testcase_17	AC	34 ms; 29,776 KB
testcase_18	AC	31 ms; 26,872 KB
testcase_19	AC	31 ms; 24,828 KB
testcase_20	AC	25 ms; 23,960 KB
testcase_21	AC	27 ms; 24,184 KB
testcase_22	AC	26 ms; 24,224 KB
testcase_23	AC	31 ms; 26,500 KB
testcase_24	AC	25 ms; 26,000 KB
testcase_25	AC	32 ms; 24,924 KB
testcase_26	AC	25 ms; 23,676 KB
testcase_27	AC	29 ms; 24,072 KB
testcase_28	AC	36 ms; 25,776 KB
testcase_29	AC	35 ms; 23,604 KB
testcase_30	AC	36 ms; 25,520 KB
testcase_31	AC	36 ms; 27,600 KB
testcase_32	AC	35 ms; 25,556 KB
testcase_33	AC	32 ms; 25,724 KB
testcase_34	AC	33 ms; 25,812 KB
testcase_35	AC	32 ms; 25,780 KB
testcase_36	AC	34 ms; 25,820 KB
testcase_37	AC	35 ms; 27,764 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;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;
using System.Threading;

internal partial class Solver {
    public void Run() {
        var n = ni();
        var k = ni();
        var s = ns();
        // dp[i] = 数字が i のときに先手が勝つ場合は 1, 負ける場合は 0
        // dp[i] = (dp[i+1],...dp[i+k]) に 0 があれば 1 なければ 0
        // つまり
        // dp[i] = 1 - min(dp[i+1],...dp[i+k])
        // 区間の min は segtree、累積和など で効率的に計算できる

        var ng = new bool[n + 1];
        for (int i = 0; i < s.Length; i++) {
            if (s[i] == 'x') ng[i + 1] = true;
        }
        ng[n] = true;

        var dp = new int[n + 1];
        var sum = new int[n + 1];
        for (int i = n; i >= 0; i--) {
            if (ng[i]) {
                dp[i] = 1;
            } else {
                var ss = sum[i + 1];
                if (i + k + 1 < sum.Length) ss -= sum[i + k + 1];
                dp[i] = ss == Math.Min(k, n - i) ? 0 : 1;
            }
            sum[i] = dp[i];
            if (i + 1 < sum.Length) sum[i] += sum[i + 1];
        }
        var ans = new List<int>();
        for (int i = 1; i <= k; i++) {
            if (dp[i] == 0) {
                ans.Add(i);
            }
        }
        if (ans.Count == 0) ans.Add(0);
        cout.WriteLine(ans.JoinToString());
    }
}


public sealed class SegmentTree<TMonoid> {
    public int Count { get; private set; }
    private TMonoid[] _node;
    private readonly TMonoid _identity;
    private readonly Func<TMonoid, TMonoid, TMonoid> _merge;

    public SegmentTree(Func<TMonoid, TMonoid, TMonoid> merge, TMonoid identity) {
        _merge = merge;
        _identity = identity;
    }

    public void Build(IList<TMonoid> array) {
        Build(array.Count, i => array[i]);
    }

    public void Build(int n, Func<int, TMonoid> create) {
        Count = n;

        _node = new TMonoid[2 * Count];

        for (int i = 0; i < n; i++) {
            _node[i + Count] = create(i);
        }

        for (int i = Count - 1; i > 0; i--) {
            _node[i] = _merge(_node[i << 1], _node[i << 1 | 1]);
        }
    }

    public void Set(int index, TMonoid val) {
        int p = index + Count;
        _node[p] = val;
        while (p > 0) {
            p >>= 1;
            _node[p] = _merge(_node[p << 1], _node[p << 1 | 1]);
        }
    }

    public TMonoid Query(int begin, int end) {
        TMonoid lv = _identity, rv = _identity;
        int l = begin + Count;
        int r = end + Count - 1;
        for (; l <= r; l >>= 1, r >>= 1) {
            if ((l & 1) == 1) { lv = _merge(lv, _node[l++]); }
            if ((r & 1) == 0) { rv = _merge(_node[r--], rv); }
        }
        return _merge(lv, rv);
    }

    public TMonoid this[int index] {
        get { return _node[index + Count]; }
        set { Set(index, value); }
    }
};
// PREWRITEN CODE BEGINS FROM HERE

static public class StringExtensions {
    static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
        return string.Join(separator, source);
    }
}

internal partial class Solver : Scanner {
    static readonly int? StackSizeInMebiByte = null; //50;
    public static void StartAndJoin(Action action, int maxStackSize) {
        var thread = new Thread(new ThreadStart(action), maxStackSize);
        thread.Start();
        thread.Join();
    }

    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        if (StackSizeInMebiByte.HasValue) {
            StartAndJoin(() => new Solver(Console.In, Console.Out).Run(), StackSizeInMebiByte.Value * 1024 * 1024);
        } else {
            new Solver(Console.In, Console.Out).Run();
        }
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
    private readonly TextWriter cerr;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }

    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

#if DEBUG
internal static class LinqPadExtension {
    public static string TextDump<T>(this T obj) {
        if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump();
        else return obj.ToString().Dump();
    }
    public static T Dump<T>(this T obj) {
        return LINQPad.Extensions.Dump(obj);
    }
}
#endif

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}