結果

問題 No.2527 H and W
ユーザー crimsonteacrimsontea
提出日時 2023-11-03 22:03:54
言語 C#
(.NET 8.0.203)
結果
WA  
実行時間 -
コード長 11,279 bytes
コンパイル時間 8,892 ms
コンパイル使用メモリ 165,232 KB
実行使用メモリ 213,508 KB
最終ジャッジ日時 2024-09-25 20:24:06
合計ジャッジ時間 13,251 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 151 ms
52,992 KB
testcase_01 AC 144 ms
52,604 KB
testcase_02 WA -
testcase_03 AC 52 ms
28,540 KB
testcase_04 AC 53 ms
28,544 KB
testcase_05 AC 165 ms
52,624 KB
testcase_06 AC 169 ms
53,120 KB
testcase_07 AC 160 ms
52,744 KB
testcase_08 AC 164 ms
52,744 KB
testcase_09 AC 151 ms
52,748 KB
testcase_10 AC 152 ms
52,992 KB
testcase_11 AC 173 ms
52,744 KB
testcase_12 AC 173 ms
52,748 KB
testcase_13 AC 171 ms
53,004 KB
testcase_14 AC 172 ms
52,740 KB
testcase_15 AC 168 ms
52,736 KB
testcase_16 AC 174 ms
52,740 KB
testcase_17 AC 170 ms
52,616 KB
testcase_18 AC 168 ms
52,872 KB
testcase_19 AC 161 ms
53,100 KB
testcase_20 AC 165 ms
53,120 KB
testcase_21 AC 168 ms
52,864 KB
testcase_22 AC 175 ms
52,996 KB
testcase_23 AC 172 ms
52,620 KB
testcase_24 AC 163 ms
52,736 KB
testcase_25 AC 152 ms
213,508 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (95 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
/home/judge/data/code/Main.cs(116,28): warning CS8632: '#nullable' 注釈コンテキスト内のコードでのみ、Null 許容参照型の注釈を使用する必要があります。 [/home/judge/data/code/main.csproj]
/home/judge/data/code/Main.cs(117,26): warning CS8632: '#nullable' 注釈コンテキスト内のコードでのみ、Null 許容参照型の注釈を使用する必要があります。 [/home/judge/data/code/main.csproj]
  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.Linq;
using System.Collections;
using System.IO;
using System.Collections.Generic;
using System.Text;
using System.Numerics;
using System.Runtime.Intrinsics.X86;
using System.Buffers;
using System.Diagnostics;
using System.Runtime.CompilerServices;
using static InputUtility;

class Program
{
    static void Main()
    {
        using Output output = new(false);

        InputNewLine();
        var (h, w, k) = (NextInt64, NextInt64, NextInt64);

        if (h * w == k)
        {
            Console.WriteLine(1);
            return;
        }

        const long mod = 998244353;
        Combinations combinations = new(mod);

        var res = 0L;

        if (k % h == 0)
        {
            var select = w - k / h;
            res += combinations.NCR((int)w, (int)select);
        }

        if (k % w == 0)
        {
            var select = h - k / w;
            res += combinations.NCR((int)h, (int)select);
        }

        for (int i = 1; i < h; i++)
        {
            var left = h * w - i * w - k;
            var select = left / (h - i);

            var red = i * w + select * (h - i);

            if (h * w - red != k) { continue; }

            if (0 <= select && select <= w)
            {
                res += combinations.NCR((int)h, i) * combinations.NCR((int)w, (int)select);
                res %= mod;
            }
        }

        Console.WriteLine(res);
    }
}
internal class Combinations
{
    const long n = 1000000 + 1;
    private readonly long[] _fact = new long[n];
    private readonly long[] _inv = new long[n];
    private readonly long[] _factInv = new long[n];

    private readonly long _mod;

    public Combinations(long mod)
    {
        _mod = mod;

        _fact[0] = _fact[1] = 1;
        _inv[0] = _inv[1] = 1;
        _factInv[0] = _factInv[1] = 1;

        for (int i = 2; i < n; i++)
        {
            _fact[i] = _fact[i - 1] * i % mod;
            _inv[i] = mod - _inv[mod % i] * (mod / i) % mod;
            _factInv[i] = _factInv[i - 1] * _inv[i] % mod;
        }
    }

    public long NCR(int n, int k)
    {
        if (n - k < 0)
        {
            return 0;
        }
        return _fact[n] * (_factInv[k] * _factInv[n - k] % _mod) % _mod;
    }

    public long NPR(int n, int k)
    {
        if (n - k < 0)
        {
            return 0;
        }
        return _fact[n] * _factInv[n - k] % _mod;
    }

    public long NHR(int n, int k)
    {
        return NCR(n + k - 1, k);
    }
}

public static class InputUtility
{
    private static string[]? s_inputs;
    private static string? s_raw;
    private static int s_index = 0;

    private static void Init() => s_index = 0;
    public static int NextInt32 => int.Parse(s_inputs![s_index++]!);
    public static uint NextUInt32 => uint.Parse(s_inputs![s_index++]!);
    public static long NextInt64 => long.Parse(s_inputs![s_index++]!);
    public static BigInteger NextBigInteger => long.Parse(s_inputs![s_index++]!);
    public static string NextString => s_inputs![s_index++];
    public static char NextChar => s_inputs![s_index++][0];
    public static int[] GetInt32Array() => s_inputs!.Select(int.Parse).ToArray();
    public static long[] GetInt64Array() => s_inputs!.Select(long.Parse).ToArray();
    public static string GetRawString() => s_raw!;
#if DEBUG
    private static TextReader? s_textReader;
    public static void SetSource(string path) => s_textReader = new StringReader(File.ReadAllText(path));
#endif
    public static bool InputNewLine()
    {
#if DEBUG
        if (s_textReader is TextReader sr)
        {
            Init();
            s_raw = sr.ReadLine()!;
            s_inputs = s_raw.Split(' ', StringSplitOptions.RemoveEmptyEntries);
            return true;
        }
#endif
        Init();
        s_raw = Console.ReadLine()!;
        s_inputs = s_raw.Split(' ', StringSplitOptions.RemoveEmptyEntries);
        return true;
    }
}

public readonly struct Output : IDisposable
{
    private readonly StreamWriter _sw;
#if DEBUG
    public Output(string path)
    {
        var fs = new FileStream(path, FileMode.Create, FileAccess.Write);
        _sw = new StreamWriter(fs);
        Console.SetOut(_sw);
    }
#endif
    public Output(bool autoFlush)
    {
        _sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = autoFlush };
        Console.SetOut(_sw);
    }

    public void Dispose()
    {
        _sw.Dispose();
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    internal void Flush()
    {
        _sw.Flush();
    }
}

public static class ArrayExtensions
{
    public static void Swap<T>(this T[] array, int i, int j) => (array[i], array[j]) = (array[j], array[i]);

    public static int LowerBound<T>(this T[] a, T target) where T : IComparable<T>
    {
        int ok = a.Length;
        int ng = -1;

        while (Math.Abs(ok - ng) > 1 && (ok + ng) / 2 is int mid)
            (ok, ng) = a[mid].CompareTo(target) >= 0 ? (mid, ng) : (ok, mid);

        return ok;
    }

    public static int UpperBound<T>(this T[] a, T target) where T : IComparable<T>
    {
        int ok = a.Length;
        int ng = -1;

        while (Math.Abs(ok - ng) > 1 && (ok + ng) / 2 is int mid)
            (ok, ng) = a[mid].CompareTo(target) > 0 ? (mid, ng) : (ok, mid);

        return ok;
    }

    public struct IndexedEnumerable<T> : IEnumerable<(T item, int index)>
    {
        private readonly T[] _a;
        private readonly int _startIndex;

        public IndexedEnumerable(T[] a, int startIndex = 0)
        {
            _a = a;
            _startIndex = startIndex;
        }

        public readonly IndexedEnumerator<T> GetEnumerator() => new IndexedEnumerator<T>(_a, _startIndex);
        IEnumerator IEnumerable.GetEnumerator() => GetEnumerator();
        IEnumerator<(T item, int index)> IEnumerable<(T item, int index)>.GetEnumerator() => GetEnumerator();
    }

    public struct IndexedEnumerator<T> : IEnumerator<(T item, int index)>
    {
        public readonly (T item, int index) Current => (_a[_index], _index + _startIndex);

        private int _index;
        private int _startIndex;
        private T[] _a;

        public IndexedEnumerator(T[] a, int startIndex)
        {
            _index = -1;
            _a = a;
            _startIndex = startIndex;
        }

        public bool MoveNext() => ++_index < _a.Length;
        readonly object IEnumerator.Current => Current;
        public readonly void Dispose() { }
        public void Reset() => _index = -1;
    }

    /// <returns>(T value, int index)</returns>
    public static IndexedEnumerable<T> Enumerate<T>(this T[] arr, int startIndex = 0) => new IndexedEnumerable<T>(arr, startIndex);
}

public static class IEnumerableExtensions
{
    public static IEnumerable<TSource> Log<TSource>(this IEnumerable<TSource> source)
    {
        Console.WriteLine(string.Join(' ', source));
        return source;
    }

    public static ScanEnumerable<TSource, TAccumulate> Scan<TSource, TAccumulate>(
        this IEnumerable<TSource> source,
        TAccumulate seed,
    Func<TAccumulate, TSource, TAccumulate> accumulator) where TSource : struct where TAccumulate : struct
    {
        return new ScanEnumerable<TSource, TAccumulate>(source, accumulator, seed);
    }

    public static IEnumerable<TAccumulate> ScanExSeed<TSource, TAccumulate>(
        this IEnumerable<TSource> source,
        TAccumulate seed,
        Func<TAccumulate, TSource, TAccumulate> accumulator)
    {
        var accumulation = new List<TAccumulate>();

        var current = seed;
        foreach (var item in source)
        {
            current = accumulator(current, item);
            accumulation.Add(current);
        }

        return accumulation;
    }

    public readonly struct ScanEnumerable<TSource, TAccumulate> : IEnumerable<TAccumulate> where TSource : struct where TAccumulate : struct
    {
        private readonly IEnumerable<TSource> _source;
        private readonly Func<TAccumulate, TSource, TAccumulate> _accumulator;
        private readonly TAccumulate _seed;

        public ScanEnumerable(IEnumerable<TSource> source, Func<TAccumulate, TSource, TAccumulate> accumulator, TAccumulate seed)
        {
            _source = source;
            _accumulator = accumulator;
            _seed = seed;
        }

        public readonly ScanEnumerator<TSource, TAccumulate> GetEnumerator() => new(_source, _accumulator, _seed);
        readonly IEnumerator IEnumerable.GetEnumerator() => GetEnumerator();
        readonly IEnumerator<TAccumulate> IEnumerable<TAccumulate>.GetEnumerator() => GetEnumerator();
    }

    public struct ScanEnumerator<TSource, TAccumulate> : IEnumerator<TAccumulate> where TSource : struct where TAccumulate : struct
    {
        private readonly Func<TAccumulate, TSource, TAccumulate> _accumulator;

        private readonly IEnumerator<TSource> _enumerator;
        private TAccumulate _current;

        private bool _secondOrLaterElement = false;

        public ScanEnumerator(IEnumerable<TSource> source, Func<TAccumulate, TSource, TAccumulate> accumulator, TAccumulate seed)
        {
            _enumerator = source.GetEnumerator();
            _accumulator = accumulator;

            _current = seed;
        }

        public readonly TAccumulate Current => _current;
        readonly object IEnumerator.Current => Current;

        public readonly void Dispose() { }

        public bool MoveNext()
        {
            if (_secondOrLaterElement)
            {
                if (_enumerator.MoveNext())
                {
                    _current = _accumulator(_current, _enumerator.Current);
                    return true;
                }
                return false;
            }
            else
            {
                _secondOrLaterElement = true;
                return true;
            }
        }

        public void Reset()
        {
            throw new NotSupportedException();
        }
    }

    public static IEnumerable<TSource> Scan<TSource>(
        this IEnumerable<TSource> source,
        Func<TSource, TSource, TSource> accumulator)
    {
        if (source is null)
            throw new ArgumentNullException(paramName: nameof(source));

        if (accumulator is null)
            throw new ArgumentNullException(paramName: nameof(accumulator));

        var accumulation = new List<TSource>();

        if (source.Any() is false)
        {
            return accumulation;
        }

        var current = source.First();
        accumulation.Add(current);

        foreach (var item in source.Skip(1))
        {
            current = accumulator(current, item);
            accumulation.Add(current);
        }

        return accumulation;
    }
}

public class MyMath
{
    public static long Pow(long x, int y) => Enumerable.Repeat(x, y).Aggregate(1L, (acc, x) => acc * x);
    public static long Pow10(int y) => Pow(10, y);
    public static long Pow2(int y) => Pow(2, y);
}

public class MyMathBigInteger
{
    public static BigInteger Pow(long x, int y) => Enumerable.Repeat(x, y).Aggregate(new BigInteger(1), (acc, x) => acc * x);
    public static BigInteger Pow10(int y) => Pow(10, y);
    public static BigInteger Pow2(int y) => Pow(2, y);
}
0