結果

問題 No.1011 Infinite Stairs
ユーザー OlandOland
提出日時 2020-03-21 09:30:40
言語 Java21
(openjdk 21)
結果
AC  
実行時間 926 ms / 2,000 ms
コード長 6,945 bytes
コンパイル時間 3,124 ms
コンパイル使用メモリ 78,860 KB
実行使用メモリ 477,648 KB
最終ジャッジ日時 2024-07-17 11:58:02
合計ジャッジ時間 8,276 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
37,184 KB
testcase_01 AC 53 ms
36,980 KB
testcase_02 AC 86 ms
45,964 KB
testcase_03 AC 670 ms
357,800 KB
testcase_04 AC 192 ms
109,980 KB
testcase_05 AC 926 ms
477,648 KB
testcase_06 AC 52 ms
50,320 KB
testcase_07 AC 78 ms
53,824 KB
testcase_08 AC 53 ms
50,432 KB
testcase_09 AC 52 ms
50,480 KB
testcase_10 AC 84 ms
53,544 KB
testcase_11 AC 193 ms
112,876 KB
testcase_12 AC 69 ms
50,536 KB
testcase_13 AC 144 ms
84,476 KB
testcase_14 AC 59 ms
50,356 KB
testcase_15 AC 156 ms
113,540 KB
testcase_16 AC 495 ms
245,760 KB
testcase_17 AC 110 ms
65,132 KB
testcase_18 AC 291 ms
190,364 KB
testcase_19 AC 81 ms
51,608 KB
testcase_20 AC 63 ms
50,508 KB
testcase_21 AC 166 ms
113,756 KB
testcase_22 AC 275 ms
142,936 KB
testcase_23 AC 168 ms
113,784 KB
testcase_24 AC 168 ms
113,840 KB
testcase_25 AC 255 ms
147,652 KB
testcase_26 AC 118 ms
75,608 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    final static int MOD = (int)1e9+7;
    final static long INF = Long.MAX_VALUE / 2;
    
    void solve(){
        int N = in.nextInt(), d = in.nextInt(), K = in.nextInt();
        long[][] dp = new long[K+1][N+1], sum = new long[K+1][N+1];
        dp[0][0] = 1;
        for(int i = 0; i <= K; i++) sum[i][0] = 1;
        for(int i = 1; i <= K; i++){
            for(int j = 1; j <= N; j++){
                int p = Math.max(0, i - d);
                long tmp = (sum[i-1][j-1] - sum[p][j-1]);
                if(tmp < 0) tmp += MOD;
                dp[i][j] =  tmp + dp[p][j-1];
                if(dp[i][j] >= MOD) dp[i][j] -= MOD;
                sum[i][j] = sum[i-1][j] + dp[i][j];
                if(sum[i][j] >= MOD) sum[i][j] -= MOD;
            }
        }
        out.println(dp[K][N]);
    }
    
    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