結果

問題 No.1238 選抜クラス
ユーザー keymoonkeymoon
提出日時 2020-09-25 21:43:55
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 183 ms / 2,000 ms
コード長 3,247 bytes
コンパイル時間 2,422 ms
コンパイル使用メモリ 109,824 KB
実行使用メモリ 19,968 KB
最終ジャッジ日時 2024-06-28 06:18:12
合計ジャッジ時間 7,342 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 34 ms
19,840 KB
testcase_01 AC 35 ms
19,840 KB
testcase_02 AC 43 ms
19,840 KB
testcase_03 AC 32 ms
19,840 KB
testcase_04 AC 32 ms
19,712 KB
testcase_05 AC 32 ms
19,840 KB
testcase_06 AC 31 ms
19,712 KB
testcase_07 AC 39 ms
19,840 KB
testcase_08 AC 44 ms
19,712 KB
testcase_09 AC 50 ms
19,968 KB
testcase_10 AC 41 ms
19,840 KB
testcase_11 AC 49 ms
19,840 KB
testcase_12 AC 45 ms
19,712 KB
testcase_13 AC 45 ms
19,712 KB
testcase_14 AC 44 ms
19,840 KB
testcase_15 AC 51 ms
19,840 KB
testcase_16 AC 49 ms
19,584 KB
testcase_17 AC 170 ms
19,584 KB
testcase_18 AC 167 ms
19,840 KB
testcase_19 AC 170 ms
19,968 KB
testcase_20 AC 164 ms
19,712 KB
testcase_21 AC 161 ms
19,584 KB
testcase_22 AC 169 ms
19,712 KB
testcase_23 AC 173 ms
19,840 KB
testcase_24 AC 169 ms
19,712 KB
testcase_25 AC 183 ms
19,584 KB
testcase_26 AC 173 ms
19,968 KB
testcase_27 AC 173 ms
19,712 KB
testcase_28 AC 176 ms
19,840 KB
testcase_29 AC 171 ms
19,840 KB
testcase_30 AC 73 ms
19,840 KB
testcase_31 AC 108 ms
19,712 KB
testcase_32 AC 139 ms
19,712 KB
testcase_33 AC 40 ms
19,712 KB
testcase_34 AC 149 ms
19,712 KB
testcase_35 AC 85 ms
19,712 KB
testcase_36 AC 57 ms
19,840 KB
testcase_37 AC 76 ms
19,840 KB
testcase_38 AC 165 ms
19,712 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

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;
        }
    }
}
0