結果

問題 No.1340 おーじ君をさがせ
ユーザー fairy_lettucefairy_lettuce
提出日時 2021-01-15 23:38:44
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 566 ms / 2,000 ms
コード長 9,988 bytes
コンパイル時間 1,509 ms
コンパイル使用メモリ 115,872 KB
実行使用メモリ 26,880 KB
最終ジャッジ日時 2024-11-27 23:22:53
合計ジャッジ時間 12,227 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
18,176 KB
testcase_01 AC 29 ms
18,304 KB
testcase_02 AC 27 ms
18,176 KB
testcase_03 AC 27 ms
18,304 KB
testcase_04 AC 27 ms
18,048 KB
testcase_05 AC 27 ms
18,176 KB
testcase_06 AC 27 ms
18,304 KB
testcase_07 AC 27 ms
18,304 KB
testcase_08 AC 26 ms
18,048 KB
testcase_09 AC 29 ms
18,048 KB
testcase_10 AC 29 ms
18,048 KB
testcase_11 AC 132 ms
19,584 KB
testcase_12 AC 43 ms
18,388 KB
testcase_13 AC 106 ms
18,816 KB
testcase_14 AC 251 ms
20,480 KB
testcase_15 AC 212 ms
20,224 KB
testcase_16 AC 39 ms
18,376 KB
testcase_17 AC 88 ms
18,688 KB
testcase_18 AC 134 ms
19,328 KB
testcase_19 AC 31 ms
18,560 KB
testcase_20 AC 28 ms
18,432 KB
testcase_21 AC 137 ms
22,272 KB
testcase_22 AC 302 ms
23,424 KB
testcase_23 AC 139 ms
22,272 KB
testcase_24 AC 552 ms
25,088 KB
testcase_25 AC 45 ms
20,864 KB
testcase_26 AC 39 ms
19,840 KB
testcase_27 AC 35 ms
19,584 KB
testcase_28 AC 49 ms
20,864 KB
testcase_29 AC 33 ms
19,456 KB
testcase_30 AC 146 ms
22,272 KB
testcase_31 AC 560 ms
26,880 KB
testcase_32 AC 526 ms
26,624 KB
testcase_33 AC 521 ms
26,368 KB
testcase_34 AC 472 ms
25,856 KB
testcase_35 AC 566 ms
26,880 KB
testcase_36 AC 27 ms
18,176 KB
testcase_37 AC 37 ms
20,480 KB
testcase_38 AC 560 ms
26,880 KB
testcase_39 AC 179 ms
21,760 KB
testcase_40 AC 187 ms
21,760 KB
testcase_41 AC 186 ms
21,888 KB
testcase_42 AC 26 ms
18,304 KB
testcase_43 AC 27 ms
18,176 KB
testcase_44 AC 28 ms
18,176 KB
testcase_45 AC 26 ms
18,304 KB
testcase_46 AC 129 ms
19,584 KB
testcase_47 AC 135 ms
19,712 KB
testcase_48 AC 148 ms
19,840 KB
testcase_49 AC 155 ms
19,072 KB
testcase_50 AC 154 ms
19,072 KB
testcase_51 AC 155 ms
18,944 KB
testcase_52 AC 277 ms
20,608 KB
testcase_53 AC 270 ms
20,480 KB
testcase_54 AC 276 ms
20,608 KB
testcase_55 AC 204 ms
20,352 KB
testcase_56 AC 28 ms
17,920 KB
testcase_57 AC 27 ms
18,048 KB
testcase_58 AC 27 ms
18,048 KB
testcase_59 AC 98 ms
18,560 KB
testcase_60 AC 27 ms
18,304 KB
testcase_61 AC 98 ms
18,560 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.F
{
	public class Solver
	{
		Scanner sr;
		StreamWriter sw;

		bool isMultipleTestCases = false;

		public void Solve()
		{
			var (n, m, t) = sr.ReadValue<int, int, long>();
			var (a, b) = sr.ReadValueArray<int, int>(m);
			var vec = new Matrix(n, 1);
			vec[0, 0] = 1;
			var matrix = new Matrix(n, n);
			for (int i = 0; i < m; i++)
			{
				matrix[b[i], a[i]] = 1;
			}
			var ans = Matrix.Pow(matrix, t) * vec;
			var ansc = 0;
			for (int i = 0; i < n; i++)
			{
				if (ans[i, 0] == 1) ansc++;
			}
			Console.WriteLine(ansc);
		}

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

	class Matrix
	{
		int row;
		int column;
		public long[] value;

		public Matrix(int r, int c)
		{
			value = new long[r * c];
			row = r;
			column = c;
		}

		public long this[int r, int c]
		{
			get { return this.value[r * column + c]; }
			set { this.value[r * column + c] = value; }
		}

		public static Matrix operator *(Matrix l, Matrix r)
		{
			if (l.column != r.row) throw new ArgumentException();
			var ret = new Matrix(l.row, r.column);
			for (int i = 0; i < l.row; i++)
			{
				for (int j = 0; j < r.column; j++)
				{
					for (int k = 0; k < l.column; k++)
					{
						ret[i, j] |= l[i, k] & r[k, j];
					}
				}
			}
			return ret;
		}

		public Matrix Pow(long n) => Pow(this, n);

		public static Matrix Pow(Matrix x, long n)
		{
			if (x.column != x.row) throw new ArgumentException();
			var ret = new Matrix(x.column, x.column);
			for (int i = 0; i < x.column; i++)
			{
				ret[i, i] = 1;
			}

			for (long i = 1; i <= n; i *= 2, x *= x)
			{
				if (n / i % 2 == 1) ret *= x;
			}

			return ret;
		}
	}

	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