結果

問題 No.506 限られたジャパリまん
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2017-04-21 23:02:52
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
実行時間 -
コード長 7,005 bytes
コンパイル時間 2,323 ms
コンパイル使用メモリ 115,612 KB
実行使用メモリ 57,068 KB
最終ジャッジ日時 2024-06-28 04:11:14
合計ジャッジ時間 5,886 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
30,336 KB
testcase_01 AC 25 ms
23,264 KB
testcase_02 AC 27 ms
25,436 KB
testcase_03 AC 24 ms
21,560 KB
testcase_04 TLE -
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 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 StringBuilder = System.Text.StringBuilder;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {

        public void Solve()
        {
            var h = sc.Integer();
            var w = sc.Integer();
            var k = sc.Integer();
            var kk = sc.Integer();
            var u = new int[k];
            var v = new int[k];
            var s = new string[k];
            var flag = new int[h + 1, w + 1];
            for (int i = 0; i <= h; i++)
                for (int j = 0; j <= w; j++)
                    flag[i, j] = -1;
            var max = 0UL;
            var maxf = 0;
            for (int i = 0; i < k; i++)
            {
                u[i] = sc.Integer();
                v[i] = sc.Integer();
                flag[u[i], v[i]] = i;
                s[i] = sc.Scan();
            }
            for (int i = 0; i < 1 << k; i++)
            {
                var c = 0;
                for (int j = 0; j < k; j++)
                    if ((i >> j & 1) == 1) c++;
                if (c > kk) continue;
                var dist = new int[h + 1, w + 1];
                for (int x = 0; x <= h; x++)
                    for (int y = 0; y <= w; y++)
                        dist[x, y] = 114514;
                var cnt = new ulong[h + 1, w + 1];
                dist[0, 0] = 0;
                cnt[0, 0] = 1;
                int[] dx = { 1, -1, 0, 0 };
                int[] dy = { 0, 0, 1, -1 };
                if (flag[0, 0] != -1 && (i >> flag[0, 0] & 1) == 0) continue;
                var q = new Queue<int>(); q.Enqueue(0);
                while (q.Count > 0)
                {
                    var p = q.Dequeue();
                    var x = p / (w + 1);
                    var y = p % (w + 1);
                    Debug.WriteLine("{0} {1}", x, y);
                    for (int d = 0; d < 4; d++)
                    {
                        var nx = x + dx[d];
                        var ny = y + dy[d];
                        if (nx < 0 || nx > h || ny < 0 || ny > w) continue;
                        if (flag[nx, ny] != -1 && (i >> flag[nx, ny] & 1) == 0) continue;
                        if (dist[nx, ny] > dist[x, y] + 1)
                        {
                            dist[nx, ny] = dist[x, y] + 1;
                            cnt[nx, ny] = cnt[x, y];
                            q.Enqueue(nx * (w + 1) + ny);
                        }
                        else if (dist[nx, ny] == dist[x, y] + 1)
                            cnt[nx, ny] += cnt[x, y];
                    }
                }
                if (dist[h, w] == 114514) continue;
                if (max < cnt[h, w]) { max = cnt[h, w]; maxf = i; }
            }
            IO.Printer.Out.WriteLine(max % 1000000007);
            for (int i = 0; i < k; i++)
                if ((maxf >> i & 1) == 1) IO.Printer.Out.WriteLine(s[i]);
        }
        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(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer: StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    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 = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion
0