Submission #433783


Source Code Expand

using System;
using System.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;

namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var map = Enumerate(5, x => sc.Integer(5));
            var used = new bool[26];
            for (int i = 0; i < 5; i++)
                for (int j = 0; j < 5; j++)
                    used[map[i][j]] = true;
            if (used.Count(x => x) < 16)
                return;
            const ulong mod = (long)1e9 + 7;
            Func<int, ulong> dfs = null;
            dfs = p =>
                {
                    if (p == 25)
                        return 1;
                    var x = p / 5;
                    var y = p % 5;
                    ulong ret = 0;
                    if (map[x][y] != 0)
                    {
                        var i = map[x][y];
                        var px = x - 1;
                        var ppx = x - 2;
                        var py = y - 1;
                        var ppy = y - 2;
                        if (ppx >= 0)
                        {
                            if (map[ppx][y] < map[px][y] && map[px][y] < i)
                                return 0;
                            if (map[ppx][y] > map[px][y] && map[px][y] > i)
                                return 0;
                        }
                        if (ppy >= 0)
                        {
                            if (map[x][ppy] < map[x][py] && map[x][py] < i)
                                return 0;
                            if (map[x][ppy] > map[x][py] && map[x][py] > i)
                                return 0;
                        }
                        var prev = map[x][y];
                        ret += dfs(p + 1);
                        if (ret >= mod) ret -= mod;
                    }
                    else
                    {
                        for (int i = 1; i <= 25; i++)
                        {
                            if (used[i])
                                continue;
                            var px = x - 1;
                            var ppx = x - 2;
                            var py = y - 1;
                            var ppy = y - 2;
                            if (ppx >= 0)
                            {
                                if (map[ppx][y] < map[px][y] && map[px][y] < i)
                                    continue;
                                if (map[ppx][y] > map[px][y] && map[px][y] > i)
                                    continue;
                            }
                            if (ppy >= 0)
                            {
                                if (map[x][ppy] < map[x][py] && map[x][py] < i)
                                    continue;
                                if (map[x][ppy] > map[x][py] && map[x][py] > i)
                                    continue;
                            }
                            var prev = map[x][y];
                            map[x][y] = i;
                            used[i] = true;
                            ret += dfs(p + 1);
                            if (ret >= mod) ret -= mod;
                            used[i] = false;
                            map[x][y] = prev;
                        }
                    }
                    return ret;
                };
            IO.Printer.Out.WriteLine(dfs(0));

        }
        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 != '-' && (b < '0' || '9' < b));
            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() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        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

Submission Info

Submission Time
Task D - 25個の整数
User camypaper
Language C# (Mono 3.2.1.0)
Score 30
Code Size 7654 Byte
Status WA
Exec Time 156 ms
Memory 9764 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 4
AC × 19
AC × 19
WA × 10
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Subtask1 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt
Subtask2 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt, test-2-01.txt, test-2-02.txt, test-2-03.txt, test-2-04.txt, test-2-05.txt, test-2-06.txt, test-2-07.txt, test-2-08.txt, test-2-09.txt, test-2-10.txt
Case Name Status Exec Time Memory
sample-01.txt AC 119 ms 9748 KB
sample-02.txt AC 137 ms 9636 KB
sample-03.txt AC 121 ms 9764 KB
sample-04.txt AC 123 ms 9760 KB
test-1-01.txt AC 121 ms 9764 KB
test-1-02.txt AC 117 ms 9764 KB
test-1-03.txt AC 152 ms 9748 KB
test-1-04.txt AC 138 ms 9756 KB
test-1-05.txt AC 156 ms 9740 KB
test-1-06.txt AC 137 ms 9632 KB
test-1-07.txt AC 140 ms 9672 KB
test-1-08.txt AC 119 ms 9760 KB
test-1-09.txt AC 120 ms 9760 KB
test-1-10.txt AC 120 ms 9764 KB
test-1-11.txt AC 122 ms 9756 KB
test-1-12.txt AC 122 ms 9764 KB
test-1-13.txt AC 118 ms 9764 KB
test-1-14.txt AC 120 ms 9636 KB
test-1-15.txt AC 117 ms 9764 KB
test-2-01.txt WA 110 ms 9248 KB
test-2-02.txt WA 110 ms 9248 KB
test-2-03.txt WA 142 ms 9216 KB
test-2-04.txt WA 124 ms 9248 KB
test-2-05.txt WA 109 ms 9256 KB
test-2-06.txt WA 103 ms 9380 KB
test-2-07.txt WA 110 ms 9248 KB
test-2-08.txt WA 107 ms 9252 KB
test-2-09.txt WA 108 ms 9248 KB
test-2-10.txt WA 108 ms 9248 KB