結果

問題 No.2112 All 2x2 are Equal
ユーザー yupiteru_kunyupiteru_kun
提出日時 2022-10-28 21:51:17
言語 C#
(.NET 8.0.203)
結果
WA  
実行時間 -
コード長 9,868 bytes
コンパイル時間 10,124 ms
コンパイル使用メモリ 169,696 KB
実行使用メモリ 248,776 KB
最終ジャッジ日時 2024-07-06 00:57:04
合計ジャッジ時間 16,690 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 39 ms
23,552 KB
testcase_01 AC 39 ms
23,552 KB
testcase_02 AC 47 ms
26,880 KB
testcase_03 AC 47 ms
26,496 KB
testcase_04 AC 139 ms
57,116 KB
testcase_05 AC 142 ms
63,904 KB
testcase_06 AC 223 ms
85,460 KB
testcase_07 AC 102 ms
46,020 KB
testcase_08 AC 197 ms
81,832 KB
testcase_09 WA -
testcase_10 AC 117 ms
54,944 KB
testcase_11 AC 90 ms
43,408 KB
testcase_12 AC 96 ms
44,172 KB
testcase_13 AC 198 ms
82,428 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 42 ms
23,936 KB
testcase_17 AC 198 ms
81,488 KB
testcase_18 AC 56 ms
28,160 KB
testcase_19 AC 55 ms
29,056 KB
testcase_20 AC 47 ms
26,240 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 45 ms
26,496 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 58 ms
31,464 KB
testcase_27 AC 84 ms
40,632 KB
testcase_28 AC 139 ms
58,136 KB
testcase_29 AC 56 ms
29,184 KB
testcase_30 AC 107 ms
44,828 KB
testcase_31 AC 157 ms
64,972 KB
testcase_32 AC 228 ms
85,796 KB
testcase_33 WA -
testcase_34 WA -
testcase_35 AC 236 ms
248,776 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (95 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using Library;

namespace Program
{
    public static class ProblemD
    {
        static bool SAIKI = false;
        static public int numberOfRandomCases = 0;
        static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker)
        {
        }
        static public void Solve()
        {
            var H = (int)NN;
            var W = (int)NN;
            var flip = false;
            if (H > W)
            {
                var t = H; H = W; W = t;
                flip = true;
            }
            var done = new HashSet<int>();
            var ans = new int[H, W];
            {
                var i = 0;
                var front = 1;
                var end = H * W;
                for (; i < H - 1; i += 2)
                {
                    for (var j = 0; j < W; ++j)
                    {
                        if (j % 2 == 0)
                        {
                            ans[i, j] = front;
                            done.Add(front);
                            ++front;
                            ans[i + 1, j] = end;
                            done.Add(end);
                            --end;
                        }
                        else
                        {
                            ans[i + 1, j] = front;
                            done.Add(front);
                            ++front;
                            ans[i, j] = end;
                            done.Add(end);
                            --end;
                        }
                    }
                }
                if (i == H - 1)
                {
                    ans[i, 0] = front;
                    var tgtsum = ans[0, 0] + ans[0, 1] + ans[1, 0] + ans[1, 1];
                    for (var j = 1; j < W; ++j)
                    {
                        ans[i, j] = tgtsum - ans[i - 1, j - 1] - ans[i - 1, j] - ans[i, j - 1];
                    }
                    for (var j = 0; j < W; ++j)
                    {
                        if (done.Contains(ans[i, j]))
                        {
                            Console.WriteLine("No");
                            return;
                        }
                        done.Add(ans[i,j]);
                    }
                }
            }
            Console.WriteLine("Yes");
            if (flip)
            {
                for (var i = 0; i < W; ++i)
                {
                    for (var j = 0; j < H; ++j)
                    {
                        Console.Write($"{ans[j, i]} ");
                    }
                    Console.WriteLine();
                }
            }
            else
            {
                for (var i = 0; i < H; ++i)
                {
                    for (var j = 0; j < W; ++j)
                    {
                        Console.Write($"{ans[i, j]} ");
                    }
                    Console.WriteLine();
                }
            }
        }
        class Printer : StreamWriter
        {
            public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
            public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }
            public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }
        }
        static LIB_FastIO fastio = new LIB_FastIODebug();
        static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }
        static long NN => fastio.Long();
        static double ND => fastio.Double();
        static string NS => fastio.Scan();
        static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();
        static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();
        static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();
        static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);
        static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);
        static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);
        static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);
        static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);
        static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);
        static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);
        static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);
        static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);
        static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
        static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }
        static IEnumerator<uint> _xsi = _xsc();
        static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }
        static bool Chmax<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) < 0) { lhs = rhs; return true; } return false; }
        static bool Chmin<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } return false; }
        static void Fill<T>(this T[] array, T value) => array.AsSpan().Fill(value);
        static void Fill<T>(this T[,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0], array.Length).Fill(value);
        static void Fill<T>(this T[,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0], array.Length).Fill(value);
        static void Fill<T>(this T[,,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0, 0], array.Length).Fill(value);
    }
}
namespace Library {
    class LIB_FastIO
    {
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_FastIO() { str = Console.OpenStandardInput(); }
        readonly Stream str;
        readonly byte[] buf = new byte[2048];
        int len, ptr;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        byte read()
        {
            if (ptr >= len)
            {
                ptr = 0;
                if ((len = str.Read(buf, 0, 2048)) <= 0)
                {
                    return 0;
                }
            }
            return buf[ptr++];
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        char Char()
        {
            byte b = 0;
            do b = read();
            while (b < 33 || 126 < b);
            return (char)b;
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public long Long()
        {
            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 << 3) + (ret << 1) + b - '0';
            }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
    class LIB_FastIODebug : LIB_FastIO
    {
        Queue<string> param = new Queue<string>();
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_FastIODebug() { }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override string Scan() => NextString();
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override long Long() => long.Parse(NextString());
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override double Double() => double.Parse(NextString());
    }
}
0