結果
問題 | No.2113 Distance Sequence 1.5 |
ユーザー |
![]() |
提出日時 | 2022-10-28 22:21:57 |
言語 | C# (.NET 8.0.404) |
結果 |
AC
|
実行時間 | 41 ms / 2,000 ms |
コード長 | 13,925 bytes |
コンパイル時間 | 8,285 ms |
コンパイル使用メモリ | 168,288 KB |
実行使用メモリ | 189,940 KB |
最終ジャッジ日時 | 2024-07-06 01:32:42 |
合計ジャッジ時間 | 9,968 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 21 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (80 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/
ソースコード
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 ProblemE{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 N = NN;var M = NN;var K = NN;if (M <= K){Console.WriteLine(LIB_Mod998244353.Pow(M, N) * LIB_Mod998244353.Pow(M, N));}else{LIB_Mod998244353 pat = M - K;LIB_Mod998244353 pat2 = LIB_Mod998244353.Pow(K, N) * LIB_Mod998244353.Pow(K, N);LIB_Mod998244353 pat3 = pat2 - LIB_Mod998244353.Pow(K - 1, N) * LIB_Mod998244353.Pow(K - 1, N);Console.WriteLine(pat2 + pat3 * pat);}}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; } returnfalse; }static bool Chmin<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } returnfalse; }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 {partial struct LIB_Mod998244353 : IEquatable<LIB_Mod998244353>, IEquatable<long>{const int _mod = 998244353; long v;[MethodImpl(MethodImplOptions.AggressiveInlining)]public LIB_Mod998244353(long x){if (x < _mod && x >= 0) v = x;else if ((v = x % _mod) < 0) v += _mod;}[MethodImpl(MethodImplOptions.AggressiveInlining)]static public implicit operator LIB_Mod998244353(long x) => new LIB_Mod998244353(x);[MethodImpl(MethodImplOptions.AggressiveInlining)]static public implicit operator long(LIB_Mod998244353 x) => x.v;[MethodImpl(MethodImplOptions.AggressiveInlining)]public void Add(LIB_Mod998244353 x) { if ((v += x.v) >= _mod) v -= _mod; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public void Sub(LIB_Mod998244353 x) { if ((v -= x.v) < 0) v += _mod; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public void Mul(LIB_Mod998244353 x) => v = (v * x.v) % _mod;[MethodImpl(MethodImplOptions.AggressiveInlining)]public void Div(LIB_Mod998244353 x) => v = (v * Inverse(x.v)) % _mod;[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod998244353 operator +(LIB_Mod998244353 x, LIB_Mod998244353 y) { var t = x.v + y.v; return t >= _mod ? newLIB_Mod998244353 { v = t - _mod } : new LIB_Mod998244353 { v = t }; }[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod998244353 operator -(LIB_Mod998244353 x, LIB_Mod998244353 y) { var t = x.v - y.v; return t < 0 ? new LIB_Mod998244353 {v = t + _mod } : new LIB_Mod998244353 { v = t }; }[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod998244353 operator *(LIB_Mod998244353 x, LIB_Mod998244353 y) => x.v * y.v;[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod998244353 operator /(LIB_Mod998244353 x, LIB_Mod998244353 y) => x.v * Inverse(y.v);[MethodImpl(MethodImplOptions.AggressiveInlining)]static public bool operator ==(LIB_Mod998244353 x, LIB_Mod998244353 y) => x.v == y.v;[MethodImpl(MethodImplOptions.AggressiveInlining)]static public bool operator !=(LIB_Mod998244353 x, LIB_Mod998244353 y) => x.v != y.v;[MethodImpl(MethodImplOptions.AggressiveInlining)]static public long Inverse(long x){long b = _mod, r = 1, u = 0, t = 0;while (b > 0){var q = x / b;t = u;u = r - q * u;r = t;t = b;b = x - q * b;x = t;}return r < 0 ? r + _mod : r;}[MethodImpl(MethodImplOptions.AggressiveInlining)]public bool Equals(LIB_Mod998244353 x) => v == x.v;[MethodImpl(MethodImplOptions.AggressiveInlining)]public bool Equals(long x) => v == x;[MethodImpl(MethodImplOptions.AggressiveInlining)]public override bool Equals(object x) => x == null ? false : Equals((LIB_Mod998244353)x);[MethodImpl(MethodImplOptions.AggressiveInlining)]public override int GetHashCode() => v.GetHashCode();[MethodImpl(MethodImplOptions.AggressiveInlining)]public override string ToString() => v.ToString();static List<LIB_Mod998244353> _fact = new List<LIB_Mod998244353>() { 1, 1 };static List<LIB_Mod998244353> _inv = new List<LIB_Mod998244353>() { 0, 1 };static List<LIB_Mod998244353> _factinv = new List<LIB_Mod998244353>() { 1, 1 };static long _factm = _mod;[MethodImpl(MethodImplOptions.AggressiveInlining)]static void B(long n){if (_factm != _mod){_fact = new List<LIB_Mod998244353>() { 1, 1 };_inv = new List<LIB_Mod998244353>() { 0, 1 };_factinv = new List<LIB_Mod998244353>() { 1, 1 };}if (n >= _fact.Count){for (int i = _fact.Count; i <= n; ++i){_fact.Add(_fact[i - 1] * i);_inv.Add(_mod - _inv[(int)(_mod % i)] * (_mod / i));_factinv.Add(_factinv[i - 1] * _inv[i]);}}_factm = _mod;}[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod998244353 Comb(long n, long k){B(n);if (n == 0 && k == 0) return 1;if (n < k || n < 0) return 0;return _fact[(int)n] * _factinv[(int)(n - k)] * _factinv[(int)k];}[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod998244353 CombOK(long n, long k){LIB_Mod998244353 ret = 1;LIB_Mod998244353 deno = 1;var chk = n - k;if (chk < k) k = chk;for (var i = 0; i < k; i++) ret *= n - i;for (var i = 1; i <= k; i++) deno *= i;return ret / deno;}[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod998244353 Perm(long n, long k){B(n);if (n == 0 && k == 0) return 1;if (n < k || n < 0) return 0;return _fact[(int)n] * _factinv[(int)(n - k)];}[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod998244353 KanzenPerm(long n, long k) => Enumerable.Range(0, (int)k + 1).Aggregate((LIB_Mod998244353)0, (a, e) => a + (1- ((e & 1) << 1)) * LIB_Mod998244353.Comb(k, e) * LIB_Mod998244353.Perm(n - e, k - e));[MethodImpl(MethodImplOptions.AggressiveInlining)]static public LIB_Mod998244353 Pow(LIB_Mod998244353 x, long y){LIB_Mod998244353 a = 1;while (y != 0){if ((y & 1) == 1) a.Mul(x);x.Mul(x);y >>= 1;}return a;}}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());}}