結果

問題 No.223 1マス指定の魔方陣
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-06-05 23:03:46
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 20 ms / 5,000 ms
コード長 10,103 bytes
コンパイル時間 3,747 ms
コンパイル使用メモリ 109,824 KB
実行使用メモリ 18,048 KB
最終ジャッジ日時 2024-07-06 14:21:32
合計ジャッジ時間 3,841 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 20 ms
17,792 KB
testcase_01 AC 20 ms
17,792 KB
testcase_02 AC 20 ms
17,920 KB
testcase_03 AC 20 ms
17,920 KB
testcase_04 AC 20 ms
17,792 KB
testcase_05 AC 20 ms
17,920 KB
testcase_06 AC 19 ms
18,048 KB
testcase_07 AC 20 ms
17,792 KB
testcase_08 AC 20 ms
17,664 KB
testcase_09 AC 20 ms
17,792 KB
testcase_10 AC 20 ms
17,920 KB
testcase_11 AC 20 ms
17,536 KB
testcase_12 AC 20 ms
17,664 KB
testcase_13 AC 20 ms
17,664 KB
testcase_14 AC 20 ms
17,792 KB
testcase_15 AC 20 ms
17,920 KB
testcase_16 AC 19 ms
17,920 KB
testcase_17 AC 19 ms
17,792 KB
testcase_18 AC 20 ms
17,664 KB
testcase_19 AC 20 ms
17,664 KB
testcase_20 AC 20 ms
17,792 KB
testcase_21 AC 19 ms
17,920 KB
testcase_22 AC 20 ms
17,664 KB
testcase_23 AC 19 ms
17,664 KB
testcase_24 AC 20 ms
18,048 KB
testcase_25 AC 20 ms
17,664 KB
testcase_26 AC 19 ms
17,664 KB
testcase_27 AC 20 ms
17,664 KB
testcase_28 AC 20 ms
17,664 KB
testcase_29 AC 20 ms
17,664 KB
testcase_30 AC 20 ms
17,792 KB
testcase_31 AC 19 ms
17,920 KB
testcase_32 AC 20 ms
17,920 KB
testcase_33 AC 20 ms
17,792 KB
testcase_34 AC 19 ms
17,536 KB
testcase_35 AC 20 ms
17,664 KB
testcase_36 AC 20 ms
17,664 KB
testcase_37 AC 20 ms
17,920 KB
testcase_38 AC 19 ms
17,920 KB
testcase_39 AC 20 ms
17,664 KB
testcase_40 AC 20 ms
18,048 KB
testcase_41 AC 19 ms
17,536 KB
testcase_42 AC 20 ms
17,664 KB
testcase_43 AC 20 ms
17,536 KB
testcase_44 AC 20 ms
17,920 KB
testcase_45 AC 20 ms
17,920 KB
testcase_46 AC 20 ms
18,048 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 StringBuilder = System.Text.StringBuilder;
using System.Numerics;
//using System.Threading.Tasks;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var x = sc.Integer() - 1;
            var y = sc.Integer() - 1;
            var v = sc.Integer();
            var sq = MagicSquare.Create(n);
            var p = -1;
            var q = -1;
            for (int i = 0; i < n; i++)
                for (int j = 0; j < n; j++)
                {
                    if (sq.mat[i][j] == v)
                    {
                        p = i; q = j;
                    }
                }
            var sum = n * (n * n + 1) / 2;
            Swap(ref sq.mat[y], ref sq.mat[p]);
            for (int i = 0; i < n; i++)
                Swap(ref sq.mat[i][x], ref sq.mat[i][q]);

                                

            for (int i = 0; i < n; i++)
                for (int j = i; j < n; j++)
                {
                    if (i == y || j == y)
                        continue;
                    Swap(ref sq.mat[i], ref sq.mat[j]);

                    for (int k = 0; k < n; k++)
                        for (int l = k; l < n; l++)
                        {
                            if (k == x || l == x)
                                continue;
                            for (int t = 0; t < n; t++)
                                Swap(ref sq.mat[t][k], ref sq.mat[t][l]);
                            var e = 0;
                            var f = 0;
                            for (int t = 0; t < n; t++)
                            {
                                e += sq.mat[t][t];
                                f += sq.mat[t][n - 1 - t];
                            }
                           
                            if (e == sum && f == sum)
                            {
                                foreach (var a in sq.mat)
                                    Console.WriteLine(a.AsJoinedString());
                                
                                Environment.Exit(0);
                            }
                            for (int t = 0; t < n; t++)
                                Swap(ref sq.mat[t][k], ref sq.mat[t][l]);

                        }
                    Swap(ref sq.mat[i], ref sq.mat[j]);
                }


        }
        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


#region MagicScuare
public class MagicSquare
{
    public int[][] mat;
    MagicSquare(int n)
    {
        mat = new int[n][];
        for (int i = 0; i < n; i++)
            mat[i] = new int[n];
    }
    static public MagicSquare Create(int n)
    {
        var ans = new MagicSquare(n);
        if (n % 2 == 1)
        {
            var mat = ans.mat;
            var cnt = 1;
            var p = n / 2;
            var q = 0;
            while (cnt <= n * n)
            {
                mat[q][p] = cnt++;
                if (mat[(q + n - 1) % n][(p + 1) % n] == 0)
                {
                    p = (p + 1) % n;
                    q = (q + n - 1) % n;
                }
                else
                    q = (q + 1) % n;
            }
        }
        else if (n % 4 == 0)
        {
            var mat = ans.mat;
            var q = new Queue<int>();

            for (int i = 0; i < n; i += 4)
            {
                for (int j = 0; j < n; j += 4)
                {
                    mat[i][j] = (i * n + j) + 1;
                    mat[i][j + 3] = (i * n + j + 3) + 1;
                }
                for (int j = 0; j < n; j += 4)
                {
                    mat[i + 1][j + 1] = ((i + 1) * n + j + 1) + 1;
                    mat[i + 1][j + 2] = ((i + 1) * n + j + 2) + 1;
                }
                for (int j = 0; j < n; j += 4)
                {
                    mat[i + 2][j + 1] = ((i + 2) * n + j + 1) + 1;
                    mat[i + 2][j + 2] = ((i + 2) * n + j + 2) + 1;
                }
                for (int j = 0; j < n; j += 4)
                {
                    mat[i + 3][j] = ((i + 3) * n + j) + 1;
                    mat[i + 3][j + 3] = ((i + 3) * n + j + 3) + 1;
                }
            }
            for (int i = 0; i < n; i++)
                for (int j = 0; j < n; j++)
                    if (mat[i][j] == 0) q.Enqueue(i * n + j + 1);
            for (int i = n - 1; i >= 0; i--)
                for (int j = n - 1; j >= 0; j--)
                    if (mat[i][j] == 0) mat[i][j] = q.Dequeue();
        }
        else
        {
            var mat = ans.mat;
            var mini = MagicSquare.Create(n / 2);
            for (int i = 0; i < n; i++)
                for (int j = 0; j < n; j++)
                    mat[i][j] += (mini.mat[i / 2][j / 2] - 1) << 2;
            for (int i = 0; i < n / 2; i++)
                for (int j = 0; j < n / 2; j++)
                {
                    //Debug.Write(string.Format("{0} {1}", i, j));

                    if (i > (n / 2 + 1) / 2)
                    {
                        //Debug.WriteLine(" X");
                        mat[i * 2][j * 2] += 1;
                        mat[i * 2][j * 2 + 1] += 4;
                        mat[i * 2 + 1][j * 2] += 3;
                        mat[i * 2 + 1][j * 2 + 1] += 2;
                    }
                    else if ((i == (n / 2 + 1) / 2 && j != n / 4) || (i == (n / 2 + 1) / 2 - 1 && j == n / 4))
                    {
                        //Debug.WriteLine(" U");
                        mat[i * 2][j * 2] += 1;
                        mat[i * 2][j * 2 + 1] += 4;
                        mat[i * 2 + 1][j * 2] += 2;
                        mat[i * 2 + 1][j * 2 + 1] += 3;
                    }
                    else
                    {
                        //Debug.WriteLine(" L");
                        mat[i * 2][j * 2] += 4;
                        mat[i * 2][j * 2 + 1] += 1;
                        mat[i * 2 + 1][j * 2] += 2;
                        mat[i * 2 + 1][j * 2 + 1] += 3;
                    }


                }
        }
        return ans;
    }
}
#endregion
0