結果

問題 No.612 Move on grid
ユーザー uwiuwi
提出日時 2017-12-12 00:04:57
言語 Java21
(openjdk 21)
結果
AC  
実行時間 382 ms / 2,500 ms
コード長 3,634 bytes
コンパイル時間 3,800 ms
コンパイル使用メモリ 80,084 KB
実行使用メモリ 55,448 KB
最終ジャッジ日時 2023-08-22 22:10:44
合計ジャッジ時間 10,243 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
50,080 KB
testcase_01 AC 53 ms
50,060 KB
testcase_02 AC 73 ms
53,692 KB
testcase_03 AC 135 ms
54,868 KB
testcase_04 AC 327 ms
54,840 KB
testcase_05 AC 382 ms
55,056 KB
testcase_06 AC 370 ms
55,448 KB
testcase_07 AC 326 ms
54,876 KB
testcase_08 AC 358 ms
54,924 KB
testcase_09 AC 349 ms
55,040 KB
testcase_10 AC 266 ms
55,148 KB
testcase_11 AC 147 ms
54,880 KB
testcase_12 AC 287 ms
55,168 KB
testcase_13 AC 192 ms
55,176 KB
testcase_14 AC 334 ms
54,968 KB
testcase_15 AC 168 ms
55,120 KB
testcase_16 AC 345 ms
54,984 KB
testcase_17 AC 207 ms
55,132 KB
testcase_18 AC 329 ms
55,072 KB
testcase_19 AC 250 ms
54,864 KB
testcase_20 AC 346 ms
55,104 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2017;
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 N612 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int t = ni();
		int a = ni(), b = ni(), c = ni();
		int d = ni(), e = ni();
		int o = 20000;
		long[] dp = new long[40000];
		dp[o] = 1;
		int mod = 1000000007;
		for(int i = 0;i < t;i++){
			long[] ndp = new long[40000];
			for(int j = 0;j < 40000;j++){
				if(dp[j] == 0)continue;
				ndp[j+a] += dp[j];
				ndp[j-a] += dp[j];
				ndp[j+b] += dp[j];
				ndp[j-b] += dp[j];
				ndp[j+c] += dp[j];
				ndp[j-c] += dp[j];
			}
			for(int j = 0;j < 40000;j++){
				ndp[j] %= mod;
			}
			dp = ndp;
		}
		long ans = 0;
		for(int j = 0;j < 40000;j++){
			if(d+o <= j && j <= e+o)ans += dp[j];
		}
		out.println(ans%mod);
	}
	
	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 N612().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