結果

問題 No.616 へんなソート
ユーザー 37zigen
提出日時 2018-08-28 00:25:08
言語 Java
(openjdk 23)
結果
AC  
実行時間 338 ms / 2,000 ms
コード長 2,740 bytes
コンパイル時間 2,191 ms
コンパイル使用メモリ 77,664 KB
実行使用メモリ 167,540 KB
最終ジャッジ日時 2024-07-05 21:24:13
合計ジャッジ時間 5,578 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.Comparator;
import java.util.NoSuchElementException;
public class Main {
    public static void main(String[] args) {
        new Main().run();
    }
    final long MOD = 1_000_000_000 + 7;
    void run() {
        Scanner sc = new Scanner();
        int N = sc.nextInt();
        int K = sc.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; ++i)
            A[i] = sc.nextLong();
        long[][] dp = new long[N + 1][K + 1];
        dp[0][0] = 1;
        for (int i = 0; i < N; ++i) {
            long sum = 0;
            for (int j = 0; j <= K; ++j) {
                sum = (sum + dp[i][j]) % MOD;
                if (j - i - 1 >= 0)
                    sum = (sum - dp[i][j - i - 1] + MOD) % MOD;
                dp[i + 1][j] = (dp[i + 1][j] + sum) % MOD;
            }
        }
        long ans = 0;
        for (int i = 0; i <= K; ++i)
            ans = (ans + dp[N][i]) % MOD;
        System.out.println(ans);
    }
    void tr(Object... objects) {
        System.out.println(Arrays.deepToString(objects));
    }
    class Scanner {
        private final InputStream in = System.in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;
        private boolean hasNextByte() {
            if (ptr < buflen) {
                return true;
            } else {
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (buflen <= 0) {
                    return false;
                }
            }
            return true;
        }
        private int readByte() {
            if (hasNextByte())
                return buffer[ptr++];
            else
                return -1;
        }
        private 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 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());
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0