結果

問題 No.9 モンスターのレベル上げ
ユーザー eitahoeitaho
提出日時 2015-02-13 06:22:42
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 3,635 ms / 5,000 ms
コード長 4,468 bytes
コンパイル時間 1,167 ms
コンパイル使用メモリ 117,908 KB
実行使用メモリ 53,588 KB
最終ジャッジ日時 2024-06-23 22:29:52
合計ジャッジ時間 29,302 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
25,680 KB
testcase_01 AC 33 ms
25,552 KB
testcase_02 AC 2,822 ms
53,588 KB
testcase_03 AC 2,194 ms
51,304 KB
testcase_04 AC 1,163 ms
43,444 KB
testcase_05 AC 774 ms
41,100 KB
testcase_06 AC 281 ms
29,884 KB
testcase_07 AC 37 ms
25,428 KB
testcase_08 AC 378 ms
40,100 KB
testcase_09 AC 2,720 ms
51,536 KB
testcase_10 AC 32 ms
25,396 KB
testcase_11 AC 3,177 ms
53,316 KB
testcase_12 AC 3,635 ms
51,540 KB
testcase_13 AC 1,640 ms
51,268 KB
testcase_14 AC 2,725 ms
53,444 KB
testcase_15 AC 2,514 ms
53,328 KB
testcase_16 AC 75 ms
27,432 KB
testcase_17 AC 1,631 ms
50,520 KB
testcase_18 AC 1,349 ms
50,296 KB
testcase_19 AC 58 ms
25,816 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.IO;
using System.Linq;
using System.Text;
using System.Diagnostics;
using System.Collections.Generic;
using System.Text.RegularExpressions;
using Enu = System.Linq.Enumerable;

class Program
{
    void Solve()
    {
        int N = reader.Int();
        var A = reader.IntArray(N);
        var B = reader.IntArray(N);
        int ans = int.MaxValue;
        for (int start = 0; start < N; start++)
            ans = Math.Min(ans, Max(start, A, B));
        Console.WriteLine(ans);
    }

    private int Max(int start, int[] A, int[] B)
    {
        var heap = new Heap<Monster>();
        Array.ForEach(A, a => heap.Push(new Monster(a, 0)));

        for (int i = 0; i < A.Length; i++)
        {
            int at = (start + i) % A.Length;
            var who = heap.Pop();
            who.Level += B[at] / 2;
            who.Games++;
            heap.Push(who);
        }
        int max = -1;
        while (heap.Count > 0) max = Math.Max(max, heap.Pop().Games);
        return max;
    }

    struct Monster : IComparable<Monster>
    {
        public int Level;
        public int Games;
        public Monster(int Level, int Games)
        {
            this.Level = Level;
            this.Games = Games;
        }
        public int CompareTo(Monster other)
        {
            if (Level != other.Level) return Level - other.Level;
            return this.Games.CompareTo(other.Games);
        }
    }

    class Heap<T>
    {
        public int Count { get { return size; } private set { size = value; } }
        private int size;
        private readonly int sign;
        private readonly List<T> A = new List<T>();
        private readonly Comparer<T> comp = Comparer<T>.Default;
        public Heap(bool greater = false)
        {
            sign = greater ? 1 : -1;
        }
        public T Peek() { return A[0]; }
        public void Push(T val)
        {
            if (size < A.Count) A[size] = val;
            else A.Add(val);
            Count++;
            int i = Count - 1;
            while (i > 0)
            {
                int parent = (i - 1) / 2;
                if (Math.Sign(comp.Compare(val, A[parent])) == sign)
                {
                    A[i] = A[parent];
                    i = parent;
                }
                else { break; }
            }
            A[i] = val;
        }
        public T Pop()
        {
            T res = A[0];
            T val = A[--Count];
            if (Count == 0) return res;
            int i = 0;
            while (i * 2 + 1 < Count)
            {
                int L = i * 2 + 1;
                int R = i * 2 + 2;
                if (R < Count && Math.Sign(comp.Compare(A[R], A[L])) == sign) { L = R; }
                if (Math.Sign(comp.Compare(A[L], val)) == sign) { A[i] = A[L]; i = L; }
                else { break; }
            }
            A[i] = val;
            return res;
        }
    }




    Reader reader = new Reader(Console.In);
    static void Main() { new Program().Solve(); }
}

class Reader
{
    private readonly TextReader reader;
    private readonly char[] separator = { ' ' };
    private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries;
    private string[] A = new string[0];
    private int i;

    public Reader(TextReader r) { reader = r; }
    public bool HasNext() { return Enqueue(); }
    public string String() { return Dequeue(); }
    public int Int() { return int.Parse(Dequeue()); }
    public long Long() { return long.Parse(Dequeue()); }
    public double Double() { return double.Parse(Dequeue()); }
    public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); }
    public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
    public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
    public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }
    public string Line() { return reader.ReadLine().Trim(); }
    private string[] Split(string s) { return s.Split(separator, removeOp); }
    private bool Enqueue()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return Enqueue();
        A = Split(line);
        i = 0;
        return true;
    }
    private string Dequeue() { Enqueue(); return A[i++]; }
}
0