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(); var c = new long[m]; var s = Enumerable.Repeat(0, m).Select(p => new List()).ToArray(); var g = Enumerable.Repeat(0, n).Select(p => new List()).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 : IEnumerable { private readonly List heap; private readonly IComparer comparer; public PriorityQueue(IComparer comparer) { this.comparer = comparer; this.heap = new List(); } public PriorityQueue(Comparison comparison) : this(Comparer.Create(comparison)) { } public PriorityQueue() : this(Comparer.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 GetEnumerator() { var ret = new List(); 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(this IEnumerable x, string separator = "") => string.Join(separator, x); public static int UpperBound(this IList list, T value) => list.BinarySearch(value, true, 0, list.Count, Comparer.Default); public static int LowerBound(this IList list, T value) => list.BinarySearch(value, false, 0, list.Count, Comparer.Default); public static int BinarySearch(this IList list, T value, bool isUpperBound, int index, int length, Comparer 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(ref this T a, T b) where T : struct, IComparable { if (a.CompareTo(b) >= 0) return false; a = b; return true; } public static bool Chmin(ref this T a, T b) where T : struct, IComparable { 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)Convert.ChangeType(ReadString(), typeof(T1)); public (T1, T2) ReadValue() { 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() { 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() { 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() { 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() { 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() { 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(int N) { var v1 = new T1[N]; for (int i = 0; i < N; i++) { v1[i] = ReadValue(); } return v1; } public (T1[], T2[]) ReadValueArray(int N) { var (v1, v2) = (new T1[N], new T2[N]); for (int i = 0; i < N; i++) { var (t1, t2) = ReadValue(); v1[i] = t1; v2[i] = t2; } return (v1, v2); } public (T1[], T2[], T3[]) ReadValueArray(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(); v1[i] = t1; v2[i] = t2; v3[i] = t3; } return (v1, v2, v3); } public (T1[], T2[], T3[], T4[]) ReadValueArray(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(); v1[i] = t1; v2[i] = t2; v3[i] = t3; v4[i] = t4; } return (v1, v2, v3, v4); } public (T1[], T2[], T3[], T4[], T5[]) ReadValueArray(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(); 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(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(); 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(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(); 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); } } }