結果

問題 No.616 へんなソート
ユーザー EmKjpEmKjp
提出日時 2019-06-04 22:38:53
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 418 ms / 2,000 ms
コード長 4,489 bytes
コンパイル時間 1,036 ms
コンパイル使用メモリ 114,012 KB
実行使用メモリ 46,996 KB
最終ジャッジ日時 2024-09-17 20:51:41
合計ジャッジ時間 4,015 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge6
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
24,816 KB
testcase_01 AC 27 ms
24,844 KB
testcase_02 AC 27 ms
24,956 KB
testcase_03 AC 27 ms
24,708 KB
testcase_04 AC 26 ms
24,820 KB
testcase_05 AC 27 ms
26,856 KB
testcase_06 AC 29 ms
26,884 KB
testcase_07 AC 29 ms
26,860 KB
testcase_08 AC 28 ms
24,940 KB
testcase_09 AC 28 ms
24,692 KB
testcase_10 AC 28 ms
22,580 KB
testcase_11 AC 28 ms
26,884 KB
testcase_12 AC 30 ms
27,120 KB
testcase_13 AC 164 ms
46,040 KB
testcase_14 AC 29 ms
24,692 KB
testcase_15 AC 28 ms
22,836 KB
testcase_16 AC 28 ms
22,704 KB
testcase_17 AC 101 ms
41,436 KB
testcase_18 AC 40 ms
28,724 KB
testcase_19 AC 43 ms
29,684 KB
testcase_20 AC 30 ms
28,796 KB
testcase_21 AC 28 ms
26,736 KB
testcase_22 AC 31 ms
27,132 KB
testcase_23 AC 27 ms
24,756 KB
testcase_24 AC 27 ms
24,812 KB
testcase_25 AC 27 ms
26,888 KB
testcase_26 AC 26 ms
24,972 KB
testcase_27 AC 27 ms
26,884 KB
testcase_28 AC 418 ms
46,996 KB
testcase_29 AC 416 ms
43,016 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.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
using E = System.Linq.Enumerable;


partial class Solver
{
    public void Run()
    {
        var N = ni();
        var K = ni();
        var a = ni(N);
        var dp = new long[K + 1];
        dp[0] = 1;
        int mod = 1000000007;
        for (int i = 1; i <= N - 1; i++)
        {
            var next = new long[K + 1];
            for (int j = 0; j < dp.Length; j++)
            {
                if (dp[j] == 0) continue;
                next[j] += dp[j];
                if (j + i + 1 < next.Length) next[j + i + 1] -= dp[j];
            }
            for (int j = 1; j < next.Length; j++)
            {
                next[j] += next[j - 1];
                next[j] %= mod;
                if (next[j] < 0) next[j] += mod;
            }
            dp = next;
        }
        cout.WriteLine(dp.Sum() % mod);
    }


}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
#if LOCAL
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader)
    {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer)
    {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

public static class LinqPadExtension
{
    static public T Dump<T>(this T obj)
    {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}
public class Scanner
{
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In)
    {
    }

    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size)
    {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size)
    {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public double[] NextDoubleArray(int size)
    {
        var array = new double[size];
        for (int i = 0; i < size; i++) array[i] = NextDouble();
        return array;
    }

    public string Next()
    {
        if (TokenQueue.Count == 0)
        {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext()
    {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }
    static readonly char[] _separator = new[] { ' ' };
    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0