結果
| 問題 | No.1552 Simple Dice Game |
| ユーザー |
 fairy_lettuce
|
| 提出日時 | 2021-06-18 23:00:10 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 2,091 ms / 2,500 ms |
| コード長 | 11,602 bytes |
| コンパイル時間 | 3,204 ms |
| コンパイル使用メモリ | 120,892 KB |
| 実行使用メモリ | 18,304 KB |
| 最終ジャッジ日時 | 2024-06-22 21:16:00 |
| 合計ジャッジ時間 | 27,331 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 24 ms
18,176 KB |
| testcase_01 | AC | 24 ms
18,176 KB |
| testcase_02 | AC | 25 ms
18,304 KB |
| testcase_03 | AC | 2,091 ms
18,176 KB |
| testcase_04 | AC | 25 ms
17,920 KB |
| testcase_05 | AC | 23 ms
18,048 KB |
| testcase_06 | AC | 24 ms
18,304 KB |
| testcase_07 | AC | 24 ms
17,920 KB |
| testcase_08 | AC | 23 ms
18,048 KB |
| testcase_09 | AC | 1,602 ms
18,176 KB |
| testcase_10 | AC | 1,782 ms
18,304 KB |
| testcase_11 | AC | 1,818 ms
18,304 KB |
| testcase_12 | AC | 504 ms
18,176 KB |
| testcase_13 | AC | 1,430 ms
17,792 KB |
| testcase_14 | AC | 862 ms
17,920 KB |
| testcase_15 | AC | 1,121 ms
17,920 KB |
| testcase_16 | AC | 172 ms
18,176 KB |
| testcase_17 | AC | 266 ms
18,176 KB |
| testcase_18 | AC | 1,454 ms
17,920 KB |
| testcase_19 | AC | 2,005 ms
17,920 KB |
| testcase_20 | AC | 2,033 ms
18,048 KB |
| testcase_21 | AC | 2,009 ms
18,048 KB |
| testcase_22 | AC | 1,972 ms
18,048 KB |
| testcase_23 | AC | 2,033 ms
18,176 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Text;
using System.Globalization;
using System.Threading;
using static System.Math;
namespace FertiLib.Contest.C
{
public class Solver
{
Scanner sr;
StreamWriter sw;
bool isMultipleTestCases = false;
public void Solve()
{
var (n, m) = sr.ReadValue<long, int>();
ModInt ans = 0;
for (int a = 1; a <= m; a++)
{
ans += (((ModInt)a).Pow(n - 1) * a * (a + 1) / 2
- ((ModInt)(a - 1)).Pow(n - 1) * a * (a - 1) / 2)
* n * a;
ans -= (((ModInt)(m - a + 1)).Pow(n - 1) * (m - a + 1) * (m + a) / 2
- ((ModInt)(m - a)).Pow(n - 1) * (m - a) * (m + a + 1) / 2)
* n * a;
}
Console.WriteLine(ans);
}
public Solver(Scanner cin, StreamWriter cout)
{
this.sr = cin;
this.sw = cout;
}
public void Start()
{
int _t = 1;
if (isMultipleTestCases) _t = sr.ReadInt();
while (_t-- > 0) Solve();
}
public static void YESNO(bool condition) => Console.WriteLine(condition ? "YES" : "NO");
public static void YesNo(bool condition) => Console.WriteLine(condition ? "Yes" : "No");
public static void yesno(bool condition) => Console.WriteLine(condition ? "yes" : "no");
public static T SignOutput<T>(int x, T pos, T zero, T neg) => x == 0 ? zero : (x > 0 ? pos : neg);
public static T[] CreateArray<T>(int n, Func<int, T> func) => Enumerable.Range(0, n).Select(p => func(p)).ToArray();
public static T[][] CreateArray<T>(int h, int w, Func<int, int, T> func) => Enumerable.Range(0, h).Select(i => Enumerable.Range(0, w).Select(j => func(i, j)).ToArray()).ToArray();
}
public struct ModInt : IEquatable<ModInt>
{
public static long MOD = 998244353;
public static bool isModPrime { get; set; }
private readonly long num;
public ModInt(long n) { num = n; isModPrime = true; }
public override string ToString() => num.ToString();
public static ModInt operator +(ModInt l, ModInt r)
{
long x = l.num + r.num;
if (x >= MOD) x -= MOD;
return new ModInt(x);
}
public static ModInt operator -(ModInt l, ModInt r)
{
long x = l.num - r.num;
if (x < 0) x += MOD;
return new ModInt(x);
}
public static ModInt operator *(ModInt l, ModInt r) => new ModInt((l.num * r.num) % MOD);
public static ModInt operator /(ModInt l, ModInt r) => l * r.Inverse();
public static ModInt operator ++(ModInt x)
{
var tmp = x + new ModInt(1);
return tmp;
}
public static ModInt operator --(ModInt x)
{
var tmp = x - new ModInt(1);
return tmp;
}
public static bool operator ==(ModInt l, ModInt r) => l.Equals(r);
public static bool operator !=(ModInt l, ModInt r) => !l.Equals(r);
public static implicit operator long(ModInt x) => x.num;
public static implicit operator ModInt(long n)
{
n %= MOD;
if (n < 0) n += MOD;
return new ModInt(n);
}
public ModInt Inverse() => Inverse(this, MOD);
public static ModInt Inverse(ModInt x) => Inverse(x.num, MOD);
public static long Inverse(long x, long m)
{
if (x % m == 0) throw new DivideByZeroException();
long a = x, b = m, u = 1, v = 0;
while (b > 0)
{
long t = a / b;
a -= t * b;
long p = a; a = b; b = p; // swap(a, b);
u -= t * v;
p = u; u = v; v = p; // swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
public ModInt Pow(long n) => Pow(this, n);
public static ModInt Pow(long x, long n)
{
if (n < 0) return Pow(x, -n).Inverse();
x %= MOD;
long now = 1;
if (isModPrime) n %= MOD - 1;
for (; n > 0; n /= 2, x = x * x % MOD)
{
if (n % 2 == 1) now = now * x % MOD;
}
return new ModInt(now);
}
public bool Equals(ModInt x) => num == x.num;
public override bool Equals(object obj) => obj is ModInt m && num == m.num;
public override int GetHashCode()
{
return HashCode.Combine(num);
}
}
public static class Program
{
public static void Main(string[] args)
{
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
Console.SetOut(sw);
var cin = new Scanner();
var solver = new Solver(cin, sw);
solver.Start();
Console.Out.Flush();
}
}
public static class Extention
{
public static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
public static int UpperBound<T>(this IList<T> list, T value) => list.BinarySearch(value, true, 0, list.Count, Comparer<T>.Default);
public static int LowerBound<T>(this IList<T> list, T value) => list.BinarySearch(value, false, 0, list.Count, Comparer<T>.Default);
public static int BinarySearch<T>(this IList<T> list, T value, bool isUpperBound, int index, int length, Comparer<T> comparer)
{
var ng = index - 1;
var ok = index + length;
while (ok - ng > 1)
{
var mid = ng + (ok - ng) / 2;
var res = comparer.Compare(list[mid], value);
if (res < 0 || (isUpperBound && res == 0)) ng = mid;
else ok = mid;
}
return ok;
}
public static bool Chmax<T>(ref this T a, T b) where T : struct, IComparable<T>
{
if (a.CompareTo(b) >= 0) return false;
a = b;
return true;
}
public static bool Chmin<T>(ref this T a, T b) where T : struct, IComparable<T>
{
if (a.CompareTo(b) <= 0) return false;
a = b;
return true;
}
}
public class Scanner
{
string[] s;
int i;
char[] separator = new char[] { ' ' };
public Scanner()
{
s = new string[0];
i = 0;
}
public string Read() => ReadString();
public string ReadString()
{
if (i < s.Length) return s[i++];
string st = Console.ReadLine();
while (st == "") st = Console.ReadLine();
s = st.Split(separator, StringSplitOptions.RemoveEmptyEntries);
if (s.Length == 0) return ReadString();
i = 0;
return s[i++];
}
public string[] ReadStringArray(int N)
{
string[] Array = new string[N];
for (int i = 0; i < N; i++)
{
Array[i] = ReadString();
}
return Array;
}
public int ReadInt() => int.Parse(ReadString());
public int[] ReadIntArray(int N, int add = 0)
{
int[] Array = new int[N];
for (int i = 0; i < N; i++)
{
Array[i] = ReadInt() + add;
}
return Array;
}
public long ReadLong() => long.Parse(ReadString());
public long[] ReadLongArray(int N, long add = 0)
{
long[] Array = new long[N];
for (int i = 0; i < N; i++)
{
Array[i] = ReadLong() + add;
}
return Array;
}
public double ReadDouble() => double.Parse(ReadString());
public double[] ReadDoubleArray(int N, double add = 0)
{
double[] Array = new double[N];
for (int i = 0; i < N; i++)
{
Array[i] = ReadDouble() + add;
}
return Array;
}
public T1 ReadValue<T1>() => (T1)Convert.ChangeType(ReadString(), typeof(T1));
public (T1, T2) ReadValue<T1, T2>()
{
var inputs = ReadStringArray(2);
var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
return (v1, v2);
}
public (T1, T2, T3) ReadValue<T1, T2, T3>()
{
var inputs = ReadStringArray(3);
var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
return (v1, v2, v3);
}
public (T1, T2, T3, T4) ReadValue<T1, T2, T3, T4>()
{
var inputs = ReadStringArray(4);
var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
return (v1, v2, v3, v4);
}
public (T1, T2, T3, T4, T5) ReadValue<T1, T2, T3, T4, T5>()
{
var inputs = ReadStringArray(5);
var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
return (v1, v2, v3, v4, v5);
}
public (T1, T2, T3, T4, T5, T6) ReadValue<T1, T2, T3, T4, T5, T6>()
{
var inputs = ReadStringArray(6);
var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
return (v1, v2, v3, v4, v5, v6);
}
public (T1, T2, T3, T4, T5, T6, T7) ReadValue<T1, T2, T3, T4, T5, T6, T7>()
{
var inputs = ReadStringArray(7);
var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
var v7 = (T7)Convert.ChangeType(inputs[6], typeof(T7));
return (v1, v2, v3, v4, v5, v6, v7);
}
public T1[] ReadValueArray<T1>(int N)
{
var v1 = new T1[N];
for (int i = 0; i < N; i++)
{
v1[i] = ReadValue<T1>();
}
return v1;
}
public (T1[], T2[]) ReadValueArray<T1, T2>(int N)
{
var (v1, v2) = (new T1[N], new T2[N]);
for (int i = 0; i < N; i++)
{
var (t1, t2) = ReadValue<T1, T2>();
v1[i] = t1;
v2[i] = t2;
}
return (v1, v2);
}
public (T1[], T2[], T3[]) ReadValueArray<T1, T2, T3>(int N)
{
var (v1, v2, v3) = (new T1[N], new T2[N], new T3[N]);
for (int i = 0; i < N; i++)
{
var (t1, t2, t3) = ReadValue<T1, T2, T3>();
v1[i] = t1;
v2[i] = t2;
v3[i] = t3;
}
return (v1, v2, v3);
}
public (T1[], T2[], T3[], T4[]) ReadValueArray<T1, T2, T3, T4>(int N)
{
var (v1, v2, v3, v4) = (new T1[N], new T2[N], new T3[N], new T4[N]);
for (int i = 0; i < N; i++)
{
var (t1, t2, t3, t4) = ReadValue<T1, T2, T3, T4>();
v1[i] = t1;
v2[i] = t2;
v3[i] = t3;
v4[i] = t4;
}
return (v1, v2, v3, v4);
}
public (T1[], T2[], T3[], T4[], T5[]) ReadValueArray<T1, T2, T3, T4, T5>(int N)
{
var (v1, v2, v3, v4, v5) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N]);
for (int i = 0; i < N; i++)
{
var (t1, t2, t3, t4, t5) = ReadValue<T1, T2, T3, T4, T5>();
v1[i] = t1;
v2[i] = t2;
v3[i] = t3;
v4[i] = t4;
v5[i] = t5;
}
return (v1, v2, v3, v4, v5);
}
public (T1[], T2[], T3[], T4[], T5[], T6[]) ReadValueArray<T1, T2, T3, T4, T5, T6>(int N)
{
var (v1, v2, v3, v4, v5, v6) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N]);
for (int i = 0; i < N; i++)
{
var (t1, t2, t3, t4, t5, t6) = ReadValue<T1, T2, T3, T4, T5, T6>();
v1[i] = t1;
v2[i] = t2;
v3[i] = t3;
v4[i] = t4;
v5[i] = t5;
v6[i] = t6;
}
return (v1, v2, v3, v4, v5, v6);
}
public (T1[], T2[], T3[], T4[], T5[], T6[], T7[]) ReadValueArray<T1, T2, T3, T4, T5, T6, T7>(int N)
{
var (v1, v2, v3, v4, v5, v6, v7) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N], new T7[N]);
for (int i = 0; i < N; i++)
{
var (t1, t2, t3, t4, t5, t6, t7) = ReadValue<T1, T2, T3, T4, T5, T6, T7>();
v1[i] = t1;
v2[i] = t2;
v3[i] = t3;
v4[i] = t4;
v5[i] = t5;
v6[i] = t6;
v7[i] = t7;
}
return (v1, v2, v3, v4, v5, v6, v7);
}
}
}