Submission #6511410
Source Code Expand
using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Text;
namespace ABC026C
{
class Program
{
public static void Solve(Input input)
{
var n = input.NextInt();
var b = input.NextInt(n - 1, -1);
var assistants = Enumerable.Range(0, n)
.Select(_ => new List<int>())
.ToArray();
for (int i = 0; i < b.Length; i++)
{
assistants[b[i]].Add(i + 1);
}
Console.WriteLine(bfs(assistants, 0));
}
static int bfs(List<int>[] assistants, int v)
{
if (!assistants[v].Any())
{
return 1;
}
var pay = new List<int>();
for (int i = 0; i < assistants[v].Count(); i++)
{
pay.Add(bfs(assistants, assistants[v][i]));
}
if (pay.Count() == 1)
{
return pay.First() * 2 + 1;
}
return pay.Max() + pay.Min() + 1;
}
#region Main
public static void Main(string[] args)
{
// 出力が少ないときはこれをセットする方が時間かかるけれど
// その場合は出力がボトルネックになっていないので、まあ良しとする
var needsFlushOutput = true;
if (needsFlushOutput)
{
// 細かく出力しないようにする
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
Console.SetOut(sw);
}
// 通常は引数無しで、ファイルから読み出したい場合はpath指定する
var input = new Input();
// 仮想的に標準入力をセットする
//input.SetText("");
Solve(input);
Console.Out.Flush();
}
#endregion
#region Competitive Template
#pragma warning disable CS0414
static readonly int MOD = (int)1e9 + 7;
static readonly int[] dx = { 1, 0, -1, 0 };
static readonly int[] dy = { 0, 1, 0, -1 };
/// <summary> 左上が原点 </summary>
static readonly char[] dir = { 'R', 'U', 'L', 'D' };
#pragma warning restore CS0414
/// <summary>
/// 値を書き換え可能なTuple(ぐらいのイメージ)
/// </summary>
public class Pair<T, U> : IComparable<Pair<T, U>>, IEquatable<Pair<T, U>>
where T : IComparable<T>
where U : IComparable<U>
{
public T V1 { get; set; }
public U V2 { get; set; }
public Pair(T v1, U v2)
{
this.V1 = v1;
this.V2 = v2;
}
public Pair(Pair<T, U> src) : this(src.V1, src.V2) { }
public int CompareTo(Pair<T, U> other)
{
var r = this.V1.CompareTo(other.V1);
if (r == 0) r = this.V2.CompareTo(other.V2);
return r;
}
public bool Equals(Pair<T, U> other)
=> (other != null && this.CompareTo(other) == 0);
public override string ToString()
=> $"{V1} {V2}";
public override bool Equals(object obj)
=> Equals(obj as Pair<T, U>);
public override int GetHashCode()
{
var hashCode = 1989511945;
hashCode = hashCode * -1521134295 + V1.GetHashCode();
hashCode = hashCode * -1521134295 + V2.GetHashCode();
return hashCode;
}
public static bool operator ==(Pair<T, U> a, Pair<T, U> b)
{
if (object.ReferenceEquals(a, null))
{
return object.ReferenceEquals(b, null);
}
return a.Equals(b);
}
public static bool operator !=(Pair<T, U> a, Pair<T, U> b)
=> !(a == b);
public static bool operator <(Pair<T, U> a, Pair<T, U> b)
=> a.CompareTo(b) < 0;
public static bool operator <=(Pair<T, U> a, Pair<T, U> b)
=> a.CompareTo(b) <= 0;
public static bool operator >(Pair<T, U> a, Pair<T, U> b)
=> a.CompareTo(b) > 0;
public static bool operator >=(Pair<T, U> a, Pair<T, U> b)
=> a.CompareTo(b) >= 0;
}
public class Input
{
// 変な改行コードがたまに混じっているので、一応セパレート指定する
// スペース単独指定の方がもちろん早い
static readonly char[] separator = { ' ', '\r', '\n' };
readonly StreamReader sr;
readonly Queue<string> queue;
/// <summary>
/// 特定のファイルから読み出したい場合はpath指定する
/// </summary>
public Input(string path = "")
{
queue = new Queue<string>();
if (string.IsNullOrEmpty(path))
{
sr = new StreamReader(Console.OpenStandardInput());
}
else
{
sr = new StreamReader(path);
}
}
/// <summary>
/// 入力予約
/// </summary>
public void SetText(IEnumerable<string> items)
{
foreach (var item in items)
{
SetText(item);
}
}
/// <summary>
/// 入力予約
/// </summary>
public bool SetText(string s)
{
if (s == null) return false;
foreach (var elem in s.Trim()
.Split(separator, StringSplitOptions.RemoveEmptyEntries))
{
queue.Enqueue(elem);
}
return true;
}
/// <summary>
/// 要素が存在するか
/// </summary>
public bool Any()
=> queue.Any() || Read();
/// <summary>
/// 内部queueに入力からの値をsplitして格納する
/// </summary>
bool Read()
{
if (!SetText(sr.ReadLine())) return false;
if (!queue.Any()) return Read();
return queue.Any();
}
/// <summary>
/// 次のstringを一つ読み込む
/// </summary>
public string Next()
{
if (!queue.Any() && !Read())
{
return "";
}
return queue.Dequeue();
}
/// <summary>
/// 指定個数queueにたまるまでenqueueし続ける
/// </summary>
bool Accumulate(int n)
{
while (queue.Count() < n)
{
if (!Read()) return false;
}
return true;
}
public int NextInt() => int.Parse(Next());
public long NextLong() => long.Parse(Next());
public double NextDouble() => double.Parse(Next());
/// <summary>
/// n個の要素をparseして、それぞれにoffsetをaddした配列を返す
/// </summary>
T[] NextT<T>(int n, T offset, Func<string, T> parse, Func<T, T, T> add)
{
if (!Accumulate(n)) return null;
var a = new T[n];
for (int i = 0; i < n; i++)
a[i] = add(parse(queue.Dequeue()), offset);
return a;
}
public string[] Next(int n) => NextT(n, "", x => x, (x, y) => x);
public int[] NextInt(int n, int offset = 0) => NextT(n, offset, int.Parse, (x, y) => x + y);
public long[] NextLong(int n, long offset = 0) => NextT(n, offset, long.Parse, (x, y) => x + y);
public double[] NextDouble(int n, double offset = 0.0) => NextT(n, offset, double.Parse, (x, y) => x + y);
}
static class Utils
{
public static void Print<T>(IEnumerable<T> ie, string sep = " ") => Console.WriteLine(string.Join(sep, ie));
public static void Print<T>(params T[] objs) => Print(objs);
public static T Max<T>(params T[] objs) => objs.Max();
public static T Min<T>(params T[] objs) => objs.Min();
public static void Swap<T>(ref T x, ref T y) where T : struct { var t = x; x = y; y = t; }
public static void Swap<T>(IList<T> list, int i, int j) where T : struct { var t = list[i]; list[i] = list[j]; list[j] = t; }
/// <summary>
/// vでfillされたT[d1][d2]配列を作成する
/// </summary>
public static T[][] Create2DArray<T>(int d1, int d2, T v = default(T))
{
return
Enumerable.Repeat(0, d1).Select(_ =>
Enumerable.Repeat(v, d2).ToArray()).ToArray();
}
/// <summary>
/// vでfillされたT[d1][d2][d3]配列を作成する
/// </summary>
public static T[][][] Create3DArray<T>(int d1, int d2, int d3, T v = default(T))
{
return
Enumerable.Repeat(0, d1).Select(_ =>
Enumerable.Repeat(0, d2).Select(__ =>
Enumerable.Repeat(v, d3).ToArray()).ToArray()).ToArray();
}
}
#endregion
}
}
Submission Info
Submission Time |
|
Task |
C - 高橋君の給料 |
User |
tetora1011 |
Language |
C# (Mono 4.6.2.0) |
Score |
100 |
Code Size |
10238 Byte |
Status |
AC |
Exec Time |
33 ms |
Memory |
13652 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
example_0.txt, example_1.txt, example_2.txt, example_3.txt |
All |
example_0.txt, example_1.txt, example_2.txt, example_3.txt, maxrand_0.txt, maxrand_1.txt, maxrand_2.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, special_0.txt, example_0.txt, example_1.txt, example_2.txt, example_3.txt |
Case Name |
Status |
Exec Time |
Memory |
example_0.txt |
AC |
33 ms |
11860 KB |
example_1.txt |
AC |
30 ms |
13652 KB |
example_2.txt |
AC |
30 ms |
11604 KB |
example_3.txt |
AC |
30 ms |
11476 KB |
maxrand_0.txt |
AC |
29 ms |
11604 KB |
maxrand_1.txt |
AC |
30 ms |
11604 KB |
maxrand_2.txt |
AC |
30 ms |
13652 KB |
random_0.txt |
AC |
30 ms |
11604 KB |
random_1.txt |
AC |
30 ms |
11604 KB |
random_2.txt |
AC |
29 ms |
9556 KB |
random_3.txt |
AC |
29 ms |
9556 KB |
random_4.txt |
AC |
30 ms |
11604 KB |
random_5.txt |
AC |
30 ms |
11604 KB |
random_6.txt |
AC |
29 ms |
9556 KB |
random_7.txt |
AC |
30 ms |
13652 KB |
random_8.txt |
AC |
29 ms |
9556 KB |
random_9.txt |
AC |
30 ms |
9556 KB |
special_0.txt |
AC |
29 ms |
11476 KB |