結果
問題 | No.840 ほむほむほむら |
ユーザー | keymoon |
提出日時 | 2019-05-06 13:05:54 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 5,181 bytes |
コンパイル時間 | 1,001 ms |
コンパイル使用メモリ | 116,932 KB |
実行使用メモリ | 30,660 KB |
最終ジャッジ日時 | 2024-06-27 13:47:52 |
合計ジャッジ時間 | 8,994 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
18,560 KB |
testcase_01 | AC | 30 ms
19,072 KB |
testcase_02 | AC | 49 ms
18,932 KB |
testcase_03 | AC | 187 ms
18,852 KB |
testcase_04 | AC | 28 ms
18,816 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 27 ms
18,944 KB |
testcase_21 | AC | 28 ms
18,816 KB |
testcase_22 | AC | 39 ms
18,800 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 27 ms
18,944 KB |
testcase_26 | AC | 43 ms
18,928 KB |
testcase_27 | WA | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.IO; using System.Linq; using System.Collections; using System.Collections.Generic; using System.Text; using System.Numerics; using System.Threading.Tasks; using System.Text.RegularExpressions; using static System.Math; using Debug = System.Diagnostics.Debug; using LayoutKind = System.Runtime.InteropServices.LayoutKind; using MethodImplOptions = System.Runtime.CompilerServices.MethodImplOptions; using MethodImplAttribute = System.Runtime.CompilerServices.MethodImplAttribute; static class P { static void Main() { //matrix[i,j]:vector[i]の要素が1であればi行目のj要素に乗算が行われ、そこに遷移する var nk = Console.ReadLine().Split().Select(int.Parse).ToArray(); int n = nk[0]; int k = nk[1]; ModMatrix matrix = new ModMatrix(k * k * k, k * k * k); //k=2の時 // a : 01010101 // ab : 00110011 //abc : 00001111 for (int i = 0; i < matrix.Height; i++) { int val = i; int aCount = val % k; val /= k; int abCount = val % k; val /= k; int abcCount = val % k; int newACount, newABCount, newABCCount; //aが追加された時 newACount = (aCount + 1) % k; newABCount = abCount; newABCCount = abcCount; matrix[i, (newABCCount * k + newABCount) * k + newACount] += 1; //bが追加された時 newACount = aCount; newABCount = (abCount + aCount) % k; newABCCount = abcCount; matrix[i, (newABCCount * k + newABCount) * k + newACount] += 1; //cが追加された時 newACount = aCount; newABCount = abCount; newABCCount = (abcCount + abCount) % k; matrix[i, (newABCCount * k + newABCount) * k + newACount] += 1; } ModMatrix res = new ModMatrix(1, k * k * k); res[0, 0] = 1; long pow = n; while (n > 0) { if ((n & 1) == 1) res *= matrix; matrix *= matrix; n >>= 1; } long resSum = 0; for (int i = 0; i < k * k; i++) resSum += res[0, i]; Console.WriteLine(resSum % 1000000007); } } class ModMatrix : IEquatable<ModMatrix> { const int MOD = 1000000007; public readonly int Height; public readonly int Width; long[,] data; [MethodImpl(MethodImplOptions.AggressiveInlining)] public ModMatrix(int height, int width) { data = new long[height, width]; Height = height; Width = width; } public long this[int i, int j] { [MethodImpl(MethodImplOptions.AggressiveInlining)] get { return data[i, j]; } [MethodImpl(MethodImplOptions.AggressiveInlining)] set { if ((data[i, j] = value % MOD) < 0) data[i, j] += MOD; } } [MethodImpl(MethodImplOptions.AggressiveInlining)] public bool Equals(ModMatrix other) { if (this.Width != other.Width || this.Height != other.Height) return false; for (int i = 0; i < Height; i++) for (int j = 0; j < Width; j++) if (this[i, j] != other[i, j]) return false; return true; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static ModMatrix Add(ModMatrix a, ModMatrix b) { Debug.Assert(a.Width == b.Width && a.Height == b.Height); var res = new ModMatrix(a.Height, a.Width); for (int i = 0; i < a.Height; i++) for (int j = 0; j < a.Width; j++) if (MOD <= (res.data[i, j] = a[i, j] + b[i, j])) res.data[i, j] -= MOD; return res; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static ModMatrix Sub(ModMatrix a, ModMatrix b) { Debug.Assert(a.Width == b.Width && a.Height == b.Height); var res = new ModMatrix(a.Height, a.Width); for (int i = 0; i < a.Height; i++) for (int j = 0; j < a.Width; j++) if ((res.data[i, j] = a[i, j] - b[i, j]) < 0) res.data[i, j] += MOD; return res; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static ModMatrix Mul(ModMatrix a, ModMatrix b) { Debug.Assert(a.Width == b.Height); var res = new ModMatrix(a.Height, b.Width); for (int i = 0; i < a.Height; i++) for (int j = 0; j < b.Width; j++) { for (int k = 0; k < a.Width; k++) res.data[i, j] += a[i, k] * b[k, j] % MOD; res.data[i, j] %= MOD; } return res; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static ModMatrix operator +(ModMatrix a, ModMatrix b) => Add(a, b); [MethodImpl(MethodImplOptions.AggressiveInlining)] public static ModMatrix operator -(ModMatrix a, ModMatrix b) => Sub(a, b); [MethodImpl(MethodImplOptions.AggressiveInlining)] public static ModMatrix operator *(ModMatrix a, ModMatrix b) => Mul(a, b); [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool operator ==(ModMatrix a, ModMatrix b) => a.Equals(b); [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool operator !=(ModMatrix a, ModMatrix b) => !a.Equals(b); }