結果
問題 | No.1238 選抜クラス |
ユーザー | keymoon |
提出日時 | 2020-09-25 21:43:55 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 226 ms / 2,000 ms |
コード長 | 3,247 bytes |
コンパイル時間 | 2,632 ms |
コンパイル使用メモリ | 107,412 KB |
実行使用メモリ | 25,068 KB |
最終ジャッジ日時 | 2023-09-10 15:07:24 |
合計ジャッジ時間 | 9,390 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 66 ms
22,832 KB |
testcase_01 | AC | 69 ms
24,876 KB |
testcase_02 | AC | 76 ms
23,016 KB |
testcase_03 | AC | 65 ms
22,828 KB |
testcase_04 | AC | 65 ms
23,004 KB |
testcase_05 | AC | 64 ms
22,820 KB |
testcase_06 | AC | 64 ms
24,776 KB |
testcase_07 | AC | 72 ms
24,920 KB |
testcase_08 | AC | 76 ms
24,844 KB |
testcase_09 | AC | 83 ms
24,808 KB |
testcase_10 | AC | 73 ms
24,844 KB |
testcase_11 | AC | 81 ms
22,908 KB |
testcase_12 | AC | 77 ms
22,788 KB |
testcase_13 | AC | 77 ms
22,880 KB |
testcase_14 | AC | 75 ms
22,808 KB |
testcase_15 | AC | 82 ms
22,824 KB |
testcase_16 | AC | 81 ms
22,792 KB |
testcase_17 | AC | 206 ms
25,068 KB |
testcase_18 | AC | 208 ms
24,888 KB |
testcase_19 | AC | 219 ms
22,864 KB |
testcase_20 | AC | 197 ms
24,916 KB |
testcase_21 | AC | 209 ms
22,872 KB |
testcase_22 | AC | 204 ms
22,788 KB |
testcase_23 | AC | 226 ms
20,780 KB |
testcase_24 | AC | 203 ms
24,836 KB |
testcase_25 | AC | 202 ms
20,732 KB |
testcase_26 | AC | 204 ms
23,036 KB |
testcase_27 | AC | 222 ms
22,772 KB |
testcase_28 | AC | 217 ms
22,728 KB |
testcase_29 | AC | 213 ms
23,016 KB |
testcase_30 | AC | 108 ms
24,824 KB |
testcase_31 | AC | 143 ms
24,848 KB |
testcase_32 | AC | 185 ms
22,864 KB |
testcase_33 | AC | 73 ms
22,812 KB |
testcase_34 | AC | 188 ms
22,900 KB |
testcase_35 | AC | 121 ms
24,880 KB |
testcase_36 | AC | 88 ms
24,888 KB |
testcase_37 | AC | 108 ms
22,832 KB |
testcase_38 | AC | 209 ms
22,832 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; using System.Collections.Generic; using System.Diagnostics; using System.IO; using System.Linq; using System.Numerics; using System.Text; using System.Text.RegularExpressions; using System.Threading.Tasks; using static System.Math; public static class P { public static void Main() { var nk = Console.ReadLine().Split().Select(int.Parse).ToArray(); var n = nk[0]; var k = nk[1]; var a = Console.ReadLine().Split().Select(x => int.Parse(x) - k).ToArray(); int OFFSET = 100000; ModInt[] dp = new ModInt[OFFSET * 2 + 1]; dp[OFFSET] = 1; foreach (var item in a) { if (item < 0) { for (int i = -item; i < dp.Length; i++) dp[i + item] += dp[i]; } else { for (int i = dp.Length - item - 1; i >= 0; i--) dp[i + item] += dp[i]; } } ModInt res = 0; for (int i = OFFSET; i < dp.Length; i++) res += dp[i]; Console.WriteLine(res - 1); } } struct ModInt { public const int Mod = 1000000007; const long POSITIVIZER = ((long)Mod) << 31; long Data; public ModInt(long data) { if ((Data = data % Mod) < 0) Data += Mod; } public static implicit operator long(ModInt modInt) => modInt.Data; public static implicit operator ModInt(long val) => new ModInt(val); public static ModInt operator +(ModInt a, int b) => new ModInt() { Data = (a.Data + b + POSITIVIZER) % Mod }; public static ModInt operator +(ModInt a, long b) => new ModInt(a.Data + b); public static ModInt operator +(ModInt a, ModInt b) { long res = a.Data + b.Data; return new ModInt() { Data = res >= Mod ? res - Mod : res }; } public static ModInt operator -(ModInt a, int b) => new ModInt() { Data = (a.Data - b + POSITIVIZER) % Mod }; public static ModInt operator -(ModInt a, long b) => new ModInt(a.Data - b); public static ModInt operator -(ModInt a, ModInt b) { long res = a.Data - b.Data; return new ModInt() { Data = res < 0 ? res + Mod : res }; } public static ModInt operator *(ModInt a, int b) => new ModInt(a.Data * b); public static ModInt operator *(ModInt a, long b) => a * new ModInt(b); public static ModInt operator *(ModInt a, ModInt b) => new ModInt() { Data = a.Data * b.Data % Mod }; public static ModInt operator /(ModInt a, ModInt b) => new ModInt() { Data = a.Data * GetInverse(b) % Mod }; public static bool operator ==(ModInt a, ModInt b) => a.Data == b.Data; public static bool operator !=(ModInt a, ModInt b) => a.Data != b.Data; public override string ToString() => Data.ToString(); public override bool Equals(object obj) => (ModInt)obj == this; public override int GetHashCode() => (int)Data; static long GetInverse(long a) { long div, p = Mod, x1 = 1, y1 = 0, x2 = 0, y2 = 1; while (true) { if (p == 1) return x2 + Mod; div = a / p; x1 -= x2 * div; y1 -= y2 * div; a %= p; if (a == 1) return x1 + Mod; div = p / a; x2 -= x1 * div; y2 -= y1 * div; p %= a; } } }