結果

問題 No.1112 冥界の音楽
ユーザー eSeFeSeF
提出日時 2020-07-10 22:24:39
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 566 ms / 2,000 ms
コード長 10,133 bytes
コンパイル時間 936 ms
コンパイル使用メモリ 118,112 KB
実行使用メモリ 30,772 KB
最終ジャッジ日時 2024-04-19 17:34:54
合計ジャッジ時間 5,487 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
25,544 KB
testcase_01 AC 27 ms
26,484 KB
testcase_02 AC 28 ms
27,976 KB
testcase_03 AC 28 ms
28,736 KB
testcase_04 AC 28 ms
26,604 KB
testcase_05 AC 28 ms
25,820 KB
testcase_06 AC 114 ms
25,544 KB
testcase_07 AC 27 ms
27,120 KB
testcase_08 AC 27 ms
27,460 KB
testcase_09 AC 35 ms
27,584 KB
testcase_10 AC 28 ms
26,868 KB
testcase_11 AC 39 ms
26,748 KB
testcase_12 AC 28 ms
26,988 KB
testcase_13 AC 25 ms
26,744 KB
testcase_14 AC 525 ms
29,104 KB
testcase_15 AC 87 ms
25,800 KB
testcase_16 AC 28 ms
27,580 KB
testcase_17 AC 162 ms
26,468 KB
testcase_18 AC 152 ms
26,612 KB
testcase_19 AC 28 ms
26,360 KB
testcase_20 AC 47 ms
28,780 KB
testcase_21 AC 387 ms
30,772 KB
testcase_22 AC 566 ms
28,720 KB
testcase_23 AC 128 ms
25,556 KB
testcase_24 AC 28 ms
27,588 KB
testcase_25 AC 27 ms
26,472 KB
testcase_26 AC 27 ms
25,680 KB
testcase_27 AC 27 ms
26,740 KB
testcase_28 AC 32 ms
26,608 KB
testcase_29 AC 27 ms
26,476 KB
testcase_30 AC 369 ms
27,852 KB
testcase_31 AC 33 ms
26,728 KB
testcase_32 AC 397 ms
28,720 KB
testcase_33 AC 28 ms
26,864 KB
testcase_34 AC 26 ms
25,804 KB
testcase_35 AC 26 ms
26,608 KB
testcase_36 AC 27 ms
28,612 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.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Numerics;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Diagnostics;
using static System.Math;
using static System.Array;
using static AtCoder.Sc_out;
using static AtCoder.Tool;
using static AtCoder.ModInt;
namespace AtCoder
{
    class AC
    {
        const int MOD = 1000000007;
        //const int MOD = 998244353;

        const int INF = int.MaxValue / 2;
        const long SINF = long.MaxValue / 2;
        const double EPS = 1e-8;
        static readonly int[] dI = { 0, 1, 0, -1, 1, -1, -1, 1 };
        static readonly int[] dJ = { 1, 0, -1, 0, 1, 1, -1, -1 };
        //static List<List<int>> G = new List<List<int>>();
        //static List<List<Edge>> G = new List<List<Edge>>();
        //static List<Edge> E = new List<Edge>();
        static void Main(string[] args)
        {
            //var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw);

            var th = new Thread(Run, 1 << 26);
            th.Start();
            th.Join();

            //Run();
            Console.Out.Flush();
        }
        static void Run()
        {
            int Testcase = 1;
            for (var _ = 0; _ < Testcase; _++) Solve();
        }
        static void Solve()
        {
            Cin.Input(out int K, out int M, out long N);
            if (M == 216)
            {
                OutL(Modpow(6, N - 2).value);
                return;
            }
            var D = new long[M][];
            for (var i = 0; i < M; i++) D[i] = new long[M];
            var P = new long[M];
            var Q = new long[M];
            var R = new long[M];
            for (var i = 0; i < M; i++) Cin.Input(out P[i], out Q[i], out R[i]);

            for(var i = 0; i < M; i++)
            {
                for (var j = i; j < M; j++) 
                {
                    if (Q[i] == P[j] && R[i] == Q[j]) D[j][i]++;
                    if (i != j && Q[j] == P[i] && R[j] == Q[i]) D[i][j]++;
                }
            }
            //for (var i = 0; i < M; i++) Out_Sep(D[i]);
            var init = new long[M];
            for (var i = 0; i < M; i++) if (P[i] == 1) init[i] = 1;
            D = pow(D, N - 3, M);
            //for (var i = 0; i < M; i++) Out_Sep(D[i]);
            ModInt ans = 0;
            for (var i = 0; i < M; i++)
            {
                if (R[i] != 1) continue;
                long ret = 0;
                for(var j = 0; j < M; j++)
                {
                    ret += init[j] * D[i][j] % MOD;
                    ret %= MOD;
                }
                ans += ret;
            }
            OutL(ans.value);
            //Out_Sep(fin);

        }
        static long[][] mul(long[][] a, long[][] b)
        {
            var res = new long[a.Length][];
            for (int i = 0; i < a.Length; i++)
            {
                res[i] = new long[b[0].Length];
                for (int j = 0; j < b[0].Length; j++)
                {
                    for (int k = 0; k < b.Length; k++)
                    {
                        res[i][j] = (res[i][j] + a[i][k] * b[k][j]) % MOD;
                    }
                }
            }
            return res;
        }
        static long[] mul(long[][] a, long[] b)
        {
            var res = new long[a.Length];
            for (int i = 0; i < a.Length; i++)
            {
                for (int j = 0; j < b.Length; j++)
                {
                    res[i] = (res[i] + a[i][j] * b[j]) % MOD;
                }
            }
            return res;
        }

        static long[][] pow(long[][] mat, long k, int size)
        {
            if (k == 0)
            {
                var res = new long[size][];
                for (int i = 0; i < size; i++)
                {
                    res[i] = new long[size];
                    res[i][i] = 1;
                }
                return res;
            }
            else
            {
                var res = pow(mat, k / 2, size);
                res = mul(res, res);
                if (k % 2 == 1)
                {
                    res = mul(res, mat);
                }
                return res;
            }
        }
        public struct Edge
        {
            public int from;

            public int to;
            public long dist;

            public Edge(int t, long c)
            {
                from = -1;
                to = t;
                dist = c;
            }
            public Edge(int f, int t, long c)
            {
                from = f;
                to = t;
                dist = c;
            }
        }
    }
    struct ModInt
    {
        public long value;
        private const int MOD = 1000000007;
        //private const int MOD = 998244353;
        public ModInt(long value) { this.value = value; }
        public static implicit operator ModInt(long a)
        {
            var ret = a % MOD;
            return new ModInt(ret < 0 ? (ret + MOD) : ret);
        }
        public static ModInt operator +(ModInt a, ModInt b) => (a.value + b.value);
        public static ModInt operator -(ModInt a, ModInt b) => (a.value - b.value);
        public static ModInt operator *(ModInt a, ModInt b) => (a.value * b.value);
        public static ModInt operator /(ModInt a, ModInt b) => a * Modpow(b, MOD - 2);
        public static ModInt operator <<(ModInt a, int n) => (a.value << n);
        public static ModInt operator >>(ModInt a, int n) => (a.value >> n);
        public static ModInt operator ++(ModInt a) => a.value + 1;
        public static ModInt operator --(ModInt a) => a.value - 1;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt Modpow(ModInt a, long n)
        {
            var k = a;
            ModInt ret = 1;
            while (n > 0)
            {
                if ((n & 1) != 0) ret *= k;
                k *= k;
                n >>= 1;
            }
            return ret;
        }
        private static readonly List<long> Factorials = new List<long>() { 1 };
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt Fac(long n)
        {
            for (var i = Factorials.Count(); i <= n; i++)
            {
                Factorials.Add((Factorials[i - 1] * i) % MOD);
            }
            return Factorials[(int)n];
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt nCr(long n, long r)
        {
            return n < r ? 0 : Fac(n) / (Fac(r) * Fac(n - r));
        }
        public static explicit operator int(ModInt a) => (int)a.value;
    }
    static class Cin
    {
        public static string[] ReadSplit => Console.ReadLine().Split();
        public static int[] ReadSplitInt => ConvertAll(Console.ReadLine().Split(), int.Parse);
        public static long[] ReadSplitLong => ConvertAll(Console.ReadLine().Split(), long.Parse);
        public static double[] ReadSplit_Double => ConvertAll(Console.ReadLine().Split(), double.Parse);
        public static string Str => Console.ReadLine();
        public static int Int => int.Parse(Console.ReadLine());
        public static long Long => long.Parse(Console.ReadLine());
        public static double Double => double.Parse(Console.ReadLine());
        public static T Conv<T>(string input)
        {
            if (typeof(T).Equals(typeof(ModInt)))
            {
                return (T)(dynamic)(long.Parse(input));
            }
            return (T)Convert.ChangeType(input, typeof(T));
        }
        public static void Input<T>(out T a) => a = Conv<T>(Console.ReadLine());
        public static void Input<T, U>(out T a, out U b)
        { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); }
        public static void Input<T, U, V>(out T a, out U b, out V c)
        { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); }
        public static void Input<T, U, V, W>(out T a, out U b, out V c, out W d)
        { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); }
        public static void Input<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
        { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); e = Conv<X>(q[4]); }
    }
    static class Sc_out
    {
        public static void OutL(object s) => Console.WriteLine(s);
        public static void Out_Sep<T>(IEnumerable<T> s) => Console.WriteLine(string.Join(" ", s));
        public static void Out_Sep<T>(IEnumerable<T> s, string sep) => Console.WriteLine(string.Join($"{sep}", s));
        public static void Out_Sep(params object[] s) => Console.WriteLine(string.Join(" ", s));
        public static void Out_One(object s) => Console.Write($"{s} ");
        public static void Out_One(object s, string sep) => Console.Write($"{s}{sep}");
        public static void Endl() => Console.WriteLine();
    }
    public static class Tool
    {
        static public void Initialize<T>(ref T[] array, T initialvalue)
        {
            array = ConvertAll(array, x => initialvalue);
        }
        static public void Swap<T>(ref T a, ref T b)
        {
            T keep = a;
            a = b;
            b = keep;
        }
        static public void Display<T>(T[,] array2d, int n, int m)
        {
            for (var i = 0; i < n; i++)
            {
                for (var j = 0; j < m; j++)
                {
                    Console.Write($"{array2d[i, j]} ");
                }
                Console.WriteLine();
            }
        }
        static public long Gcd(long a, long b)
        {
            if (a == 0 || b == 0) return Max(a, b);
            return a % b == 0 ? b : Gcd(b, a % b);
        }
        static public long LPow(int a, int b) => (long)Pow(a, b);
        static public bool Bit(long x, int dig) => ((1L << dig) & x) != 0;
        static public int Sig(long a) => a == 0 ? 0 : (int)(a / Abs(a));
    }
}
0