#654584 (Java21) No.1547 [Cherry 2nd Tune *] 偶然の勝利の確率

提出ソース
結果

問題	No.1547 [Cherry 2nd Tune *] 偶然の勝利の確率
ユーザー	遭難者
提出日時	2021-05-06 13:57:36
言語	Java21 (openjdk 21)
結果	AC
実行時間	991 ms / 2,000 ms
コード長	19,976 bytes
コンパイル時間	3,154 ms
コンパイル使用メモリ	96,988 KB
実行使用メモリ	54,716 KB
最終ジャッジ日時	2024-05-08 18:29:57
合計ジャッジ時間	17,863 ms
ジャッジサーバーID （参考情報）	judge4 / judge3
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	54 ms 50,156 KB
testcase_01	AC	53 ms 50,256 KB
testcase_02	AC	113 ms 52,072 KB
testcase_03	AC	53 ms 50,360 KB
testcase_04	AC	55 ms 50,368 KB
testcase_05	AC	55 ms 50,256 KB
testcase_06	AC	56 ms 50,432 KB
testcase_07	AC	54 ms 50,300 KB
testcase_08	AC	53 ms 50,300 KB
testcase_09	AC	55 ms 50,184 KB
testcase_10	AC	54 ms 50,292 KB
testcase_11	AC	53 ms 50,280 KB
testcase_12	AC	53 ms 50,340 KB
testcase_13	AC	220 ms 51,792 KB
testcase_14	AC	165 ms 52,004 KB
testcase_15	AC	118 ms 51,916 KB
testcase_16	AC	137 ms 52,000 KB
testcase_17	AC	137 ms 51,932 KB
testcase_18	AC	133 ms 51,904 KB
testcase_19	AC	97 ms 51,908 KB
testcase_20	AC	539 ms 54,156 KB
testcase_21	AC	121 ms 51,980 KB
testcase_22	AC	57 ms 50,068 KB
testcase_23	AC	990 ms 54,584 KB
testcase_24	AC	991 ms 54,656 KB
testcase_25	AC	987 ms 54,716 KB
testcase_26	AC	988 ms 54,540 KB
testcase_27	AC	982 ms 54,460 KB
testcase_28	AC	979 ms 54,656 KB
testcase_29	AC	986 ms 54,476 KB
testcase_30	AC	981 ms 54,400 KB
testcase_31	AC	985 ms 54,560 KB
testcase_32	AC	988 ms 54,704 KB
testcase_33	AC	949 ms 54,632 KB
testcase_34	AC	96 ms 52,156 KB
testcase_35	AC	94 ms 52,012 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
import java.util.*;
import java.io.*;

class Main {
    private static void solve(ContestScanner sc, ContestPrinter ou) {
        long ma = (sc.nextLong() * inv(sc.nextLong())) % mod;
        int s = sc.nextInt();
        long mb = (sc.nextLong() * inv(sc.nextLong())) % mod;
        int t = sc.nextInt();
        int k = sc.nextInt();
        int n = s + t;
        var a = new long[n + 1][n + 1];
        var b = new long[n + 1][n + 1];
        for (int i = 1; i < n; i++) {
            a[i][0]++;
            b[i][n]++;
        }
        a[0][0] = a[n][n] = b[0][0] = b[n][n] = 1;
        long mma, mmb;
        for (int i = 1; i < n; i++) {
            mma = mod + 1 - ma;
            mmb = mod + 1 - mb;
            for (int j = i; j > 0; j--) {
                a[i][j] = mma;
                a[i][0] -= mma;
                if (a[i][0] < 0)
                    a[i][0] += mod;
                mma *= ma;
                mma %= mod;
            }
            for (int j = i; j < n; j++) {
                b[i][j] = mmb;
                b[i][n] -= mmb;
                if (b[i][n] < 0)
                    b[i][n] += mod;
                mmb *= mb;
                mmb %= mod;
            }
        }
        var aa = new Matrix(a, mod);
        aa.mulAsg(b);
        var r = aa.pow(k);
        ou.println(r[s][0]);
        ou.println(r[s][n]);
    }

    private static long mp(long a, long b) {
        if (b == 0)
            return 1;
        if ((b & 1) == 1)
            return (a * mp(a, b - 1)) % mod;
        return mp((a * a) % mod, b >> 1);
    }

    private static long inv(long a) {
        return mp(a, mod - 2);
    }

    private static int mod = 998244353;

    public static void main(String[] args) {
        var sc = new ContestScanner();
        var ou = new ContestPrinter();
        solve(sc, ou);
        ou.flush();
        ou.close();
    }
}

class Matrix {
    private long[][] a;
    private long mod;
    private int n;

    public Matrix(long[][] a, long mod) {
        this.a = a;
        this.n = a.length;
        this.mod = mod;
    }

    public Matrix(long mod) {
        this.mod = mod;
    }

    public long[][] get() {
        return a;
    }

    public long[][] add(long[][] a) {
        long[][] c = new long[n][n];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                c[i][j] = (this.a[i][j] + a[i][j]) % mod;
        return c;
    }

    public void addAsg(long[][] a) {
        this.a = this.add(a);
    }

    public long[][] sub(long[][] a) {
        long[][] c = new long[n][n];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                c[i][j] = (this.a[i][j] - a[i][j]) % mod;
        return c;
    }

    public void subAsg(long[][] a) {
        this.a = this.sub(a);
    }

    public long[][] mul(long[][] b) {
        var c = new long[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                for (int k = 0; k < n; k++) {
                    c[i][j] += a[i][k] * b[k][j];
                    c[i][j] %= mod;
                }
            }
        }
        return c;
    }

    public void mulAsg(long[][] a) {
        this.a = this.mul(a);
    }

    public long[][] pow(long n) {
        long[][] a = new long[this.n][this.n];
        if (n == 0) {
            for (int i = 0; i < this.n; i++)
                for (int j = 0; j < this.n; j++)
                    a[i][j] = 1;
            return a;
        }
        long[][] b = new long[this.n][this.n];
        for (int i = 0; i < this.n; i++)
            for (int j = 0; j < this.n; j++)
                a[i][j] = b[i][j] = this.a[i][j];
        n--;
        while (n != 0) {
            if ((n & 1) == 1)
                a = new Matrix(a, mod).mul(b);
            b = new Matrix(b, mod).mul(b);
            n >>= 1;
        }
        return a;
    }

    public long det() {
        long[][] a = new long[this.n][this.n];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                a[i][j] = this.a[i][j];
        long det = 1;
        for (int i = 0; i < n; i++) {
            if (a[i][i] == 0) {
                for (int j = i + 1; j < n; j++) {
                    if (a[j][i] != 0) {
                        for (int k = 0; k < n; k++) {
                            long d = a[i][k];
                            a[i][k] = a[j][k];
                            a[j][k] = d;
                        }
                        break;
                    }
                    if (j == n - 1)
                        return 0;
                }
            }
            for (int j = i + 1; j < n; j++) {
                long r = a[j][i] / a[i][i];
                for (int k = 0; k < n; k++) {
                    a[j][k] += r * a[i][k];
                    a[j][k] %= 2;
                }
            }
        }
        for (int i = 0; i < n; i++)
            det *= a[i][i];
        return det;
    }
}

class ContestScanner {
    private final InputStream in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    public ContestScanner(InputStream in) {
        this.in = in;
    }

    public ContestScanner() {
        this(System.in);
    }

    private boolean hasNextByte() {
        if (ptr < buflen)
            return true;
        ptr = 0;
        try {
            buflen = in.read(buffer);
        } catch (IOException e) {
            e.printStackTrace();
        }
        if (buflen <= 0)
            return false;
        return true;
    }

    private int readByte() {
        return hasNextByte() ? buffer[ptr++] : -1;
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public void nextThrow(int n) {
        for (int i = 0; i < n; i++)
            this.next();
    }

    public void nextThrow() {
        this.nextThrow(1);
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b)
            throw new NumberFormatException();
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b))
                return minus ? -n : n;
            else
                throw new NumberFormatException();
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public boolean[] nextBoolean(char True) {
        String s = this.next();
        int n = s.length();
        boolean[] array = new boolean[n];
        for (int i = 0; i < n; i++)
            array[i] = s.charAt(i) == True;
        return array;
    }

    public long[] nextLongArray(int length) {
        long[] array = new long[length];
        for (int i = 0; i < length; i++)
            array[i] = this.nextLong();
        return array;
    }

    public long[] nextLongArray(int length, java.util.function.LongUnaryOperator map) {
        long[] array = new long[length];
        for (int i = 0; i < length; i++)
            array[i] = map.applyAsLong(this.nextLong());
        return array;
    }

    public long[] nextLongArray(int length, long[] a) {
        long[] array = new long[length + a.length];
        for (int i = 0; i < length; i++)
            array[i] = this.nextLong();
        for (int i = length; i < array.length; i++)
            array[i] = a[i - length];
        return array;
    }

    public int[] nextIntArray(int length) {
        int[] array = new int[length];
        for (int i = 0; i < length; i++)
            array[i] = this.nextInt();
        return array;
    }

    public int[] nextIntArray(int length, java.util.function.IntUnaryOperator map) {
        int[] array = new int[length];
        for (int i = 0; i < length; i++)
            array[i] = map.applyAsInt(this.nextInt());
        return array;
    }

    public int[] nextIntArray(int length, int[] array) {
        int n = length + array.length;
        int[] a = new int[n];
        for (int i = 0; i < length; i++)
            a[i] = this.nextInt();
        for (int i = length; i < n; i++)
            a[i] = array[i - length];
        return a;
    }

    public Integer[] nextIntegerArray(int length, java.util.function.IntUnaryOperator map) {
        Integer[] array = new Integer[length];
        for (int i = 0; i < length; i++)
            array[i] = map.applyAsInt(this.nextInt());
        return array;
    }

    public Integer[] nextIntegerArray(int length) {
        Integer[] array = new Integer[length];
        for (int i = 0; i < length; i++)
            array[i] = this.nextInt();
        return array;
    }

    public double[] nextDoubleArray(int length) {
        double[] array = new double[length];
        for (int i = 0; i < length; i++)
            array[i] = this.nextDouble();
        return array;
    }

    public double[] nextDoubleArray(int length, java.util.function.DoubleUnaryOperator map) {
        double[] array = new double[length];
        for (int i = 0; i < length; i++)
            array[i] = map.applyAsDouble(this.nextDouble());
        return array;
    }

    public String[] nextArray(int length) {
        String[] array = new String[length];
        for (int i = 0; i < length; i++)
            array[i] = this.next();
        return array;
    }

    public long[][] nextLongMatrix(int height, int width) {
        long[][] mat = new long[height][width];
        for (int h = 0; h < height; h++)
            for (int w = 0; w < width; w++)
                mat[h][w] = this.nextLong();
        return mat;
    }

    public int[][] nextIntMatrix(int height, int width) {
        int[][] mat = new int[height][width];
        for (int h = 0; h < height; h++)
            for (int w = 0; w < width; w++)
                mat[h][w] = this.nextInt();
        return mat;
    }

    public int[][] nextIntMatrix(int height, int width, java.util.function.IntUnaryOperator map) {
        int[][] mat = new int[height][width];
        for (int h = 0; h < height; h++)
            for (int w = 0; w < width; w++)
                mat[h][w] = map.applyAsInt(this.nextInt());
        return mat;
    }

    public double[][] nextDoubleMatrix(int height, int width) {
        double[][] mat = new double[height][width];
        for (int h = 0; h < height; h++)
            for (int w = 0; w < width; w++)
                mat[h][w] = this.nextDouble();
        return mat;
    }

    public boolean[][] nextBooleanMatrix(int height, int width, char True) {
        boolean[][] mat = new boolean[height][width];
        for (int h = 0; h < height; h++) {
            String s = this.next();
            for (int w = 0; w < width; w++)
                mat[h][w] = s.charAt(w) == True;
        }
        return mat;
    }

    public char[][] nextCharMatrix(int height, int width) {
        char[][] mat = new char[height][width];
        for (int h = 0; h < height; h++) {
            String s = this.next();
            for (int w = 0; w < width; w++)
                mat[h][w] = s.charAt(w);
        }
        return mat;
    }

    public char[][] nextCharMatrix(int height, int width, int h, int w, char c) {
        char[][] mat = new char[height + 2 * h][width + 2 * w];
        for (int i = 0; i < height; i++) {
            String s = this.next();
            for (int j = 0; j < width; j++)
                mat[i + h][j + w] = s.charAt(j);
        }
        for (int i = 0; i < h; i++)
            for (int j = 0; j < 2 * w + width; j++)
                mat[i][j] = c;
        for (int i = h + height; i < 2 * h + height; i++)
            for (int j = 0; j < 2 * w + width; j++)
                mat[i][j] = c;
        for (int i = h; i < h + height; i++) {
            for (int j = 0; j < w; j++)
                mat[i][j] = c;
            for (int j = w + width; j < 2 * w + width; j++)
                mat[i][j] = c;
        }
        return mat;
    }

    public boolean[][] nextBooleanMatrix(int height, int width, int h, int w, char c) {
        boolean[][] mat = new boolean[height + 2 * h][width + 2 * w];
        for (int i = 0; i < height; i++) {
            String s = this.next();
            for (int j = 0; j < width; j++)
                mat[i + h][j + w] = s.charAt(j) == c;
        }
        return mat;
    }
}

class ContestPrinter extends PrintWriter {
    public ContestPrinter(PrintStream stream) {
        super(stream);
    }

    public ContestPrinter() {
        super(System.out);
    }

    private static String dtos(double x, int n) {
        StringBuilder sb = new StringBuilder();
        if (x < 0) {
            sb.append('-');
            x = -x;
        }
        x += Math.pow(10, -n) / 2;
        sb.append((long) x);
        sb.append(".");
        x -= (long) x;
        for (int i = 0; i < n; i++) {
            x *= 10;
            sb.append((int) x);
            x -= (int) x;
        }
        return sb.toString();
    }

    @Override
    public void print(float f) {
        super.print(dtos(f, 20));
    }

    @Override
    public void println(float f) {
        super.println(dtos(f, 20));
    }

    @Override
    public void print(double d) {
        super.print(dtos(d, 20));
    }

    @Override
    public void println(double d) {
        super.println(dtos(d, 20));
    }

    public void printlnArray(String[] array) {
        for (String i : array)
            super.println(i);
    }

    public void printSpace(Object... o) {
        int n = o.length - 1;
        for (int i = 0; i < n; i++) {
            super.print(o[i]);
            super.print(" ");
        }
        super.println(o[n]);
    }

    public void println(Object... o) {
        int n = o.length - 1;
        for (int i = 0; i < n; i++)
            super.print(o[i]);
        super.println(o[n]);
    }

    public void print(Object... o) {
        int n = o.length - 1;
        for (int i = 0; i < n; i++)
            super.print(o[i]);
        super.print(o[n]);
    }

    public void printArray(Object[] array) {
        int n = array.length - 1;
        for (int i = 0; i < n; i++) {
            super.print(array[i]);
            super.print(" ");
        }
        super.println(array[n]);
    }

    public void printArray(int[] array, String separator) {
        int n = array.length - 1;
        for (int i = 0; i < n; i++) {
            super.print(array[i]);
            super.print(separator);
        }
        super.println(array[n]);
    }

    public void printArray(int[] array) {
        this.printArray(array, " ");
    }

    public void printArray(Integer[] array) {
        this.printArray(array, " ");
    }

    public void printArray(Integer[] array, String separator) {
        int n = array.length - 1;
        for (int i = 0; i < n; i++) {
            super.print(array[i]);
            super.print(separator);
        }
        super.println(array[n]);
    }

    public void printlnArray(int[] array) {
        for (int i : array)
            super.println(i);
    }

    public void printArray(int[] array, String separator, java.util.function.IntUnaryOperator map) {
        int n = array.length - 1;
        for (int i = 0; i < n; i++) {
            super.print(map.applyAsInt(array[i]));
            super.print(separator);
        }
        super.println(map.applyAsInt(array[n]));
    }

    public void printlnArray(int[] array, java.util.function.IntUnaryOperator map) {
        for (int i : array)
            super.println(map.applyAsInt(i));
    }

    public void printlnArray(long[] array, java.util.function.LongUnaryOperator map) {
        for (long i : array)
            super.println(map.applyAsLong(i));
    }

    public void printArray(int[] array, java.util.function.IntUnaryOperator map) {
        this.printArray(array, " ", map);
    }

    public void printArray(long[] array, String separator) {
        int n = array.length - 1;
        for (int i = 0; i < n; i++) {
            super.print(array[i]);
            super.print(separator);
        }
        super.println(array[n]);
    }

    public void printArray(long[] array) {
        this.printArray(array, " ");
    }

    public void printlnArray(long[] array) {
        for (long i : array)
            super.println(i);
    }

    public void printArray(double[] array) {
        printArray(array, " ");
    }

    public void printArray(double[] array, String separator) {
        int n = array.length - 1;
        for (int i = 0; i < n; i++) {
            super.print(array[i]);
            super.print(separator);
        }
        super.println(array[n]);
    }

    public void printlnArray(double[] array) {
        for (double i : array)
            super.println(i);
    }

    public void printArray(boolean[] array, String a, String b) {
        int n = array.length - 1;
        for (int i = 0; i < n; i++)
            super.print((array[i] ? a : b) + " ");
        super.println(array[n] ? a : b);
    }

    public void printArray(boolean[] array) {
        this.printArray(array, "Y", "N");
    }

    public void printArray(long[] array, String separator, java.util.function.LongUnaryOperator map) {
        int n = array.length - 1;
        for (int i = 0; i < n; i++) {
            super.print(map.applyAsLong(array[i]));
            super.print(separator);
        }
        super.println(map.applyAsLong(array[n]));
    }

    public void printArray(long[] array, java.util.function.LongUnaryOperator map) {
        this.printArray(array, " ", map);
    }

    public void printArray(ArrayList<?> array) {
        this.printArray(array, " ");
    }

    public void printArray(ArrayList<?> array, String separator) {
        int n = array.size() - 1;
        for (int i = 0; i < n; i++) {
            super.print(array.get(i).toString());
            super.print(separator);
        }
        super.println(array.get(n).toString());
    }

    public void printlnArray(ArrayList<?> array) {
        int n = array.size();
        for (int i = 0; i < n; i++)
            super.println(array.get(i).toString());
    }

    public void printArray(int[][] array) {
        int n = array.length;
        if (n == 0)
            return;
        int m = array[0].length - 1;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++)
                super.print(array[i][j] + " ");
            super.println(array[i][m]);
        }
    }

    public void printArray(long[][] array) {
        int n = array.length;
        if (n == 0)
            return;
        int m = array[0].length - 1;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++)
                super.print(array[i][j] + " ");
            super.println(array[i][m]);
        }
    }

    public void printArray(char[][] array) {
        int n = array.length;
        if (n == 0)
            return;
        int m = array[0].length;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++)
                super.print(array[i][j]);
            super.println();
        }
    }
}
yukicoder

結果

テストケース

ソースコード
