結果

問題 No.9 モンスターのレベル上げ
ユーザー くれちーくれちー
提出日時 2017-08-12 20:10:37
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 3,576 ms / 5,000 ms
コード長 4,821 bytes
コンパイル時間 2,727 ms
コンパイル使用メモリ 113,720 KB
実行使用メモリ 47,460 KB
最終ジャッジ日時 2023-09-06 05:35:46
合計ジャッジ時間 33,952 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 71 ms
21,820 KB
testcase_01 AC 71 ms
23,884 KB
testcase_02 AC 3,178 ms
40,596 KB
testcase_03 AC 2,480 ms
42,508 KB
testcase_04 AC 1,328 ms
26,408 KB
testcase_05 AC 906 ms
28,404 KB
testcase_06 AC 351 ms
26,216 KB
testcase_07 AC 83 ms
24,124 KB
testcase_08 AC 456 ms
26,396 KB
testcase_09 AC 3,093 ms
42,900 KB
testcase_10 AC 69 ms
21,760 KB
testcase_11 AC 3,104 ms
42,720 KB
testcase_12 AC 3,576 ms
42,760 KB
testcase_13 AC 1,968 ms
42,712 KB
testcase_14 AC 3,089 ms
41,072 KB
testcase_15 AC 2,818 ms
43,388 KB
testcase_16 AC 119 ms
22,120 KB
testcase_17 AC 1,845 ms
43,408 KB
testcase_18 AC 1,552 ms
47,460 KB
testcase_19 AC 101 ms
20,064 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.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Extentions;

class IO
{
    int idx;
    string[] input = In.ReadToEnd().Split(new[] { " ", "\n", "\r" },
        StringSplitOptions.RemoveEmptyEntries);

    T Get<T>(Func<string, T> parser) => parser(input[idx++]);

    public string S => Get(s => s);
    public char C => Get(char.Parse);
    public int I => Get(int.Parse);
    public long L => Get(long.Parse);
    public double F => Get(double.Parse);
    public decimal D => Get(decimal.Parse);
    public BigInteger B => Get(BigInteger.Parse);

    T[] Gets<T>(int n, Func<string, T> parser)
        => input.Skip((idx += n) - n).Take(n).Select(parser).ToArray();

    public string[] Ss(int n) => Gets(n, s => s);
    public char[] Cs(int n) => Gets(n, char.Parse);
    public int[] Is(int n) => Gets(n, int.Parse);
    public long[] Ls(int n) => Gets(n, long.Parse);
    public double[] Fs(int n) => Gets(n, double.Parse);
    public decimal[] Ds(int n) => Gets(n, decimal.Parse);
    public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse);

    public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs));
    public void Write(params object[] xs) => WriteLine(string.Join(" ", xs));
}

class PriorityQueue<T>
{
    List<T> heap;
    int size;
    Comparison<T> compare;

    public PriorityQueue()
        : this(Enumerable.Empty<T>(), Comparer<T>.Default.Compare) { }

    public PriorityQueue(IEnumerable<T> collection)
        : this(collection, Comparer<T>.Default.Compare) { }

    public PriorityQueue(Comparison<T> comparsion)
        : this(Enumerable.Empty<T>(), comparsion) { }
 
    public PriorityQueue(IEnumerable<T> collection, Comparison<T> comparsion)
    {
        var array = collection.ToArray();
        Array.Sort(array, comparsion);
        heap = new List<T>(array);
        size = collection.Count();
        compare = comparsion;
    }

    public int Count => size;

    public bool Any() => size > 0;

    public void Clear() => size = 0;

    public void Enqueue(T item)
    {
        var i = size++;
        while (i > 0)
        {
            var p = (i - 1) >> 1;
            if (compare(heap[p], item) <= 0) break;
            if (i == heap.Count) heap.Add(heap[p]);
            else heap[i] = heap[p];
            i = p;
        }
        if (i == heap.Count) heap.Add(item);
        else heap[i] = item;
    }

    public T Dequeue()
    {
        if (size == 0) throw new InvalidOperationException();
        var r = heap[0];
        var x = heap[--size];
        var i = 0;
        while ((i << 1) + 1 < size)
        {
            var a = (i << 1) + 1;
            var b = (i << 1) + 2;
            if (b < size && compare(heap[b], heap[a]) < 0) a = b;
            if (compare(heap[a], x) >= 0) break;
            heap[i] = heap[a];
            i = a;
        }
        heap[i] = x;
        return r;
    }

    public T Peek()
    {
        if (size == 0) throw new InvalidOperationException();
        return heap[0];
    }
}

struct Pair<T1, T2> : IComparable<Pair<T1, T2>>
    where T1 : IComparable<T1>
    where T2 : IComparable<T2>
{
    public T1 First;
    public T2 Second;

    public Pair(T1 first, T2 second)
    {
        First = first;
        Second = second;
    }

    public int CompareTo(Pair<T1, T2> other)
    {
        var t = First.CompareTo(other.First);
        if (t == 0) t = Second.CompareTo(other.Second);
        return t;
    }
}

static class Pair
{
    public static Pair<T1, T2> Create<T1, T2>(T1 first, T2 second)
        where T1 : IComparable<T1>
        where T2 : IComparable<T2>
        => new Pair<T1, T2>(first, second);
}

static class Extentions
{
}

static class Program
{
    public static void Main()
    {
        var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" };
#if DEBUG
        sw.AutoFlush = true;
#else
        sw.AutoFlush = false;
#endif
        SetOut(sw);
        Solve(new IO());
        Out.Flush();
    }

    static void Solve(IO io)
    {
        var n = io.I;
        var a = io.Is(n);
        var b = io.Is(n);

        var ans = int.MaxValue;

        for (var i = 0; i < n; i++)
        {
            var pq = new PriorityQueue<Pair<int, int>>(
                a.Select(x => Pair.Create(x, 0)));

            for (var j = 0; j < n; j++)
            {
                var ta = pq.Dequeue();
                var tb = b[j < n - i ? j + i : j - (n - i)];
                pq.Enqueue(Pair.Create(ta.First + tb / 2, ta.Second + 1));
            }

            var t = 0;
            while (pq.Any()) t = Max(t, pq.Dequeue().Second);
            ans = Min(ans, t);
        }

        io.Write(ans);
    }
}
0