結果

問題 No.1102 Remnants
ユーザー OlandOland
提出日時 2020-07-04 02:04:24
言語 Java21
(openjdk 21)
結果
AC  
実行時間 237 ms / 2,000 ms
コード長 7,069 bytes
コンパイル時間 2,732 ms
コンパイル使用メモリ 79,100 KB
実行使用メモリ 46,672 KB
最終ジャッジ日時 2024-09-17 06:27:42
合計ジャッジ時間 7,942 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge6
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
37,136 KB
testcase_01 AC 51 ms
36,716 KB
testcase_02 AC 53 ms
37,136 KB
testcase_03 AC 52 ms
36,716 KB
testcase_04 AC 52 ms
37,048 KB
testcase_05 AC 193 ms
45,816 KB
testcase_06 AC 121 ms
40,568 KB
testcase_07 AC 237 ms
46,672 KB
testcase_08 AC 83 ms
37,620 KB
testcase_09 AC 91 ms
38,448 KB
testcase_10 AC 60 ms
37,136 KB
testcase_11 AC 86 ms
38,104 KB
testcase_12 AC 80 ms
38,132 KB
testcase_13 AC 88 ms
38,544 KB
testcase_14 AC 164 ms
41,892 KB
testcase_15 AC 146 ms
41,228 KB
testcase_16 AC 212 ms
45,972 KB
testcase_17 AC 209 ms
45,796 KB
testcase_18 AC 226 ms
45,932 KB
testcase_19 AC 165 ms
41,036 KB
testcase_20 AC 107 ms
39,700 KB
testcase_21 AC 199 ms
42,452 KB
testcase_22 AC 217 ms
43,564 KB
testcase_23 AC 202 ms
42,676 KB
testcase_24 AC 172 ms
41,892 KB
testcase_25 AC 222 ms
45,828 KB
testcase_26 AC 99 ms
39,644 KB
testcase_27 AC 132 ms
41,128 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.BigDecimal;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    final static int MOD = (int)1e9+7;
    void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
    
    void solve(){
        int N = in.nextInt(), K = in.nextInt();
        long[] A = in.nextLongArray(N);
        
        long[] inv = new long[N+1];
        inv[0] = inv[1] = 1;
        for(int i = 2; i < N; i++) inv[i] = MOD - (MOD / i) * inv[(int) (MOD % i)] % MOD;
        long[] comb = new long[N];
        comb[0] = 1;
        for(int i = 1; i < N; i++) comb[i] = comb[i-1] * (K + i) % MOD * inv[i] % MOD;
        
        long ans = 0;
        for(int i = 0; i < N; i++){
            long add = A[i] * comb[i] % MOD * comb[N-i-1] % MOD;
            ans = (ans + add) % MOD;
        }
        out.println(ans);
    }
    
    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() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }
        
        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