結果

問題 No.9 モンスターのレベル上げ
ユーザー くれちーくれちー
提出日時 2017-07-19 09:25:40
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 3,850 ms / 5,000 ms
コード長 4,605 bytes
コンパイル時間 1,139 ms
コンパイル使用メモリ 114,896 KB
実行使用メモリ 53,552 KB
最終ジャッジ日時 2024-06-24 00:14:09
合計ジャッジ時間 31,423 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
25,188 KB
testcase_01 AC 36 ms
23,216 KB
testcase_02 AC 3,017 ms
53,552 KB
testcase_03 AC 2,365 ms
51,656 KB
testcase_04 AC 1,253 ms
43,396 KB
testcase_05 AC 846 ms
39,300 KB
testcase_06 AC 304 ms
29,900 KB
testcase_07 AC 45 ms
25,792 KB
testcase_08 AC 408 ms
34,324 KB
testcase_09 AC 2,929 ms
53,304 KB
testcase_10 AC 36 ms
25,524 KB
testcase_11 AC 3,391 ms
51,728 KB
testcase_12 AC 3,850 ms
51,628 KB
testcase_13 AC 1,810 ms
51,492 KB
testcase_14 AC 2,935 ms
53,436 KB
testcase_15 AC 2,682 ms
53,424 KB
testcase_16 AC 83 ms
26,156 KB
testcase_17 AC 1,726 ms
50,452 KB
testcase_18 AC 1,454 ms
52,640 KB
testcase_19 AC 65 ms
27,872 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;
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;

    public IO(TextReader reader)
    {
        input = reader.ReadToEnd().Split(new[] { " ", Environment.NewLine },
            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));
}

#region ref. http://qiita.com/Camypaper/items/de6d576fe5513743a50e
class PriorityQueue<T>
{
    private readonly List<T> heap;
    private readonly Comparison<T> compare;
    private int size;
    public PriorityQueue() : this(Comparer<T>.Default) { }
    public PriorityQueue(IComparer<T> comparer) : this(16, comparer.Compare) { }
    public PriorityQueue(Comparison<T> comparison) : this(16, comparison) { }
    public PriorityQueue(int capacity, Comparison<T> comparison)
    {
        this.heap = new List<T>(capacity);
        this.compare = comparison;
    }
    public void Enqueue(T item)
    {
        this.heap.Add(item);
        var i = size++;
        while (i > 0)
        {
            var p = (i - 1) >> 1;
            if (compare(this.heap[p], item) <= 0)
                break;
            this.heap[i] = heap[p];
            i = p;
        }
        this.heap[i] = item;

    }
    public T Dequeue()
    {
        var ret = this.heap[0];
        var x = this.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;
        heap.RemoveAt(size);
        return ret;
    }
    public T Peek() { return heap[0]; }
    public int Count { get { return size; } }
    public bool Any() { return size > 0; }
}
#endregion

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

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

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

static class Extentions
{
    public static void ForEach<T>(this IEnumerable<T> seq, Action<T> act)
    {
        foreach (var item in seq) act(item);
    }
}

static class Program
{
    public static void Main()
    {
#if !DEBUG
        SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
#endif
        Solve(new IO(In));
        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 => new Pair<int, int>(x, 0)).ForEach(pq.Enqueue);

            for (var j = 0; j < n; j++)
            {
                var ta = pq.Dequeue();
                var tb = b[j < n - i ? j + i : j - (n - i)];
                pq.Enqueue(new Pair<int, int>(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