#146932 (C#(csc)) No.9 モンスターのレベル上げ

• 問題: No.9 モンスターのレベル上げ
• ユーザー: mban
• 提出日時: 2017-01-30 12:27:01
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 2,891 ms / 5,000 ms
• コード長: 4,548 bytes
• コンパイル時間: 1,230 ms
• コンパイル使用メモリ: 118,812 KB
• 実行使用メモリ: 50,744 KB
• 最終ジャッジ日時: 2024-06-23 23:54:11
• 合計ジャッジ時間: 25,877 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
other	AC * 20

コンパイルメッセージ

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.Collections.Specialized;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;
using System.IO;

class Program
{ 
    static void Main(string[]args)
    {
        Magatro alice = new Magatro();
        alice.Scan();
        alice.Solve();
    }
}

public class Scanner
{
    private StreamReader Sr;
    private string[] S;
    private int Index;
    private const char Separator = ' ';
    public Scanner()
    {
        Index = 0;
        S = new string[0];
        Sr = new StreamReader(Console.OpenStandardInput());
    }
    private string[] Line()
    {
        return Sr.ReadLine().Split(Separator);
    }
    public string Next()
    {
        string result;
        if (Index >= S.Length)
        {
            S = Line();
            Index = 0;
        }
        result = S[Index];
        Index++;
        return result;
    }
    public int NextInt()
    {
        return int.Parse(Next());
    }
    public double NextDouble()
    {
        return double.Parse(Next());
    }
    public long NextLong()
    {
        return long.Parse(Next());
    }
    public string[] StringArray(int index = 0)
    {
        Next();
        Index = S.Length;
        return S.Skip(index).ToArray();
    }
    public int[] IntArray(int index = 0)
    {
        return StringArray(index).Select(int.Parse).ToArray();
    }
    public long[] LongArray(int index = 0)
    {
        return StringArray(index).Select(long.Parse).ToArray();
    }
    public bool EndOfStream
    {
        get { return Sr.EndOfStream; }
    }
}

public class Magatro
{
    private int N;
    private int[] A;
    private int[] B;
    private int Ans = int.MaxValue;
    private PriortyQueue<Monstor> Pq;
    public void Scan()
    {
        Scanner sc = new Scanner();
        N = sc.NextInt();
        A = sc.IntArray();
        B = sc.IntArray();
    }
    public void Solve()
    {
        Pq = new PriortyQueue<Monstor>(Compare);
        for(int i = 0; i < N; i++)
        {
            Pq.Add(new Monstor(A[i]));
        }
        for(int i = 0; i < N; i++)
        {
            Ans = Math.Min(Ans, Count(i));
        }
        Console.WriteLine(Ans);
    }

    private int Count(int first)
    {
        PriortyQueue<Monstor> cp = new PriortyQueue<Monstor>(Pq);
        for(int i = 0; i < N; i++)
        {
            Monstor mon = cp.Poll();
            mon.Battle++;
            mon.Level += B[(i + first) % N] / 2;
            cp.Add(mon);
        }
        return cp.ToArray().Max(m => m.Battle);
    }

    private int Compare(Monstor a,Monstor b)
    {
        if (a.Level != b.Level)
        {
            return -a.Level.CompareTo(b.Level);
        }
        else
        {
            return -a.Battle.CompareTo(b.Battle);
        }
    }
}

struct Monstor
{
    public int Battle;
    public int Level;
    public Monstor(int level)
    {
        Battle = 0;
        Level = level;
    }
}

public class PriortyQueue<T>
{
    private Comparison<T> Comparator;
    private List<T> L;
    public PriortyQueue(Comparison<T> comparator)
    {
        Clear();
        Comparator = comparator;
    }
    public PriortyQueue(PriortyQueue<T> queue)
    {
        L = queue.ToArray().ToList();
        Comparator = queue.Comparator;
    }
    public void Add(T item)
    {
        int n = L.Count;
        L.Add(item);
        while (n > 0)
        {
            int i = (n - 1) / 2;
            if (Comparator(L[n], L[i]) > 0)
            {
                Swap(n, i);
            }
            n = i;
        }
    }
    public T Poll()
    {
        T ret = Peak();
        Pop();
        return ret;
    }
    public void Pop()
    {
        int n = L.Count - 1;
        L[0] = L[n];
        L.RemoveAt(n);
        for (int i = 0, j; (j = 2 * i + 1) < n;)
        {
            if ((j != n - 1) && (Comparator(L[j], L[j + 1]) < 0))
            {
                j++;
            }

            if (Comparator(L[i], L[j]) < 0)
            {
                Swap(i, j);
            }
            i = j;
        }
    }
    public T Peak()
    {
        return L[0];
    }
    public T[] ToArray()
    {
        return L.ToArray();
    }
    public void Clear()
    {
        L = new List<T>();
    }
    public int Size
    {
        get { return L.Count; }
    }
    public bool IsEmpty
    {
        get { return L.Count == 0; }
    }
    private void Swap(int a, int b)
    {
        T temp = L[a];
        L[a] = L[b];
        L[b] = temp;
    }
}