結果
問題 | No.269 見栄っ張りの募金活動 |
ユーザー | ひばち |
提出日時 | 2019-09-26 06:58:26 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 91 ms / 5,000 ms |
コード長 | 8,497 bytes |
コンパイル時間 | 2,033 ms |
コンパイル使用メモリ | 116,688 KB |
実行使用メモリ | 43,548 KB |
最終ジャッジ日時 | 2024-09-23 07:35:08 |
合計ジャッジ時間 | 3,770 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 27 ms
24,676 KB |
testcase_01 | AC | 32 ms
25,436 KB |
testcase_02 | AC | 28 ms
24,680 KB |
testcase_03 | AC | 33 ms
25,328 KB |
testcase_04 | AC | 54 ms
35,340 KB |
testcase_05 | AC | 32 ms
25,336 KB |
testcase_06 | AC | 32 ms
27,240 KB |
testcase_07 | AC | 91 ms
43,548 KB |
testcase_08 | AC | 31 ms
27,360 KB |
testcase_09 | AC | 28 ms
24,812 KB |
testcase_10 | AC | 31 ms
25,064 KB |
testcase_11 | AC | 35 ms
24,984 KB |
testcase_12 | AC | 27 ms
24,564 KB |
testcase_13 | AC | 38 ms
28,984 KB |
testcase_14 | AC | 32 ms
23,068 KB |
testcase_15 | AC | 37 ms
27,208 KB |
testcase_16 | AC | 27 ms
24,680 KB |
testcase_17 | AC | 27 ms
24,556 KB |
testcase_18 | AC | 52 ms
32,976 KB |
testcase_19 | AC | 36 ms
25,324 KB |
testcase_20 | AC | 33 ms
25,268 KB |
testcase_21 | AC | 33 ms
25,076 KB |
testcase_22 | AC | 35 ms
25,320 KB |
testcase_23 | AC | 31 ms
24,936 KB |
testcase_24 | AC | 33 ms
22,968 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.Collections.Generic; using System.Linq; using System.IO; using static System.Console; using static System.Convert; using static System.Math; using Pi = Pair<int, int>; using PL = Pair<long, int>; //using static System.Globalization.CultureInfo; using System.Text; class Program { public static bool chmin<T>(ref T num, T val) where T : IComparable<T> { if (num.CompareTo(val) == 1) { num = val; return true; } return false; } public static bool chmax<T>(ref T num, T val) where T : IComparable<T> { if (num.CompareTo(val) == -1) { num = val; return true; } return false; } public static void swap<T>(ref T v1, ref T v2) { var t = v2; v2 = v1; v1 = t; } public static void Fail() => Fail("No"); public static void Fail<T>(T s) { WriteLine(s); Console.Out.Close(); Environment.Exit(0); } static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw); var p = new Program(); for (var i = 1; i > 0; --i) p.Solve(); Console.Out.Flush(); } void Solve() { int num, s, k; Input.Make(out num, out s, out k); s -= num * (num - 1) / 2 * k; if (s < 0) Fail(0); var ps = Input.create(s + 1, _ => new ModInt[num+1]); ps[0][0] = 1; for(var i=0;i<=s;i++) for(var j=1;j<=num;j++) { ps[i][j] = ps[i][j - 1]; if (i - j >= 0) ps[i][j] += ps[i - j][j]; } WriteLine(ps[s][num]); } } public struct ModInt { public const long MOD = (int)1e9 + 7; //public const long MOD = 998244353; public long num { get; set; } public ModInt(long n = 0) { num = n; } private static ModInt[] _fac;//階乗 private static ModInt[] _inv;//逆数 private static ModInt[] _facrev;//1/(i!) public override string ToString() => num.ToString(); public static ModInt operator +(ModInt l, ModInt r) { l.num += r.num; if (l.num >= MOD) l.num -= MOD; return l; } public static ModInt operator -(ModInt l, ModInt r) { l.num -= r.num; if (l.num < 0) l.num += MOD; return l; } public static ModInt operator *(ModInt l, ModInt r) => new ModInt(l.num * r.num % MOD); public static ModInt operator /(ModInt l, ModInt r) => l * Pow(r, MOD - 2); public static implicit operator long(ModInt l) => l.num; public static implicit operator ModInt(long n) { n %= MOD; if (n < 0) n += MOD; return new ModInt(n); } public static ModInt Pow(ModInt m, long n) { if (n == 0) return 1; if (n % 2 == 0) return Pow(m * m, n >> 1); else return Pow(m * m, n >> 1) * m; } public static void CombBuild(int n) { _fac = new ModInt[n + 1]; _facrev = new ModInt[n + 1]; _inv = new ModInt[n + 1]; _inv[1] = 1; _fac[0] = _fac[1] = 1; _facrev[0] = _facrev[1] = 1; for (var i = 2; i <= n; i++) { _fac[i] = _fac[i - 1] * i; _inv[i] = MOD - _inv[MOD % i] * (MOD / i); _facrev[i] = _facrev[i - 1] * _inv[i]; } } public static ModInt Fac(ModInt n) => _fac[n]; public static ModInt Div(ModInt n) => _inv[n]; public static ModInt FacRev(ModInt n) => _facrev[n]; public static ModInt Part(ModInt n, ModInt r) { if (n < r) return 0; return _fac[n] * _facrev[n - r]; } public static ModInt Comb(ModInt n, ModInt r) { if (n < r) return 0; if (n == r) return 1; var calc = _fac[n]; calc = calc * _facrev[r]; calc = calc * _facrev[n - r]; return calc; } } public class Input { public static string read => ReadLine().Trim(); public static int[] ar => read.Split(' ').Select(int.Parse).ToArray(); public static int num => ToInt32(read); public static long[] arL => read.Split(' ').Select(long.Parse).ToArray(); public static long numL => ToInt64(read); public static T[] create<T>(int n, Func<int, T> f) => Enumerable.Repeat(0, n).Select(f).ToArray(); public static char[][] grid(int h) => create(h, _ => read.ToCharArray()); public static int[] ar1D(int n) => create(n, _ => num); public static long[] arL1D(int n) => create(n, _ => numL); public static string[] strs(int n) => create(n, _ => read); public static int[][] ar2D(int n) => create(n, _ => ar); public static long[][] arL2D(int n) => create(n, _ => arL); public static List<T>[] edge<T>(int n) => create(n, _ => new List<T>()); public static T GetValue<T>(string g) { var t = typeof(T); if (t == typeof(int)) return (T)(object)int.Parse(g); if (t == typeof(long)) return (T)(object)long.Parse(g); if (t == typeof(string)) return (T)(object)g; if (t == typeof(char)) return (T)(object)char.Parse(g); if (t == typeof(double)) return (T)(object)double.Parse(g); if (t == typeof(bool)) return (T)(object)bool.Parse(g); return default(T); } public static void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); } public static void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); } public static void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); } public static void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); } public static void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); } private static Queue<string> sc; public static T Next<T>() { sc = sc ?? new Queue<string>(); if (sc.Count == 0) foreach (var item in read.Split(' ')) sc.Enqueue(item); return GetValue<T>(sc.Dequeue()); } public static void Next<T>(ref T val) => val = Next<T>(); public const long Inf = (long)1e18; public const double eps = 1e-6; public const string Alfa = "abcdefghijklmnopqrstuvwxyz"; public const int MOD = 1000000007; } public class Pair<T1, T2> : IComparable<Pair<T1, T2>> { public T1 v1 { get; set; } public T2 v2 { get; set; } public Pair() { v1 = Input.Next<T1>(); v2 = Input.Next<T2>(); } public Pair(T1 v1, T2 v2) { this.v1 = v1; this.v2 = v2; } public int CompareTo(Pair<T1, T2> p) { var c = Comparer<T1>.Default.Compare(v1, p.v1); if (c == 0) c = Comparer<T2>.Default.Compare(v2, p.v2); return c; } public override string ToString() => $"{v1.ToString()} {v2.ToString()}"; public override bool Equals(object obj) => this == (Pair<T1, T2>)obj; public override int GetHashCode() => v1.GetHashCode() ^ v2.GetHashCode(); public static bool operator ==(Pair<T1, T2> p1, Pair<T1, T2> p2) => p1.CompareTo(p2) == 0; public static bool operator !=(Pair<T1, T2> p1, Pair<T1, T2> p2) => p1.CompareTo(p2) != 0; public static bool operator >(Pair<T1, T2> p1, Pair<T1, T2> p2) => p1.CompareTo(p2) == 1; public static bool operator >=(Pair<T1, T2> p1, Pair<T1, T2> p2) => p1.CompareTo(p2) != -1; public static bool operator <(Pair<T1, T2> p1, Pair<T1, T2> p2) => p1.CompareTo(p2) == -1; public static bool operator <=(Pair<T1, T2> p1, Pair<T1, T2> p2) => p1.CompareTo(p2) != 1; } public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>> { public T3 v3 { get; set; } public Pair() : base() { v3 = Input.Next<T3>(); } public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2) { this.v3 = v3; } public int CompareTo(Pair<T1, T2, T3> p) { var c = base.CompareTo(p); if (c == 0) c = Comparer<T3>.Default.Compare(v3, p.v3); return c; } public override string ToString() => $"{base.ToString()} {v3.ToString()}"; }