結果

問題 No.612 Move on grid
ユーザー yuya178yuya178
提出日時 2017-12-12 00:45:30
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,492 bytes
コンパイル時間 3,121 ms
コンパイル使用メモリ 80,720 KB
実行使用メモリ 46,760 KB
最終ジャッジ日時 2024-05-08 00:05:03
合計ジャッジ時間 7,060 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
42,268 KB
testcase_01 AC 54 ms
36,800 KB
testcase_02 AC 54 ms
36,892 KB
testcase_03 TLE -
testcase_04 -- -
testcase_05 -- -
testcase_06 -- -
testcase_07 -- -
testcase_08 -- -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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[10001];
        long[] ndp = new long[10001];
        int mid = 5000;
        dp[mid] = 1;
        for(int i = 1 ; i <= T; i++){
            for(int x = -i; x <= i; x++){
                int ry = i-Math.abs(x);
                for(int y = -ry; y <= ry; y++){
                    int rz = ry - Math.abs(y);
                    for(int z = -rz; z <= rz; z++){
                        ndp[(a*x+b*y+c*z)+mid] = dp[(a*(x-1)+b*y+c*z)+mid]%MOD + dp[(a*(x+1)+b*y+c*z)+mid]%MOD + dp[(a*x+b*(y-1)+c*z)+mid]%MOD+ 
                        dp[(a*x+b*(y+1)+c*z)+mid]%MOD + dp[(a*x+b*y+c*(z-1))+mid]%MOD + dp[(a*x+b*y+c*(z+1))+mid]%MOD;
                        ndp[(a*x+b*y+c*z)+mid] %= MOD;
                    }
                }
            }
            for(int j = 0; j < 10001; 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)); }
 
}
0