結果

問題 No.359 門松行列
ユーザー りあんりあん
提出日時 2016-04-18 00:06:55
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 40 ms / 2,000 ms
コード長 7,511 bytes
コンパイル時間 1,807 ms
コンパイル使用メモリ 120,044 KB
実行使用メモリ 33,636 KB
最終ジャッジ日時 2024-10-04 11:14:38
合計ジャッジ時間 2,395 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
27,356 KB
testcase_01 AC 30 ms
27,468 KB
testcase_02 AC 29 ms
25,384 KB
testcase_03 AC 34 ms
31,448 KB
testcase_04 AC 30 ms
25,504 KB
testcase_05 AC 33 ms
29,384 KB
testcase_06 AC 30 ms
27,416 KB
testcase_07 AC 33 ms
27,472 KB
testcase_08 AC 40 ms
31,580 KB
testcase_09 AC 40 ms
31,592 KB
testcase_10 AC 38 ms
31,340 KB
testcase_11 AC 38 ms
33,636 KB
testcase_12 AC 36 ms
29,672 KB
testcase_13 AC 38 ms
29,280 KB
testcase_14 AC 38 ms
31,460 KB
testcase_15 AC 37 ms
27,480 KB
testcase_16 AC 37 ms
29,676 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.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using Point = System.Tuple<double, double>;

class Program
{
    const int M = 1000000007;
    const double eps = 1e-9;
    static int[] dd = { 0, 1, 0, -1, 0 };
    static int[] ddd = { 1, 1, -1, -1, 1};
    static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var sc = new Scan();
        var t = sc.Int;
        for (int i = 0; i < t; i++)
        {
            int l = sc.Int;
            var lis = new List<int>();
            var a = new int[3][];
            var zi = new List<int>();
            var zj = new List<int>();
            lis.Add(1);
            lis.Add(l - 1);
            lis.Add(l / 2);
            lis.Add(l - l / 2);
            for (int j = 0; j < 3; j++)
            {
                a[j] = sc.IntArr;
                for (int k = 0; k < 3; k++)
                {
                    if (a[j][k] == 0)
                    {
                        zi.Add(j);
                        zj.Add(k);
                    }
                        lis.Add(a[j][k]);
                        lis.Add(l - a[j][k]);
                }
            }
            lis = lis.Distinct().ToList();
            lis.Sort();
            bool underok = false;
            int c = 0;
            for (int j = 0; j < lis.Count; j++)
            {
                if (underok)
                    c += lis[j] - lis[j - 1] - 1;
                
                a[zi[0]][zj[0]] = lis[j];
                a[zi[1]][zj[1]] = l - lis[j];
                if (IsKado(a)) ++c;
                
                a[zi[0]][zj[0]] = lis[j] + 1;
                a[zi[1]][zj[1]] = l - lis[j] - 1;
                underok = IsKado(a);
            }
            sw.WriteLine(c);
        }
        sw.Flush();
    }
    static bool IsKado(int[][] a)
    {
        bool ret = IsKado(new int[]{a[0][0], a[1][1], a[2][2]}) && IsKado(new int[]{a[0][2], a[1][1], a[2][0]});
        for (int i = 0; i < 3; i++)
        {
            ret = ret && IsKado(a[i]);
            ret = ret && IsKado(new int[]{a[0][i], a[1][i], a[2][i]});
        }
        return ret;
    }
    static bool IsKado(int[] a)
    {
        return a.Min() > 0 && a.Distinct().Count() == 3 && (a[0] < a[1] && a[1] > a[2] || a[0] > a[1] && a[1] < a[2]);
             
    }

    static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; }

    static T[] copy<T>(T[] a)
    {
        var ret = new T[a.Length];
        for (int i = 0; i < a.Length; i++) ret[i] = a[i];
        return ret;
    }
    static T[][] copy2<T>(T[][] a)
    {
        var ret = new T[a.Length][];
        for (int i = 0; i < a.Length; i++)
        {
            ret[i] = new T[a[0].Length];
            for (int j = 0; j < a[0].Length; j++) ret[i][j] = a[i][j];
        }
        return ret;
    }
}
class Scan
{
    public int Int { get { return int.Parse(Console.ReadLine().Trim()); } }
    public long Long { get { return long.Parse(Console.ReadLine().Trim()); } }
    public string Str { get { return Console.ReadLine().Trim(); } }
    public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } }
    public int[] IntArrWithSep(char sep) { return Console.ReadLine().Trim().Split(sep).Select(int.Parse).ToArray(); }
    public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } }
    public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } }
    public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } }
    public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
    public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
    public void Multi(out int a, out int b, out int c, out int d) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }
    public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }
    public void Multi(out string a, out int b) { var arr = StrArr; a = arr[0]; b = int.Parse(arr[1]); }
    public void Multi(out int a, out int b, out string c) { var arr = StrArr; a = int.Parse(arr[0]); b = int.Parse(arr[1]); c = arr[2]; }
    public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }
    public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); }
    public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
    public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; }
    public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; }
    public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
}
class mymath
{
    public bool isprime(long a)
    {
        if (a < 2) return false;
        for (long i = 2; i * i <= a; i++) if (a % i == 0) return false;
        return true;
    }
    public long[][] powmat(long[][] A, long n, int M)
    {
        var E = new long[A.Length][];
        for (int i = 0; i < A.Length; i++)
        {
            E[i] = new long[A.Length];
            E[i][i] = 1;
        }
        if (n == 0) return E;
        var t = powmat(A, n / 2, M);
        if ((n & 1) == 0) return mulmat(t, t, M);
        return mulmat(mulmat(t, t, M), A, M);
    }
    public long[] mulmat(long[][] A, long[] x, int M)
    {
        var ans = new long[A.Length];
        for (int i = 0; i < A.Length; i++) for (int j = 0; j < x.Length; j++) ans[i] = (ans[i] + x[j] * A[i][j]) % M;
        return ans;
    }
    public long[][] mulmat(long[][] A, long[][] B, int M)
    {
        var ans = new long[A.Length][];
        for (int i = 0; i < A.Length; i++)
        {
            ans[i] = new long[B[0].Length];
            for (int j = 0; j < B[0].Length; j++) for (int k = 0; k < B.Length; k++) ans[i][j] = (ans[i][j] + A[i][k] * B[k][j]) % M;
        }
        return ans;
    }
    public long powmod(long a, long b, long M)
    {
        if (a == 0) return 0;
        if (b == 0) return 1;
        var t = powmod(a, b / 2, M);
        if ((b & 1) == 0) return t * t % M;
        return t * t % M * a % M;
    }
    public long gcd(long a, long b)
    {
        while (b > 0) { var t = a % b; a = b; b = t; }
        return a;
    }
    public long lcm(int a, int b) { return a * (long)b / gcd(a, b); }
    public long Comb(int n, int r)
    {
        const int M = 1000000007;
        if (n < 0 || r < 0 || r > n) return 0;
        if (n - r < r) r = n - r;
        if (r == 0) return 1;
        if (r == 1) return n;
        var numerator = new int[r];
        var denominator = new int[r];
        for (int k = 0; k < r; k++)
        {
            numerator[k] = n - r + k + 1;
            denominator[k] = k + 1;
        }
        for (int p = 2; p <= r; p++)
        {
            int pivot = denominator[p - 1];
            if (pivot > 1)
            {
                int offset = (n - r) % p;
                for (int k = p - 1; k < r; k += p)
                {
                    numerator[k - offset] /= pivot;
                    denominator[k] /= pivot;
                }
            }
        }
        long result = 1;
        for (int k = 0; k < r; k++) if (numerator[k] > 1) result = result * numerator[k] % M;
        return result;
    }
}
0