#433181 (C#(csc)) No.997 Jumping Kangaroo

• 問題: No.997 Jumping Kangaroo
• ユーザー: EmKjp
• 提出日時: 2020-02-21 23:53:47
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 28 ms / 2,000 ms
• コード長: 10,728 bytes
• コンパイル時間: 2,415 ms
• コンパイル使用メモリ: 108,672 KB
• 実行使用メモリ: 18,048 KB
• 最終ジャッジ日時: 2024-10-09 03:00:56
• 合計ジャッジ時間: 4,489 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 25

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

using System;
using System.Collections;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    public void Run() {
        var mod = ModInt.SetModValue(1000000007);

        var n = ni();
        var w = ni();
        var k = nl();
        var a = ni(n);

        var p = new ModInt[3 * w + 10];
        p[0] = 1;
        for (int i = 1; i < p.Length; i++) {
            foreach (var x in a) {
                if (i - x >= 0) {
                    p[i] += p[i - x];
                }
            }
        }

        var M = new ModMatrix(2, 2, mod);
        M[0, 0] = 0; M[0, 1] = 1;
        M[1, 0] = (p[2 * w] - p[w] * p[w]).ToInt(); M[1, 1] = p[w].ToInt();

        var b = new ModMatrix(2, 1, mod);
        b[0, 0] = 1;
        b[1, 0] = p[w].ToInt();

        var y = ModMatrix.Pow(M, k) * b;

        cout.WriteLine(y[0, 0]);
    }
}

public class ModMatrix {
    public int Row { get; private set; }
    public int Col { get; private set; }
    public int Mod { get; private set; }
    private long[] Data;
    public ModMatrix(int row, int col, int mod) {
        Row = row;
        Col = col;
        Data = new long[Row * Col];
        Mod = mod;
    }

    public ModMatrix(long[,] array, int mod)
        : this(array.GetLength(0), array.GetLength(1), mod) {
        int index = 0;
        for (int i = 0; i < Row; i++) {
            for (int j = 0; j < Col; j++) {
                Data[index++] = array[i, j] % mod;
            }
        }
    }

    public long this[int row, int col] {
        set {
            Data[row * Col + col] = value;
        }
        get {
            return Data[row * Col + col];
        }
    }

    public static ModMatrix UnitMatrix(int n, int mod) {
        var matrix = new ModMatrix(n, n, mod);
        for (int i = 0; i < n; i++) {
            matrix[i, i] = 1;
        }
        return matrix;
    }

    public static ModMatrix operator +(ModMatrix A, ModMatrix B) {
        if (A.Mod != B.Mod) {
            throw new InvalidOperationException("A.Mod must be equal to B.Mod");
        }

        var C = new ModMatrix(A.Row, A.Col, A.Mod);
        for (int i = 0; i < C.Data.Length; i++) {
            C.Data[i] = (A.Data[i] + B.Data[i] + A.Mod) % A.Mod;
        }
        return C;
    }

    public static ModMatrix operator -(ModMatrix A, ModMatrix B) {
        if (A.Mod != B.Mod) {
            throw new InvalidOperationException("A.Mod must be equal to B.Mod");
        }

        var C = new ModMatrix(A.Row, A.Col, A.Mod);
        for (int i = 0; i < C.Data.Length; i++) {
            C.Data[i] = (A.Data[i] - B.Data[i] + A.Mod) % A.Mod;
        }
        return C;
    }

    public static ModMatrix operator *(ModMatrix A, ModMatrix B) {
        if (A.Mod != B.Mod) {
            throw new InvalidOperationException("A.Mod must be equal to B.Mod");
        }

        var C = new ModMatrix(A.Row, B.Col, A.Mod);
        for (int i = 0; i < A.Row; i++) {
            for (int j = 0; j < B.Col; j++) {
                long val = C[i, j];
                for (int k = 0; k < A.Col; k++) {
                    val = (val + A[i, k] * B[k, j]) % A.Mod;
                }

                if (val < 0) {
                    val += A.Mod;
                }

                C[i, j] = val;
            }
        }
        return C;
    }

    public static ModMatrix Pow(ModMatrix A, long n) {
        if (n == 0) {
            return UnitMatrix(A.Row, A.Mod);
        }

        if (n == 1) {
            return A;
        }

        ModMatrix result = A.Clone(), t = A.Clone(); n--;
        while (n > 0) {
            if ((n & 1) != 0) {
                result = result * t;
            }
            t = t * t;
            n >>= 1;
        }

        return result;
    }

    public ModMatrix Clone() {
        return new ModMatrix(Row, Col, Mod) { Data = Data.Clone() as long[] };
    }
}
public struct ModInt {
    private static int mod = 0;
    private long value;

    public ModInt(long x) {
        value = x;
        Normalize();
    }

    private static long RegularMod(long x, int mod) {
        if (x >= mod) {
            if (x < 2 * mod) {
                return x - mod;
            }

            return x % mod;
        }
        if (x >= 0) {
            return x;
        }

        x = mod - RegularMod(-x, mod);
        if (x == mod) {
            return 0;
        }

        return x;
    }

    public static int SetModValue(int m) {
        return mod = m;
    }

    private void Normalize() {
        value = RegularMod(value, mod);
    }

    public override string ToString() {
        return value.ToString(CultureInfo.InvariantCulture);
    }

    public int ToInt() {
        return (int)value;
    }

    public static bool operator ==(ModInt c1, ModInt c2) {
        return c1.value == c2.value;
    }

    public static bool operator !=(ModInt c1, ModInt c2) {
        return !(c1 == c2);
    }

    public static ModInt operator +(ModInt x, ModInt y) {
        return new ModInt(x.value + y.value);
    }
    public static ModInt operator -(ModInt x, ModInt y) {
        return new ModInt(x.value - y.value);
    }
    public static ModInt operator *(ModInt x, ModInt y) {
        return new ModInt(x.value * y.value);
    }
    public static ModInt operator /(ModInt x, ModInt y) {
        return new ModInt(x.value * Inverse(y.value, mod));
    }
    public static ModInt operator ++(ModInt x) {
        return x + 1;
    }
    public static ModInt operator --(ModInt x) {
        return x - 1;
    }
    public static ModInt Pow(ModInt x, long n) {
        ModInt r = 1;
        while (n > 0) {
            if ((n & 1) != 0) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    private static long ExtendedGcd(long a, long b, ref long x, ref long y) {
        if (b == 0) {
            x = 1; y = 0;
            return a;
        } else {
            long d = ExtendedGcd(b, a % b, ref y, ref x);
            y -= a / b * x;
            return d;
        }
    }

    private static long Inverse(long a, long mod) {
        long x = 0, y = 0;
        if (ExtendedGcd(a, mod, ref x, ref y) == 1) {
            return (x + mod) % mod;
        } else {
            throw new Exception("Invalid inverse " + a + " " + mod);
        }
    }

    public static implicit operator ModInt(long x) {
        return new ModInt(x);
    }

    public override bool Equals(object obj) {
        if (obj == null) {
            return false;
        }
        return value.Equals(((ModInt)obj).value);
    }

    public override int GetHashCode() {
        return value.GetHashCode();
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}