結果
問題 | No.612 Move on grid |
ユーザー |
|
提出日時 | 2017-12-12 00:03:46 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 822 ms / 2,500 ms |
コード長 | 3,643 bytes |
コンパイル時間 | 4,117 ms |
コンパイル使用メモリ | 82,940 KB |
実行使用メモリ | 62,628 KB |
最終ジャッジ日時 | 2024-12-18 00:44:03 |
合計ジャッジ時間 | 16,151 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 17 |
ソースコード
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 = 50000;long[] dp = new long[100000];dp[50000] = 1;int mod = 1000000007;for(int i = 0;i < t;i++){long[] ndp = new long[100000];for(int j = 0;j < 100000;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 < 100000;j++){ndp[j] %= mod;}dp = ndp;}long ans = 0;for(int j = 0;j < 100000;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)); }}