結果

問題 No.616 へんなソート
ユーザー hiromi_ayase
提出日時 2017-12-19 07:02:10
言語 Java
(openjdk 23)
結果
AC  
実行時間 597 ms / 2,000 ms
コード長 2,897 bytes
コンパイル時間 2,681 ms
コンパイル使用メモリ 85,856 KB
実行使用メモリ 53,684 KB
最終ジャッジ日時 2024-12-17 20:16:52
合計ジャッジ時間 7,191 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.util.Arrays;
public class Main {
    private static void solve() {
        int n = ni();
        int K = ni();
        int[] a = na(n);
        
        long[][] dp = new long[2][K + n + 1];
        dp[0][0] = 1;
        long mod = 1000000000 + 7;
        for (int i = 0; i < n; i ++) {
            int from = i % 2;
            int to = (i + 1) % 2;
            for (int j = 0; j <= K; j ++) {
                dp[to][j] += dp[from][j];
                dp[to][j] %= mod;
                dp[to][j + i + 1] += mod - dp[from][j];
                dp[to][j + i + 1] %= mod;
            }
            long now = 0;
            for (int j = 0; j <= K; j ++) {
                now += mod + dp[to][j];
                now %= mod;
                dp[to][j] = now;
            }
            Arrays.fill(dp[from], 0);
        }
        long sum = 0;
        for (int i = 0; i <= K; i ++) {
            sum += dp[n % 2][i];
            sum %= mod;
        }
        System.out.println(sum);
        
    }
    public static void main(String[] args) {
        new Thread(null, new Runnable() {
            @Override
            public void run() {
                long start = System.currentTimeMillis();
                String debug = args.length > 0 ? args[0] : null;
                if (debug != null) {
                    try {
                        is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
                    } catch (Exception e) {
                        throw new RuntimeException(e);
                    }
                }
                reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
                solve();
                out.flush();
                tr((System.currentTimeMillis() - start) + "ms");
            }
        }, "", 64000000).start();
    }
    private static java.io.InputStream is = System.in;
    private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
    private static java.util.StringTokenizer tokenizer = null;
    private static java.io.BufferedReader reader;
    public static String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new java.util.StringTokenizer(reader.readLine());
            } catch (Exception e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }
    private static double nd() {
        return Double.parseDouble(next());
    }
    private static long nl() {
        return Long.parseLong(next());
    }
    private static int[] na(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = ni();
        return a;
    }
    private static char[] ns() {
        return next().toCharArray();
    }
    private static long[] nal(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nl();
        return a;
    }
    private static int[][] ntable(int n, int m) {
        int[][] table = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                table[i][j] = ni();
            }
        }
        return table;
    }
    private static int[][] nlist(int n, int m) {
        int[][] table = new int[m][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                table[j][i] = ni();
            }
        }
        return table;
    }
    private static int ni() {
        return Integer.parseInt(next());
    }
    private static void tr(Object... o) {
        if (is != System.in)
            System.out.println(java.util.Arrays.deepToString(o));
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0