結果
| 問題 |
No.9 モンスターのレベル上げ
|
| コンテスト | |
| ユーザー |
 femto
|
| 提出日時 | 2015-04-17 22:23:48 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 3,882 ms / 5,000 ms |
| コード長 | 6,312 bytes |
| コンパイル時間 | 1,151 ms |
| コンパイル使用メモリ | 111,360 KB |
| 実行使用メモリ | 44,664 KB |
| 最終ジャッジ日時 | 2024-06-23 22:36:17 |
| 合計ジャッジ時間 | 31,086 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| 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.Diagnostics;
using System.Collections.Generic;
using System.Linq;
using Enu = System.Linq.Enumerable;
class Solution {
int N;
int [] A, B;
void calc() {
N = ri();
A = ria(N);
B = ria(N).Select(e => e / 2).ToArray();
var ans = new List<int>();
for (int i = 0; i < N; i++) {
var q = new PriorityQueue<elem>((e1, e2) => {
int comp = e2.level.CompareTo(e1.level);
if (comp == 0) return e2.count.CompareTo(e1.count);
else return comp;
});
foreach (var a in A)
q.Push(new elem(a));
for (int j = 0; j < N; j++) {
var e = q.Pop();
e.level += B [(i + j) % N];
e.count++;
q.Push(e);
}
ans.Add(q.buffer.Max(e => e.count));
}
Console.WriteLine(ans.Min());
}
class elem {
public int level, count;
public elem(int level) {
this.level = level;
count = 0;
}
}
public class PriorityQueue<T> {
public List<T> buffer;
private Comparison<T> comp;
// 昇順
// (e1, e2) => e2.CompareTo(e1)
// 降順
// (e1, e2) => e1.CompareTo(e2)
public PriorityQueue(Comparison<T> comp) {
buffer = new List<T>();
this.comp = comp;
}
public PriorityQueue(Comparison<T> comp, IEnumerable<T> data)
: this(comp) {
foreach (T e in data) Push(e);
}
public void Push(T elem) { PushHeap(this.buffer, elem); }
public T Pop() { return PopHeap(this.buffer); }
public int Count() { return buffer.Count; }
public T Top() { return buffer [0]; }
private void PushHeap(List<T> array, T elem) {
int n = array.Count;
array.Add(elem);
while (n != 0) {
int i = (n - 1) / 2;
// 親と値を入れ替え
if (comp(array [n], array [i]) > 0) {
T tmp = array [n]; array [n] = array [i]; array [i] = tmp;
}
n = i;
}
}
private T PopHeap(List<T> array) {
int n = array.Count - 1;
T returnelem = array [0];
array [0] = array [n];
array.RemoveAt(n);
for (int i = 0, j; (j = 2 * i + 1) < n; ) {
// 値の大きい方の子を選ぶ
if ((j != n - 1) && (comp(array [j], array [j + 1]) < 0))
j++;
// 子と値を入れ替え
if (comp(array [i], array [j]) < 0) {
T tmp = array [j]; array [j] = array [i]; array [i] = tmp;
}
i = j;
}
return returnelem;
}
}
static void Main(string [] args) {
new Solution().calc();
}
#region
static int ri() { return int.Parse(Console.ReadLine()); }
static int [] ria(int n) {
if (n <= 0) { Console.ReadLine(); return new int [0]; }
else return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray();
}
static void rio(out int p1) { p1 = ri(); }
static void rio(out int p1, out int p2) { var r = ria(2); p1 = r [0]; p2 = r [1]; }
static void rio(out int p1, out int p2, out int p3) { var r = ria(3); p1 = r [0]; p2 = r [1]; p3 = r [2]; }
static void rio(out int p1, out int p2, out int p3, out int p4) { var r = ria(4); p1 = r [0]; p2 = r [1]; p3 = r [2]; p4 = r [3]; }
static void rio(out int p1, out int p2, out int p3, out int p4, out int p5) { var r = ria(5); p1 = r [0]; p2 = r [1]; p3 = r [2]; p4 = r [3]; p5 = r [4]; }
static long rl() { return long.Parse(Console.ReadLine()); }
static long [] rla(int n) {
if (n <= 0) { Console.ReadLine(); return new long [0]; }
else return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray();
}
static void rlo(out long p1) { p1 = rl(); }
static void rlo(out long p1, out long p2) { var r = rla(2); p1 = r [0]; p2 = r [1]; }
static void rlo(out long p1, out long p2, out long p3) { var r = rla(3); p1 = r [0]; p2 = r [1]; p3 = r [2]; }
static void rlo(out long p1, out long p2, out long p3, out long p4) { var r = rla(4); p1 = r [0]; p2 = r [1]; p3 = r [2]; p4 = r [3]; }
static void rlo(out long p1, out long p2, out long p3, out long p4, out long p5) { var r = rla(5); p1 = r [0]; p2 = r [1]; p3 = r [2]; p4 = r [3]; p5 = r [4]; }
static double rd() { return double.Parse(Console.ReadLine()); }
static double [] rda(int n) {
if (n <= 0) { Console.ReadLine(); return new double [0]; }
else return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray();
}
static void rdo(out double p1) { p1 = rd(); }
static void rdo(out double p1, out double p2) { var r = rda(2); p1 = r [0]; p2 = r [1]; }
static void rdo(out double p1, out double p2, out double p3) { var r = rda(3); p1 = r [0]; p2 = r [1]; p3 = r [2]; }
static void rdo(out double p1, out double p2, out double p3, out double p4) { var r = rda(4); p1 = r [0]; p2 = r [1]; p3 = r [2]; p4 = r [3]; }
static void rdo(out double p1, out double p2, out double p3, out double p4, out double p5) { var r = rda(5); p1 = r [0]; p2 = r [1]; p3 = r [2]; p4 = r [3]; p5 = r [4]; }
static void swap<T>(ref T x, ref T y) { T temp = x; x = y; y = temp; }
static void wa1<T>(T [] a) { Debug.WriteLine(string.Join(" ", a)); }
static void wa2<T>(T [] [] a) {
foreach (var row in a) {
Debug.WriteLine(String.Join(" ", row));
}
}
[DebuggerDisplay("{x} , {y}")]
class point {
public int x, y;
public point(int x, int y) {
this.x = x; this.y = y;
}
}
#endregion
}
static class Extention {
public static T [] [] ToJagArray<T>(this T [,] a) {
int n = a.GetLength(0), m = a.GetLength(1);
var ret = new T [n] [];
for (int i = 0; i < n; i++) {
ret [i] = new T [m];
for (int j = 0; j < m; j++) {
ret [i] [j] = a [i, j];
}
}
return ret;
}
}