結果

問題 No.611 Day of the Mountain
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2017-12-12 22:06:23
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,931 ms / 2,017 ms
コード長 6,872 bytes
コンパイル時間 1,040 ms
コンパイル使用メモリ 122,112 KB
実行使用メモリ 47,096 KB
最終ジャッジ日時 2024-12-14 06:31:31
合計ジャッジ時間 5,872 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 360 ms
28,032 KB
testcase_01 AC 361 ms
28,168 KB
testcase_02 AC 361 ms
26,248 KB
testcase_03 AC 1,931 ms
47,096 KB
testcase_04 AC 182 ms
25,948 KB
testcase_05 AC 183 ms
23,916 KB
testcase_06 AC 183 ms
23,788 KB
testcase_07 AC 182 ms
26,092 KB
testcase_08 AC 31 ms
23,656 KB
testcase_09 AC 27 ms
25,828 KB
testcase_10 AC 29 ms
25,952 KB
testcase_11 AC 28 ms
23,860 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using SB = System.Text.StringBuilder;
//using System.Numerics;
//using static System.Math;
using System.IO;
using Number = System.Int64;
namespace Program {
    public class Solver {
        const long MOD = (long)201712111;

        public void Solve() {
            var n = ri;
            var m = ri;
            var a = Enumerate(n, x => rs);
            var b = Enumerate(n, x => new char[m]);
            var c = Enumerate(m, x => new char[n]);
            for (int i = 0; i < n; i++)
                for (int j = 0; j < m; j++)
                    b[i][j] = c[j][i] = a[i][j];
            if (n > m) solve(n, m, b);
            else solve(m, n, c);

        }
        int[][] f(int n, int m, char[][] a) {
            var gg = Enumerate(n * m, x => new int[n * m]);
            for (int i = 0; i < n * m; i++)
                for (int j = i + 1; j < n * m; j++)
                    gg[i][j] = gg[j][i] = 1 << 20;
            for (int i = 0; i < n; i++)
                for (int j = 0; j < m; j++) {
                    for (int k = 0; k < 2; k++) {
                        var nx = i + dx[k];
                        var ny = j + dy[k];
                        if (nx < 0 || nx >= n || ny < 0 || ny >= m) continue;
                        var v = a[nx][ny] == '?' ? 1 : a[nx][ny] - '0';
                        gg[i * m + j][nx * m + ny] = v;
                    }
                }
            for (int k = 0; k < n * m; k++)
                for (int i = 0; i < n * m; i++)
                    for (int j = 0; j < n * m; j++) gg[i][j] = Math.Min(gg[i][j], gg[i][k] + gg[k][j]);
            var res = new bool[n * m];
            for (int i = 0; i < n; i++)
                for (int j = 0; j < m; j++)
                    res[i * m + j] = gg[0][i * m + j] + gg[i * m + j][n * m - 1] == gg[0][n * m - 1];
            {
                var v = gg[0][n * m - 1];
                if (a[0][0] == '?') v++;
                else v += a[0][0] - '0';
                Console.WriteLine(v);
            }
            return gg;
        }
        void solve(int n, int m, char[][] a) {
            var g = f(n, m, a);
            var b = Enumerate(n, x => new int[m]);
            for (int i = 0; i < n; i++)
                for (int j = 0; j < m; j++)
                    b[i][j] = (char)(a[i][j] == '?' ? 1 : a[i][j] - '0');
            var dp = new long[1 << m];
            dp[1] = 1;
            for (int i = 0; i < n; i++)
                for (int j = 0; j < m; j++) {
                    var next = new long[1 << m];
                    for (int mask = 0; mask < 1 << m; mask++) {
                        if (dp[mask] == 0) continue;
                        Debug.WriteLine($"{i} {j} :{mask}, {dp[mask]}");
                        var ok = false;
                        if ((mask >> j & 1) == 1 && (i == 0 || g[0][(i - 1) * m + j] + g[i * m + j][n * m - 1] + b[i][j] == g[0][n * m - 1])) ok = true;
                        if (j > 0 && (mask >> (j - 1) & 1) == 1 && g[0][i * m + j - 1] + g[i * m + j][n * m - 1] + b[i][j] == g[0][n * m - 1]) ok = true;
                        if (ok) {
                            next[mask | (1 << j)] = (next[mask | (1 << j)] + dp[mask]) % MOD;
                            if (a[i][j] == '?') next[mask & ~(1 << j)] = (next[mask & ~(1 << j)] + 8 * dp[mask]) % MOD;
                        }
                        else {
                            var c = a[i][j] == '?' ? 9 : 1;
                            next[mask & ~(1 << j)] = (next[mask & ~(1 << j)] + c * dp[mask]) % MOD;
                        }
                    }
                    dp = next;
                }
            long ans = 0;
            for (int i = 0; i < 1 << m; i++)
                if ((i >> (m - 1)) == 1) ans = (ans + dp[i]) % MOD;
            Console.WriteLine(ans);
        }


        const long INF = 1L << 60;
        int[] dx = { 1, 0, -1, 0 };
        int[] dy = { 0, 1, 0, -1 };
        //*
        int ri { get { return sc.Integer(); } }
        long rl { get { return sc.Long(); } }
        double rd { get { return sc.Double(); } }
        string rs { get { return sc.Scan(); } }
        //*/

        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex {
    static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
        return string.Join(st, ie.Select(x => x.ToString()).ToArray());
        //return string.Join(st, ie);
    }
    static public void Main() {
        Console.SetOut(new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Program.Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO {
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer: StreamWriter {
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    }
    public class StreamScanner {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read() {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan() {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine() {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n' && b != 0; b = (char)read())
                if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
        public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
        public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
}
#endregion
0