結果

問題 No.995 タピオカオイシクナーレ
ユーザー OlandOland
提出日時 2020-02-22 00:13:02
言語 Java21
(openjdk 21)
結果
AC  
実行時間 178 ms / 2,000 ms
コード長 9,547 bytes
コンパイル時間 4,264 ms
コンパイル使用メモリ 78,224 KB
実行使用メモリ 40,832 KB
最終ジャッジ日時 2024-10-09 03:42:58
合計ジャッジ時間 6,749 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
36,872 KB
testcase_01 AC 57 ms
36,452 KB
testcase_02 AC 56 ms
36,968 KB
testcase_03 AC 59 ms
36,548 KB
testcase_04 AC 57 ms
37,092 KB
testcase_05 AC 57 ms
36,712 KB
testcase_06 AC 57 ms
37,000 KB
testcase_07 AC 57 ms
36,712 KB
testcase_08 AC 57 ms
37,092 KB
testcase_09 AC 56 ms
36,712 KB
testcase_10 AC 59 ms
36,808 KB
testcase_11 AC 62 ms
37,048 KB
testcase_12 AC 61 ms
37,092 KB
testcase_13 AC 61 ms
37,092 KB
testcase_14 AC 59 ms
37,092 KB
testcase_15 AC 67 ms
37,092 KB
testcase_16 AC 174 ms
40,824 KB
testcase_17 AC 172 ms
40,804 KB
testcase_18 AC 167 ms
40,832 KB
testcase_19 AC 170 ms
40,572 KB
testcase_20 AC 173 ms
40,808 KB
testcase_21 AC 174 ms
40,792 KB
testcase_22 AC 172 ms
40,768 KB
testcase_23 AC 178 ms
40,764 KB
testcase_24 AC 169 ms
40,620 KB
testcase_25 AC 172 ms
40,652 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    void solve(){
        int N = in.nextInt(), M = in.nextInt();
        long K = in.nextLong();
        long p = in.nextInt(), q = in.nextInt();
        long[] b = in.nextLongArray(N);
        
        long[][] A = {{q-p, p}, {p, q-p}};
        long[][] m = Matrix.powMatrix(A, K);
        
        long ans = 0;
        for(int i = 0; i < N; i++){
            ans += (b[i] * ((i < M) ? m[0][0] : m[0][1])) % MOD;
            ans %= MOD;
        }
        ans *= modPow(modMultiInv(q, MOD), K, MOD);
        ans %= MOD;
        out.println(ans);
    }
    
    public static long modMultiInv(long a, int mod){
        return modPow(a, mod-2, mod);
    }
    
    public static long modPow(long a, long b, int mod){
        long res = 1;
        while(b > 0){
            if((b & 1) == 1) res = (res * a) % mod;
            a = (a * a) % mod;
            b = b >> 1;
        }
        return res;
    }
    
    public static class Matrix {
        static final int MOD = (int)1e9+7;
        
        public static long[][] powMatrix(long[][] a, long n){
            if(n == 0){
                int size = a.length;
                long[][] e = new long[size][size];
                for(int i = 0; i < size; i++){
                    for(int j = 0; j < size; j++){
                        if(i == j)
                            e[i][j] = 1;
                        else
                            e[i][j] = 0;
                    }
                }
                return e;
            }
            
            if(n % 2 == 0){
                return powMatrix(multiplyMatrix(a, a), n / 2);
            }else{
                return multiplyMatrix(a, powMatrix(multiplyMatrix(a, a), (n - 1) / 2));
            }
        }
        
        public static long[] multiplyMatrix(long[][] a, long[] x){
            int size = a.length;
            long[] y = new long[size];
            for(int i = 0; i < size; i++){
                for(int j = 0; j < size; j++){
                    y[i] = ((y[i] + (a[i][j] * x[j]) % MOD) % MOD);
                }
            }
            return y;
        }
        
        public static long[][] multiplyMatrix(long[][] a, long[][] b){
            int size = a.length;
            long[][] c = new long[size][size];
            for(int i = 0; i < size; i++){
                for(int j = 0; j < size; j++){
                    for(int k = 0; k < size; k++){
                        c[i][j] = ((c[i][j] + (a[i][k] * b[k][j]) % MOD) % MOD);
                    }
                }
            }
            return c;
        }
        
        public static void printMatrix(long[] a){
            int size = a.length;
            for(int j = 0; j < size; j++){
                System.out.println(a[j]);
            }
        }
        
        public static void printMatrix(long[][] a){
            int size = a.length;
            for(int i = 0; i < size; i++){
                for(int j = 0; j < size; j++){
                    System.out.print(a[i][j]);
                    if(j == size-1)
                        System.out.println();
                    else
                        System.out.print(" ");
                }
            }
        }
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {return (int) nextLong();}
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0