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

• 問題: No.9 モンスターのレベル上げ
• ユーザー: mban
• 提出日時: 2017-01-30 11:41:37
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 2,731 ms / 5,000 ms
• コード長: 4,176 bytes
• コンパイル時間: 1,153 ms
• コンパイル使用メモリ: 115,004 KB
• 実行使用メモリ: 46,172 KB
• 最終ジャッジ日時: 2024-06-23 23:52:40
• 合計ジャッジ時間: 12,974 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
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 Monstar[] A;
    private int[] B;
    private Heap he;
    private int ans = int.MaxValue;
    public void Scan()
    {
        Scanner sc = new Scanner();
        N = sc.NextInt();
        A = sc.IntArray().Select(i=>new Monstar(i)).ToArray();
        B = sc.IntArray();
    }

    public void Solve()
    {
        he = new Heap();
        foreach (var m in A)
        {
            he.Push(m);
        }
        for(int i = 0; i < N; i++)
        {
            ans = Math.Min(Count(i), ans);
        }
        Console.WriteLine(ans);
    }

    private int Count(int first)
    {
        var cp = new Heap(he.L);
        for(int i = 0; i < N; i++)
        {
            Monstar mon = cp.Pop();
            mon.Battle++;
            mon.Level += B[(first + i) % N]/2;
            if (ans <= mon.Battle)
            {
                return int.MaxValue;
            }
            cp.Push(mon);
        }
        //Console.WriteLine(string.Join(" ", cp.L.Select(m => m.Battle)));
        return cp.L.Max(aa => aa.Battle);
    }
}

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

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

class Heap
{
    public List<Monstar> L;
     public Heap(List<Monstar>list)
    {
        L = list.ToList();
    }

    public Heap()
    {
        L = new List<Monstar>();
    }

    public void Push(Monstar item)
    {
        int n = L.Count;
        L.Add(item);
        while (n > 0)
        {
            int i = (n - 1) / 2;
            if (Monstar.Compare(L[n], L[i]) > 0)
            {
                Swap(n, i);
            }
            n = i;
        }
    }

    public Monstar Pop()
    {
        int n = L.Count - 1;
        Monstar ret = L[0];
        L[0] = L[n];
        L.RemoveAt(n);
        for(int i = 0, j; (j = 2 * i + 1) < n;)
        {
            if ((j != n - 1) && Monstar.Compare(L[j], L[j + 1]) < 0)
            {
                j++;
            }
            if (Monstar.Compare(L[i], L[j]) < 0)
            {
                Swap(i, j);
            }
            i = j;
        }
        return ret;
    }

    private void Swap(int a,int b)
    {
        Monstar temp = L[a];
        L[a] = L[b];
        L[b] = temp;
    }
}