Submission #21671562
Source Code Expand
using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Text;
using System.Globalization;
using System.Threading;
using static System.Math;
namespace FertiLib.Contest.E
{
public class Solver
{
Scanner sr;
StreamWriter sw;
bool isMultipleTestCases = false;
public void Solve()
{
var n = sr.ReadInt();
var c = sr.ReadIntArray(n);
var (a, b) = sr.ReadValueArray<int, int>(n - 1);
var dp = new Dictionary<int, List<int>>[n];
var g = Enumerable.Repeat(0, n).Select(p => new List<int>()).ToArray();
for (int i = 0; i < n - 1; i++)
{
g[--a[i]].Add(--b[i]);
g[b[i]].Add(a[i]);
}
Dfs(0, -1, dp, c, g);
var ans = new List<int>();
foreach (var e in dp[0].Values)
{
foreach (var f in e)
{
ans.Add(f);
}
}
ans.Sort();
foreach (var e in ans)
{
Console.WriteLine(e + 1);
}
}
public void Dfs(int cur, int par, Dictionary<int, List<int>>[] dp, int[] color, List<int>[] g)
{
dp[cur] = new Dictionary<int, List<int>>();
foreach (var e in g[cur])
{
if (e == par) continue;
Dfs(e, cur, dp, color, g);
Merge(dp, cur, e);
}
dp[cur][color[cur]] = new List<int> { cur };
}
public void Merge(Dictionary<int, List<int>>[] dp, int par, int child)
{
if (dp[par].Count > dp[child].Count)
{
var k = dp[child].Keys.ToArray();
foreach (var key in k)
{
var value = dp[child][key];
if (dp[par].ContainsKey(key))
{
if (dp[par][key].Count > dp[child][key].Count)
{
foreach (var e in dp[child][key])
{
dp[par][key].Add(e);
}
}
else
{
foreach (var e in dp[par][key])
{
dp[child][key].Add(e);
}
dp[par][key] = dp[child][key];
}
}
else dp[par].Add(key, value);
}
}
else
{
var k = dp[par].Keys.ToArray();
foreach (var key in k)
{
var value = dp[par][key];
if (dp[child].ContainsKey(key))
{
if (dp[par][key].Count > dp[child][key].Count)
{
foreach (var e in dp[child][key])
{
dp[par][key].Add(e);
}
dp[child][key] = dp[par][key];
}
else
{
foreach (var e in dp[par][key])
{
dp[child][key].Add(e);
}
}
}
else dp[child].Add(key, value);
}
dp[par] = dp[child];
}
}
public Solver(Scanner cin, StreamWriter cout)
{
this.sr = cin;
this.sw = cout;
}
public void Start()
{
int _t = 1;
if (isMultipleTestCases) _t = sr.ReadInt();
while (_t-- > 0) Solve();
}
public static void YESNO(bool condition) => Console.WriteLine(condition ? "YES" : "NO");
public static void YesNo(bool condition) => Console.WriteLine(condition ? "Yes" : "No");
public static void yesno(bool condition) => Console.WriteLine(condition ? "yes" : "no");
}
public static class Program
{
public static void Main(string[] args)
{
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
Console.SetOut(sw);
var cin = new Scanner();
var solver = new Solver(cin, sw);
solver.Start();
Console.Out.Flush();
}
}
public static class Extention
{
public static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
public static int UpperBound<T>(this IList<T> list, T value) => list.BinarySearch(value, true, 0, list.Count, Comparer<T>.Default);
public static int LowerBound<T>(this IList<T> list, T value) => list.BinarySearch(value, false, 0, list.Count, Comparer<T>.Default);
public static int BinarySearch<T>(this IList<T> list, T value, bool isUpperBound, int index, int length, Comparer<T> comparer)
{
var ng = index - 1;
var ok = index + length;
while (ok - ng > 1)
{
var mid = ng + (ok - ng) / 2;
var res = comparer.Compare(list[mid], value);
if (res < 0 || (isUpperBound && res == 0)) ng = mid;
else ok = mid;
}
return ok;
}
public static bool Chmax<T>(ref this T a, T b) where T : struct, IComparable<T>
{
if (a.CompareTo(b) >= 0) return false;
a = b;
return true;
}
public static bool Chmin<T>(ref this T a, T b) where T : struct, IComparable<T>
{
if (a.CompareTo(b) <= 0) return false;
a = b;
return true;
}
}
public class Scanner
{
string[] s;
int i;
char[] separator = new char[] { ' ' };
public Scanner()
{
s = new string[0];
i = 0;
}
public string Read() => ReadString();
public string ReadString()
{
if (i < s.Length) return s[i++];
string st = Console.ReadLine();
while (st == "") st = Console.ReadLine();
s = st.Split(separator, StringSplitOptions.RemoveEmptyEntries);
if (s.Length == 0) return ReadString();
i = 0;
return s[i++];
}
public string[] ReadStringArray(int N)
{
string[] Array = new string[N];
for (int i = 0; i < N; i++)
{
Array[i] = ReadString();
}
return Array;
}
public int ReadInt() => int.Parse(ReadString());
public int[] ReadIntArray(int N, int add = 0)
{
int[] Array = new int[N];
for (int i = 0; i < N; i++)
{
Array[i] = ReadInt() + add;
}
return Array;
}
public long ReadLong() => long.Parse(ReadString());
public long[] ReadLongArray(int N, long add = 0)
{
long[] Array = new long[N];
for (int i = 0; i < N; i++)
{
Array[i] = ReadLong() + add;
}
return Array;
}
public double ReadDouble() => double.Parse(ReadString());
public double[] ReadDoubleArray(int N, double add = 0)
{
double[] Array = new double[N];
for (int i = 0; i < N; i++)
{
Array[i] = ReadDouble() + add;
}
return Array;
}
public T1 ReadValue<T1>() => (T1)Convert.ChangeType(ReadString(), typeof(T1));
public (T1, T2) ReadValue<T1, T2>()
{
var inputs = ReadStringArray(2);
var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
return (v1, v2);
}
public (T1, T2, T3) ReadValue<T1, T2, T3>()
{
var inputs = ReadStringArray(3);
var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
return (v1, v2, v3);
}
public (T1, T2, T3, T4) ReadValue<T1, T2, T3, T4>()
{
var inputs = ReadStringArray(4);
var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
return (v1, v2, v3, v4);
}
public (T1, T2, T3, T4, T5) ReadValue<T1, T2, T3, T4, T5>()
{
var inputs = ReadStringArray(5);
var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
return (v1, v2, v3, v4, v5);
}
public (T1, T2, T3, T4, T5, T6) ReadValue<T1, T2, T3, T4, T5, T6>()
{
var inputs = ReadStringArray(6);
var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
return (v1, v2, v3, v4, v5, v6);
}
public (T1, T2, T3, T4, T5, T6, T7) ReadValue<T1, T2, T3, T4, T5, T6, T7>()
{
var inputs = ReadStringArray(7);
var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
var v7 = (T7)Convert.ChangeType(inputs[6], typeof(T7));
return (v1, v2, v3, v4, v5, v6, v7);
}
public T1[] ReadValueArray<T1>(int N)
{
var v1 = new T1[N];
for (int i = 0; i < N; i++)
{
v1[i] = ReadValue<T1>();
}
return v1;
}
public (T1[], T2[]) ReadValueArray<T1, T2>(int N)
{
var (v1, v2) = (new T1[N], new T2[N]);
for (int i = 0; i < N; i++)
{
var (t1, t2) = ReadValue<T1, T2>();
v1[i] = t1;
v2[i] = t2;
}
return (v1, v2);
}
public (T1[], T2[], T3[]) ReadValueArray<T1, T2, T3>(int N)
{
var (v1, v2, v3) = (new T1[N], new T2[N], new T3[N]);
for (int i = 0; i < N; i++)
{
var (t1, t2, t3) = ReadValue<T1, T2, T3>();
v1[i] = t1;
v2[i] = t2;
v3[i] = t3;
}
return (v1, v2, v3);
}
public (T1[], T2[], T3[], T4[]) ReadValueArray<T1, T2, T3, T4>(int N)
{
var (v1, v2, v3, v4) = (new T1[N], new T2[N], new T3[N], new T4[N]);
for (int i = 0; i < N; i++)
{
var (t1, t2, t3, t4) = ReadValue<T1, T2, T3, T4>();
v1[i] = t1;
v2[i] = t2;
v3[i] = t3;
v4[i] = t4;
}
return (v1, v2, v3, v4);
}
public (T1[], T2[], T3[], T4[], T5[]) ReadValueArray<T1, T2, T3, T4, T5>(int N)
{
var (v1, v2, v3, v4, v5) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N]);
for (int i = 0; i < N; i++)
{
var (t1, t2, t3, t4, t5) = ReadValue<T1, T2, T3, T4, T5>();
v1[i] = t1;
v2[i] = t2;
v3[i] = t3;
v4[i] = t4;
v5[i] = t5;
}
return (v1, v2, v3, v4, v5);
}
public (T1[], T2[], T3[], T4[], T5[], T6[]) ReadValueArray<T1, T2, T3, T4, T5, T6>(int N)
{
var (v1, v2, v3, v4, v5, v6) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N]);
for (int i = 0; i < N; i++)
{
var (t1, t2, t3, t4, t5, t6) = ReadValue<T1, T2, T3, T4, T5, T6>();
v1[i] = t1;
v2[i] = t2;
v3[i] = t3;
v4[i] = t4;
v5[i] = t5;
v6[i] = t6;
}
return (v1, v2, v3, v4, v5, v6);
}
public (T1[], T2[], T3[], T4[], T5[], T6[], T7[]) ReadValueArray<T1, T2, T3, T4, T5, T6, T7>(int N)
{
var (v1, v2, v3, v4, v5, v6, v7) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N], new T7[N]);
for (int i = 0; i < N; i++)
{
var (t1, t2, t3, t4, t5, t6, t7) = ReadValue<T1, T2, T3, T4, T5, T6, T7>();
v1[i] = t1;
v2[i] = t2;
v3[i] = t3;
v4[i] = t4;
v5[i] = t5;
v6[i] = t6;
v7[i] = t7;
}
return (v1, v2, v3, v4, v5, v6, v7);
}
}
}
Submission Info
| Submission Time |
|
| Task |
E - Unique Color |
| User |
fairy_lettuce |
| Language |
C# (.NET Core 3.1.201) |
| Score |
500 |
| Code Size |
11025 Byte |
| Status |
AC |
| Exec Time |
472 ms |
| Memory |
118436 KiB |
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
500 / 500 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
sample_01.txt, sample_02.txt |
| All |
binary_01.txt, binary_02.txt, binary_03.txt, binary_04.txt, binary_05.txt, min_01.txt, min_02.txt, path_01.txt, path_02.txt, path_03.txt, path_04.txt, path_05.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, sample_01.txt, sample_02.txt, star_01.txt, star_02.txt, star_03.txt, star_04.txt, star_05.txt |
| Case Name |
Status |
Exec Time |
Memory |
| binary_01.txt |
AC |
288 ms |
74892 KiB |
| binary_02.txt |
AC |
278 ms |
75308 KiB |
| binary_03.txt |
AC |
285 ms |
75016 KiB |
| binary_04.txt |
AC |
412 ms |
106804 KiB |
| binary_05.txt |
AC |
472 ms |
118436 KiB |
| min_01.txt |
AC |
87 ms |
28348 KiB |
| min_02.txt |
AC |
84 ms |
28700 KiB |
| path_01.txt |
AC |
296 ms |
79540 KiB |
| path_02.txt |
AC |
293 ms |
79376 KiB |
| path_03.txt |
AC |
290 ms |
79620 KiB |
| path_04.txt |
AC |
300 ms |
80772 KiB |
| path_05.txt |
AC |
448 ms |
79108 KiB |
| random_01.txt |
AC |
86 ms |
29584 KiB |
| random_02.txt |
AC |
85 ms |
29060 KiB |
| random_03.txt |
AC |
91 ms |
29448 KiB |
| random_04.txt |
AC |
87 ms |
30840 KiB |
| random_05.txt |
AC |
84 ms |
29920 KiB |
| random_06.txt |
AC |
263 ms |
75168 KiB |
| random_07.txt |
AC |
271 ms |
74764 KiB |
| random_08.txt |
AC |
287 ms |
75048 KiB |
| random_09.txt |
AC |
396 ms |
92312 KiB |
| random_10.txt |
AC |
396 ms |
101172 KiB |
| sample_01.txt |
AC |
85 ms |
28380 KiB |
| sample_02.txt |
AC |
91 ms |
28368 KiB |
| star_01.txt |
AC |
270 ms |
74300 KiB |
| star_02.txt |
AC |
305 ms |
77828 KiB |
| star_03.txt |
AC |
280 ms |
79056 KiB |
| star_04.txt |
AC |
337 ms |
80808 KiB |
| star_05.txt |
AC |
277 ms |
85088 KiB |