結果

問題 No.612 Move on grid
ユーザー hiromi_ayasehiromi_ayase
提出日時 2017-12-13 19:15:27
言語 Java21
(openjdk 21)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,898 bytes
コンパイル時間 2,790 ms
コンパイル使用メモリ 93,364 KB
実行使用メモリ 70,224 KB
最終ジャッジ日時 2024-12-14 10:02:53
合計ジャッジ時間 27,783 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 78 ms
51,008 KB
testcase_01 AC 80 ms
51,360 KB
testcase_02 AC 80 ms
51,228 KB
testcase_03 AC 363 ms
62,176 KB
testcase_04 AC 321 ms
60,024 KB
testcase_05 TLE -
testcase_06 TLE -
testcase_07 AC 304 ms
60,748 KB
testcase_08 TLE -
testcase_09 AC 1,302 ms
70,224 KB
testcase_10 AC 1,032 ms
68,344 KB
testcase_11 AC 482 ms
63,004 KB
testcase_12 AC 1,622 ms
68,324 KB
testcase_13 AC 658 ms
68,744 KB
testcase_14 AC 2,245 ms
68,168 KB
testcase_15 AC 495 ms
65,816 KB
testcase_16 TLE -
testcase_17 AC 418 ms
59,940 KB
testcase_18 AC 2,026 ms
69,124 KB
testcase_19 AC 607 ms
67,912 KB
testcase_20 AC 758 ms
68,176 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.HashMap;
import java.util.Map;

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();

    Map<Long, Long> from = new HashMap<>();
    Map<Long, Long> to = new HashMap<>();
    
    long mod = 1000000000 + 7;
    from.put(0L, 1L);
    int[][] DIR = {{1, 0, 0}, {0, 1, 0}, {0, 0, 1}, {-1, 0, 0}, {0, -1, 0}, {0, 0, -1}};
    for (int t = 0; t < T; t ++) {
      for (Map.Entry<Long, Long> map : from.entrySet()) {
        for (int[] v : DIR) {
          long next = map.getKey() + (a * v[0] + b * v[1] + c * v[2]);
          if (!to.containsKey(next)) {
            to.put(next, map.getValue());
          } else {
            to.put(next, (to.get(next) + map.getValue()) % mod);
          }
        }
      }
      from.clear();
      Map<Long, Long> tmp = from;
      from = to;
      to = tmp;
    }
    
    long ret = 0;
    for (Map.Entry<Long, Long> map : from.entrySet()) {
      long v = map.getKey();
      if (d <= v && v <= e) {
        ret += map.getValue();
        ret %= mod;
      }
    }
    System.out.println(ret);
  }
  
  public static int[] unpack(long h) {
    int x = (int)(h % 10000 - 5000);
    h /= 10000;
    int y = (int)(h % 10000 - 5000);
    h /= 10000;
    int z = (int)(h - 5000);
    return new int[] {x, y, z};
  }

  public static long pack(int x, int y, int z) {
    long ret = 0;
    ret += z + 5000;
    ret *= 10000;
    ret += y + 5000;
    ret *= 10000;
    ret += x + 5000;
    return 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