結果

問題 No.612 Move on grid
コンテスト
ユーザー yuya178
提出日時 2017-12-12 01:14:28
言語 Java
(openjdk 23)
結果
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
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

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[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)); }
 
}
0