結果
問題 | No.612 Move on grid |
ユーザー | yuya178 |
提出日時 | 2017-12-12 01:14:28 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 865 ms / 2,500 ms |
コード長 | 5,225 bytes |
コンパイル時間 | 2,652 ms |
コンパイル使用メモリ | 83,148 KB |
実行使用メモリ | 53,008 KB |
最終ジャッジ日時 | 2024-12-18 00:46:28 |
合計ジャッジ時間 | 15,553 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
50,084 KB |
testcase_01 | AC | 67 ms
50,520 KB |
testcase_02 | AC | 95 ms
51,400 KB |
testcase_03 | AC | 277 ms
52,900 KB |
testcase_04 | AC | 863 ms
52,568 KB |
testcase_05 | AC | 856 ms
53,008 KB |
testcase_06 | AC | 845 ms
52,648 KB |
testcase_07 | AC | 865 ms
52,840 KB |
testcase_08 | AC | 862 ms
52,936 KB |
testcase_09 | AC | 848 ms
52,776 KB |
testcase_10 | AC | 571 ms
52,608 KB |
testcase_11 | AC | 312 ms
52,752 KB |
testcase_12 | AC | 639 ms
52,696 KB |
testcase_13 | AC | 417 ms
52,880 KB |
testcase_14 | AC | 761 ms
52,880 KB |
testcase_15 | AC | 321 ms
52,588 KB |
testcase_16 | AC | 832 ms
52,668 KB |
testcase_17 | AC | 416 ms
52,616 KB |
testcase_18 | AC | 744 ms
52,680 KB |
testcase_19 | AC | 613 ms
52,704 KB |
testcase_20 | AC | 792 ms
52,404 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; // import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long MOD = 1_000_000_007; int inf = Integer.MAX_VALUE; void solve(){ int T = ni(); int a = ni(); int b = ni(); int c = ni(); int d = ni(); int e = ni(); long[] dp = new long[30001]; long[] ndp = new long[30001]; int mid = 15000; dp[mid] = 1; for(int i = 1 ; i <= T; i++){ long res = 0; // for(int x = 0; x <= i; x++){ // int ry = i-Math.abs(x); // for(int y = 0; y <= ry; y++){ // int rz = ry - Math.abs(y); // for(int z = 0; z <= rz; z++){ // for(int k = 0; k < 8; k++){ // int xt = x * (int)Math.pow(-1,k%2); // int yt = y * (int)Math.pow(-1,(k>>1)%2); // int zt = z * (int)Math.pow(-1,(k>>2)%2); // ndp[(a*xt+b*yt+c*zt)+mid] = dp[(a*(xt-1)+b*yt+c*zt)+mid]%MOD + dp[(a*(xt+1)+b*yt+c*zt)+mid]%MOD + dp[(a*xt+b*(yt-1)+c*zt)+mid]%MOD+ // dp[(a*xt+b*(yt+1)+c*zt)+mid]%MOD + dp[(a*xt+b*yt+c*(zt-1))+mid]%MOD + dp[(a*xt+b*yt+c*(zt+1))+mid]%MOD; // ndp[(a*xt+b*yt+c*zt)+mid] %= MOD; // res ++; // } // } // } // } // out.println(res); for(int x = -10000; x <= 10000; x++){ ndp[x+mid] = dp[x-a+mid]%MOD + dp[x+a+mid]%MOD + dp[x-b+mid]%MOD+ dp[x+b+mid]%MOD + dp[x-c+mid]%MOD + dp[x+c+mid]%MOD; ndp[x+mid] %= MOD; res ++; } for(int j = 0; j < 30001; j++){ dp[j] = ndp[j]; ndp[j] = 0; } } long ans = 0; for(int i = d; i <= e; i++){ ans += dp[i+mid]; ans %= MOD; } out.println(ans); } 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"); } public static void main(String[] args) throws Exception { new Main().run(); } private byte[] inbuf = new byte[1024]; private 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) && 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 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[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, 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 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)); } }