結果

問題 No.612 Move on grid
ユーザー hiromi_ayase
提出日時 2017-12-13 19:35:31
言語 Java
(openjdk 23)
結果
AC  
実行時間 313 ms / 2,500 ms
コード長 3,317 bytes
コンパイル時間 2,845 ms
コンパイル使用メモリ 88,560 KB
実行使用メモリ 53,072 KB
最終ジャッジ日時 2024-12-18 00:54:09
合計ジャッジ時間 8,531 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

diff # 

public class Main {

  private static void solve() {
    int T = ni();
    int a = ni();
    int b = ni();
    int c = ni();
    int d = ni();
    int e = ni();

    int max = 11000;
    long[][] dp = new long[2][max * 2];

    long mod = 1000000000 + 7;
    int offset = max;
    dp[0][0 + offset] = 1;
    for (int t = 0; t < T; t++) {
      int from = (t % 2);
      int to = (t + 1) % 2;
      for (int i = -max + 50; i < max - 50; i++) {
        int j = i + offset;
        dp[to][j] = 0;
        dp[to][j] += dp[from][i + offset + a];
        dp[to][j] += dp[from][i + offset - a];
        dp[to][j] += dp[from][i + offset + b];
        dp[to][j] += dp[from][i + offset - b];
        dp[to][j] += dp[from][i + offset + c];
        dp[to][j] += dp[from][i + offset - c];
        dp[to][j] %= mod;
      }
    }

    long ret = 0;
    for (int i = d; i <= e; i++) {
      long v = dp[T % 2][i + offset];
      ret += v;
      ret %= mod;
    }
    System.out.println(ret);
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = System.getProperty("debug");
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0