結果

問題 No.1011 Infinite Stairs
ユーザー uwi
提出日時 2020-03-20 21:25:51
言語 Java11
(openjdk 11.0.6)
結果
AC  
実行時間 765 ms / 2,000 ms
コード長 3,403 Byte
コンパイル時間 3,907 ms
使用メモリ 34,300 KB
最終ジャッジ日時 2020-04-30 11:49:34

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 85 ms
20,908 KB
testcase_01 AC 84 ms
20,884 KB
testcase_02 AC 114 ms
23,844 KB
testcase_03 AC 158 ms
25,292 KB
testcase_04 AC 765 ms
34,300 KB
testcase_05 AC 72 ms
20,888 KB
testcase_06 AC 94 ms
22,496 KB
testcase_07 AC 76 ms
20,804 KB
testcase_08 AC 72 ms
20,892 KB
testcase_09 AC 85 ms
21,956 KB
testcase_10 AC 173 ms
25,284 KB
testcase_11 AC 79 ms
21,660 KB
testcase_12 AC 146 ms
25,344 KB
testcase_13 AC 77 ms
21,152 KB
testcase_14 AC 159 ms
25,356 KB
testcase_15 AC 389 ms
25,488 KB
testcase_16 AC 115 ms
25,268 KB
testcase_17 AC 262 ms
25,360 KB
testcase_18 AC 83 ms
21,732 KB
testcase_19 AC 78 ms
21,244 KB
testcase_20 AC 165 ms
25,420 KB
testcase_21 AC 232 ms
25,376 KB
testcase_22 AC 173 ms
25,352 KB
testcase_23 AC 179 ms
25,372 KB
testcase_24 AC 233 ms
25,336 KB
testcase_25 AC 126 ms
25,332 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
package contest200320;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), D = ni();
		int K = ni();
		long[] dp = new long[K+1];
		dp[0] = 1;
		int mod = 1000000007;
		for(int i = 0;i < n;i++){
			long[] ndp = new long[K+2];
			for(int j = 0;j <= K;j++){
				ndp[j+1] += dp[j];
				if(j+D+1 < K+2)ndp[j+D+1] += mod-dp[j];
			}
			for(int j = 0;j <= K;j++){
				ndp[j+1] += ndp[j];
				ndp[j+1] %= mod;
			}
			dp = ndp;
		}
		out.println(dp[K]);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0