結果

問題 No.1480 Many Complete Graphs
ユーザー fairy_lettucefairy_lettuce
提出日時 2021-04-16 21:58:28
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 11,523 bytes
コンパイル時間 1,991 ms
コンパイル使用メモリ 115,712 KB
実行使用メモリ 45,152 KB
最終ジャッジ日時 2024-07-03 04:15:58
合計ジャッジ時間 17,175 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
24,448 KB
testcase_01 AC 37 ms
19,328 KB
testcase_02 AC 37 ms
19,200 KB
testcase_03 AC 36 ms
19,072 KB
testcase_04 AC 37 ms
19,328 KB
testcase_05 AC 37 ms
19,200 KB
testcase_06 AC 37 ms
19,328 KB
testcase_07 AC 37 ms
19,200 KB
testcase_08 AC 37 ms
19,328 KB
testcase_09 AC 37 ms
19,456 KB
testcase_10 AC 38 ms
19,456 KB
testcase_11 AC 38 ms
19,200 KB
testcase_12 AC 38 ms
19,456 KB
testcase_13 AC 69 ms
27,904 KB
testcase_14 AC 58 ms
26,368 KB
testcase_15 AC 142 ms
29,696 KB
testcase_16 AC 102 ms
29,052 KB
testcase_17 AC 102 ms
28,532 KB
testcase_18 AC 51 ms
23,296 KB
testcase_19 AC 102 ms
28,028 KB
testcase_20 AC 129 ms
27,776 KB
testcase_21 AC 71 ms
26,752 KB
testcase_22 AC 51 ms
23,124 KB
testcase_23 AC 115 ms
31,616 KB
testcase_24 AC 154 ms
27,648 KB
testcase_25 AC 251 ms
33,400 KB
testcase_26 AC 276 ms
34,936 KB
testcase_27 AC 168 ms
28,032 KB
testcase_28 AC 243 ms
41,972 KB
testcase_29 AC 244 ms
42,108 KB
testcase_30 AC 286 ms
42,340 KB
testcase_31 AC 283 ms
42,356 KB
testcase_32 AC 287 ms
41,952 KB
testcase_33 AC 245 ms
42,104 KB
testcase_34 AC 241 ms
42,104 KB
testcase_35 AC 286 ms
42,344 KB
testcase_36 AC 280 ms
42,232 KB
testcase_37 AC 242 ms
42,104 KB
testcase_38 AC 241 ms
41,980 KB
testcase_39 AC 243 ms
41,844 KB
testcase_40 AC 286 ms
42,220 KB
testcase_41 AC 242 ms
41,976 KB
testcase_42 AC 286 ms
42,340 KB
testcase_43 AC 378 ms
45,152 KB
testcase_44 AC 285 ms
42,200 KB
testcase_45 AC 243 ms
41,852 KB
testcase_46 AC 241 ms
41,976 KB
testcase_47 AC 258 ms
34,816 KB
testcase_48 AC 256 ms
34,940 KB
testcase_49 AC 258 ms
34,812 KB
testcase_50 AC 154 ms
34,304 KB
testcase_51 AC 257 ms
34,816 KB
testcase_52 AC 243 ms
39,932 KB
testcase_53 AC 243 ms
39,808 KB
testcase_54 AC 242 ms
39,680 KB
testcase_55 AC 245 ms
39,936 KB
testcase_56 AC 331 ms
42,740 KB
testcase_57 AC 149 ms
33,024 KB
testcase_58 TLE -
evil_aftercontest.txt -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

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.A
{
	public class Solver
	{
		Scanner sr;
		StreamWriter sw;

		bool isMultipleTestCases = false;

		public void Solve()
		{
			var (n, m) = sr.ReadValue<int, int>();
			var c = new long[m];
			var s = Enumerable.Repeat(0, m).Select(p => new List<int>()).ToArray();
			var g = Enumerable.Repeat(0, n).Select(p => new List<int>()).ToArray();
			for (int i = 0; i < m; i++)
			{
				var k = sr.ReadInt();
				var ci = sr.ReadLong();
				c[i] = ci;
				for (int j = 0; j < k; j++)
				{
					var si = sr.ReadInt();
					s[i].Add(si - 1);
					g[si - 1].Add(i);
				}
			}
			var dist = Enumerable.Repeat(long.MaxValue / 3, n + 1).ToArray();
			dist[0] = 0;
			var q = new PriorityQueue<(long dist, int cur)>();
			q.Enqueue((0, 0));
			var seen = Enumerable.Repeat(n, m).ToArray();
			while (q.Count > 0)
			{
				var (d, cur) = q.Dequeue();
				if (d > dist[cur]) continue;
				foreach (var e in g[cur])
				{
					if (seen[e] <= cur) continue;
					seen[e] = cur;
					foreach (var f in s[e])
					{
						var nd = dist[cur] + (cur + f + 2 + (cur + f) % 2 + 2 * c[e]);
						if (dist[f].Chmin(nd))
						{
							q.Enqueue((nd, f));
						}
					}
				}
			}
			var ans = dist[n - 1];
			if (ans == long.MaxValue / 3) Console.WriteLine(-1);
			else Console.WriteLine(ans / 2);
		}

		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 class PriorityQueue<T> : IEnumerable<T>
	{
		private readonly List<T> heap;
		private readonly IComparer<T> comparer;

		public PriorityQueue(IComparer<T> comparer)
		{
			this.comparer = comparer;
			this.heap = new List<T>();
		}

		public PriorityQueue(Comparison<T> comparison) : this(Comparer<T>.Create(comparison)) { }

		public PriorityQueue() : this(Comparer<T>.Default) { }

		public void Enqueue(T item)
		{
			this.heap.Add(item);
			int index = this.Count - 1;
			while (index > 0)
			{
				var par = Parent(index);
				if (comparer.Compare(heap[index], heap[par]) >= 0) break;
				Swap(index, par);
				index = par;
			}
		}

		public T Dequeue()
		{
			var ret = this.Peek;
			var last = this.Count - 1;
			heap[0] = heap[last];
			heap.RemoveAt(last--);
			var index = 0;
			while (true)
			{
				var (r, l) = Child(index);
				int child;
				if (l <= last)
				{
					if (comparer.Compare(heap[l], heap[r]) < 0) child = l;
					else child = r;
				}
				else if (r <= last) child = r;
				else break;
				if (comparer.Compare(heap[index], heap[child]) <= 0) break;
				Swap(index, child);
				index = child;
			}
			return ret;
		}

		public T Peek => heap[0];

		public int Count => heap.Count;

		private void Swap(int a, int b)
		{
			var t = heap[a];
			heap[a] = heap[b];
			heap[b] = t;
		}

		private int Parent(int index) => (index - 1) / 2;

		private (int l, int r) Child(int index) => (2 * index + 1, 2 * index + 2);

		public IEnumerator<T> GetEnumerator()
		{
			var ret = new List<T>();
			while (this.Count > 0)
			{
				ret.Add(this.Dequeue());
			}

			for (int i = 0; i < ret.Count; i++)
			{
				this.Enqueue(ret[i]);
			}

			foreach (var e in ret)
			{
				yield return e;
			}
		}

		System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator() => GetEnumerator();
	}

	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);
		}
	}
}
0