結果

問題 No.611 Day of the Mountain
コンテスト
ユーザー yuya178
提出日時 2017-12-22 21:23:16
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 5,578 bytes
コンパイル時間 2,783 ms
コンパイル使用メモリ 82,320 KB
実行使用メモリ 56,584 KB
最終ジャッジ日時 2024-12-17 23:26:17
合計ジャッジ時間 10,200 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1 WA * 2
other AC * 2 WA * 7
権限があれば一括ダウンロードができます

ソースコード

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 = 201712111;
    long inf = Long.MAX_VALUE;

    void solve()
    {
        int h = ni();
        int w = ni();
        char[][] c = new char[h][w];
        for(int i = 0; i < h; i++){
            c[i] = ns().toCharArray();
        }
        int[][] b;
        if(w<=h){
            b = new int[h][w];
            for(int i = 0; i < h; i++){
                for(int j = 0; j < w; j++){
                    b[i][j] =(c[i][j]=='?' ? -1 : c[i][j] - '0');
                }
            }
        }
        else{
            int tmp = h;
            h = w;
            w = tmp;
            b = new int[h][w];
            for(int i = 0; i < h; i++){
                for(int j = 0; j < w; j++){
                    b[i][j] =(c[j][i]=='?' ? -1 : c[j][i] - '0');
                }
            }
        }
        long[][] dist = new long[h][w];
        dist[0][0] = 0;
        for(int i = 0; i < h; i++){
            for(int j = 0; j < w; j++){
                dist[i][j] = (i+j==0 ? 0 : Math.min(i>0?dist[i-1][j]:inf , j>0?dist[i][j-1]:inf)) + (b[i][j]==-1?1:b[i][j]);
            }
        }
        int sb = (1<<w) - 1;
        long[] dp = new long[sb+1];
        long[] ndp = new long[sb+1];
        // dp[0] = 1;
        dp[1] = 1;
        for(int i = 0; i < h; i++){
            for(int j = 0; j < w; j++){
                if(i+j==0) continue;
                for(int k = 0; k <= sb; k++){
                    boolean up = ((k>>(w-1))&1)==1 && (i>0 ? dist[i-1][j]+(b[i][j]==-1?1:b[i][j])==dist[i][j] : false); 
                    boolean left = (k&1)==1 && (j>0 ? dist[i][j-1]+(b[i][j]==-1?1:b[i][j])==dist[i][j] : false);
                    if(up||left){
                        ndp[(2*k+1)&sb] = (ndp[(2*k+1)&sb]+dp[k])%MOD;
                        ndp[(2*k)&sb] = (ndp[(2*k)&sb]+(b[i][j]==-1 ? 8*dp[k] : 0))%MOD;
                    }
                    else{
                        ndp[(2*k)&sb] += (ndp[(2*k)&sb]+(b[i][j]==-1 ? 9*dp[k] : dp[k]))%MOD;
                    }
                }
                for(int k = 0; k <= sb; k++){
                    dp[k] = ndp[k];
                    ndp[k] = 0;
                }
            }
        }
        long ans = 0;
        for(int i = 1; i <= sb; i+=2){
            ans = (ans+dp[i])%MOD;
        }
        out.println(dist[h-1][w-1]);
        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