結果

問題 No.576 E869120 and Rings
ユーザー 明智重蔵明智重蔵
提出日時 2022-12-31 11:01:24
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
実行時間 -
コード長 7,282 bytes
コンパイル時間 862 ms
コンパイル使用メモリ 110,976 KB
実行使用メモリ 95,740 KB
最終ジャッジ日時 2024-11-26 09:25:40
合計ジャッジ時間 57,324 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 TLE -
testcase_01 TLE -
testcase_02 TLE -
testcase_03 TLE -
testcase_04 TLE -
testcase_05 TLE -
testcase_06 TLE -
testcase_07 TLE -
testcase_08 TLE -
testcase_09 TLE -
testcase_10 TLE -
testcase_11 TLE -
testcase_12 TLE -
testcase_13 TLE -
testcase_14 TLE -
testcase_15 AC 33 ms
29,824 KB
testcase_16 TLE -
testcase_17 TLE -
testcase_18 TLE -
testcase_19 TLE -
testcase_20 TLE -
testcase_21 TLE -
testcase_22 AC 29 ms
19,968 KB
testcase_23 AC 28 ms
19,840 KB
testcase_24 AC 27 ms
19,840 KB
testcase_25 AC 26 ms
18,944 KB
testcase_26 AC 29 ms
19,840 KB
testcase_27 AC 28 ms
19,840 KB
testcase_28 AC 28 ms
19,968 KB
testcase_29 AC 28 ms
95,740 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static string InputPattern = "InputX";

    static List<string> GetInputList()
    {
        var WillReturn = new List<string>();

        if (InputPattern == "Input1") {
            WillReturn.Add("8 4");
            WillReturn.Add("11101110");
            //0.857142857142857
        }
        else if (InputPattern == "Input2") {
            WillReturn.Add("8 4");
            WillReturn.Add("11011001");
            //0.833333333333333
        }
        else if (InputPattern == "Input3") {
            WillReturn.Add("10 4");
            WillReturn.Add("1001001001");
            //0.6
        }
        else if (InputPattern == "Input4") {
            return System.IO.File.ReadAllLines(@"D:\CSharp\TestConsole\test_in\in01.txt").ToList();
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    static int mN;
    static int mK;

    static double[] mAArr;

    static void Main()
    {
        //var sw = System.Diagnostics.Stopwatch.StartNew();
        List<string> InputList = GetInputList();
        int[] wkArr = InputList[0].Split(' ').Select(pX => int.Parse(pX)).ToArray();
        mN = wkArr[0];
        mK = wkArr[1];

        string AStr = InputList[1];
        mAArr = new double[mN];
        bool HasZero = false;
        for (int I = 0; I <= AStr.Length - 1; I++) {
            if (AStr[I] == '0') {
                mAArr[I] = 0D;
                HasZero = true;
            }
            if (AStr[I] == '1') mAArr[I] = 1D;
        }

        // 全て1の場合
        if (HasZero == false) {
            Console.WriteLine(1);
            return;
        }

        // 答えで二分探索
        double L = 0;
        double R = 1;

        while (L + 0.0000001 < R) {
            double Mid = (L + R) / 2;

            bool Result = CanAchieve(Mid);
            if (Result) {
                L = Mid;
            }
            else {
                R = Mid;
            }
        }
        Console.WriteLine(R);
        //Console.WriteLine(sw.Elapsed);
    }

    // NeedAVGを達成できるかを判定
    static bool CanAchieve(double pNeedAVG)
    {
        double[] CompareArr = new double[mN * 2];
        for (int I = 1; I <= 2; I++) {
            for (int J = 0; J <= mAArr.GetUpperBound(0); J++) {
                CompareArr[J + mN * (I - 1)] = mAArr[J] - pNeedAVG;
            }
        }
        int UB = CompareArr.GetUpperBound(0);

        double[] RunSumArr = new double[UB + 1];

        // 累積和を設定する
        for (int I = 0; I <= UB; I++) {
            RunSumArr[I] = CompareArr[I];
            if (0 < I) {
                RunSumArr[I] += RunSumArr[I - 1];
            }
        }

        var InsDeque = new Deque<int>();

        // 終端を全探索
        bool FirstFlag = true;
        int PrevRangeEnd = -1;

        for (int I = 0; I <= UB; I++) {
            // 長さKの区間を取れなければcontinue
            if (I - mK + 1 < 0) continue;

            // 始点候補のSta
            int RangeSta = I - mN + 1;
            RangeSta = Math.Max(0, RangeSta);

            // 始点候補のEnd
            int RangeEnd = I - mK + 1;

            if (FirstFlag) {
                FirstFlag = false;
            }
            else {
                RangeSta = Math.Max(RangeSta, PrevRangeEnd + 1);
            }

            // 引退処理
            while (InsDeque.Count > 0) {
                int FrontInd = InsDeque[0];
                if (RangeSta <= FrontInd && FrontInd <= RangeEnd == false) {
                    InsDeque.PopFront();
                    continue;
                }
                break;
            }

            for (int J = RangeSta; J <= RangeEnd; J++) {
                // 押し出し処理
                while (InsDeque.Count > 0) {
                    int LastInd = InsDeque[InsDeque.Count - 1];
                    if (RunSumArr[LastInd] - CompareArr[LastInd] > RunSumArr[J] - CompareArr[J]) {
                        InsDeque.PopBack();
                        continue;
                    }
                    break;
                }
                // 追加処理
                InsDeque.PushBack(J);
            }
            PrevRangeEnd = RangeEnd;

            // 最小値
            double MinVal = RunSumArr[InsDeque[0]] - CompareArr[InsDeque[0]];
            if (RunSumArr[I] - MinVal >= 0) return true;
        }
        return false;
    }
}

#region Deque
internal class Deque<T>
{
    T[] buf;
    int offset, count, capacity;

    internal int Count { get { return count; } }

    internal Deque(int cap) { buf = new T[capacity = cap]; }

    internal Deque() { buf = new T[capacity = 16]; }

    internal T this[int index]
    {
        get { return buf[GetIndex(index)]; }
        set { buf[GetIndex(index)] = value; }
    }

    private int GetIndex(int index)
    {
        if (index >= capacity)
            throw new IndexOutOfRangeException("out of range");
        int ret = index + offset;
        if (ret >= capacity)
            ret -= capacity;
        return ret;
    }

    internal void PushFront(T item)
    {
        if (count == capacity) Extend();
        if (--offset < 0) offset += buf.Length;
        buf[offset] = item;
        count++;
    }

    internal T PopFront()
    {
        if (count == 0)
            throw new InvalidOperationException("collection is empty");
        count--;
        T ret = buf[offset++];
        if (offset >= capacity) offset -= capacity;
        return ret;
    }

    internal void PushBack(T item)
    {
        if (count == capacity) Extend();
        int id = count + offset;
        count++;
        if (id >= capacity) id -= capacity;
        buf[id] = item;
    }

    internal T PopBack()
    {
        if (count == 0)
            throw new InvalidOperationException("collection is empty");
        return buf[GetIndex(--count)];
    }

    internal void Insert(int index, T item)
    {
        if (index > count) throw new IndexOutOfRangeException();
        this.PushFront(item);
        for (int i = 0; i < index; i++)
            this[i] = this[i + 1];
        this[index] = item;
    }

    internal T RemoveAt(int index)
    {
        if (index < 0 || index >= count) throw new IndexOutOfRangeException();
        T ret = this[index];
        for (int i = index; i > 0; i--)
            this[i] = this[i - 1];
        this.PopFront();
        return ret;
    }

    private void Extend()
    {
        T[] newBuffer = new T[capacity << 1];
        if (offset > capacity - count) {
            int len = buf.Length - offset;
            Array.Copy(buf, offset, newBuffer, 0, len);
            Array.Copy(buf, 0, newBuffer, len, count - len);
        }
        else Array.Copy(buf, offset, newBuffer, 0, count);
        buf = newBuffer;
        offset = 0;
        capacity <<= 1;
    }

    internal T[] Items//デバッグ時に中身を調べるためのプロパティ
    {
        get
        {
            T[] a = new T[count];
            for (int i = 0; i < count; i++)
                a[i] = this[i];
            return a;
        }
    }
}
#endregion
0