結果
問題 | No.1011 Infinite Stairs |
ユーザー | EmKjp |
提出日時 | 2020-03-28 00:07:43 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 424 ms / 2,000 ms |
コード長 | 5,485 bytes |
コンパイル時間 | 2,761 ms |
コンパイル使用メモリ | 108,112 KB |
実行使用メモリ | 22,632 KB |
最終ジャッジ日時 | 2023-09-24 11:11:09 |
合計ジャッジ時間 | 6,785 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
18,432 KB |
testcase_01 | AC | 48 ms
20,416 KB |
testcase_02 | AC | 55 ms
20,592 KB |
testcase_03 | AC | 293 ms
20,484 KB |
testcase_04 | AC | 92 ms
20,628 KB |
testcase_05 | AC | 424 ms
20,600 KB |
testcase_06 | AC | 49 ms
22,472 KB |
testcase_07 | AC | 53 ms
20,632 KB |
testcase_08 | AC | 49 ms
22,576 KB |
testcase_09 | AC | 53 ms
20,648 KB |
testcase_10 | AC | 54 ms
20,736 KB |
testcase_11 | AC | 103 ms
22,580 KB |
testcase_12 | AC | 51 ms
20,480 KB |
testcase_13 | AC | 83 ms
22,632 KB |
testcase_14 | AC | 50 ms
20,500 KB |
testcase_15 | AC | 92 ms
20,632 KB |
testcase_16 | AC | 231 ms
20,636 KB |
testcase_17 | AC | 66 ms
22,588 KB |
testcase_18 | AC | 143 ms
18,640 KB |
testcase_19 | AC | 50 ms
20,576 KB |
testcase_20 | AC | 52 ms
22,520 KB |
testcase_21 | AC | 94 ms
20,480 KB |
testcase_22 | AC | 128 ms
20,652 KB |
testcase_23 | AC | 92 ms
22,512 KB |
testcase_24 | AC | 98 ms
20,532 KB |
testcase_25 | AC | 135 ms
22,528 KB |
testcase_26 | AC | 67 ms
18,484 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.Globalization; using System.IO; using System.Text; using System.Linq; using E = System.Linq.Enumerable; internal partial class Solver { public void Run() { var N = ni(); var d = ni(); var K = ni(); var dp = new long[K + 1]; int mod = 1000000007; dp[0] = 1; for (int _ = 0; _ < N; _++) { int cur = K; long sum = 0; for (int i = K; i >= 0; i--) { while (cur >= 0 && i - cur <= d) { sum += dp[cur]; cur--; } sum -= dp[i]; dp[i] = sum; dp[i] %= mod; } } cout.WriteLine(dp[K] % mod); } } // PREWRITEN CODE BEGINS FROM HERE internal partial class Solver : Scanner { public static void Main(string[] args) { #if LOCAL byte[] inputBuffer = new byte[1000000]; var inputStream = Console.OpenStandardInput(inputBuffer.Length); using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) { Console.SetIn(reader); 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) { cin = reader; 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 } internal static class LinqPadExtension { [Conditional("DEBUG")] public static void Dump<T>(this T obj) { #if DEBUG LINQPad.Extensions.Dump(obj); #endif } } public class Scanner { private readonly TextReader Reader; private readonly CultureInfo ci = CultureInfo.InvariantCulture; private readonly char[] buffer = new char[2 * 1024]; private int cursor = 0, length = 0; private string Token; private readonly StringBuilder sb = new StringBuilder(1024); public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { Reader = reader; } public int NextInt() { return checked((int)NextLong()); } public long NextLong() { var s = Next(); long r = 0; int i = 0; bool negative = false; if (s[i] == '-') { negative = true; i++; } for (; i < s.Length; i++) { r = r * 10 + (s[i] - '0'); #if DEBUG if (!char.IsDigit(s[i])) throw new FormatException(); #endif } return negative ? -r : r; } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { string[] array = new string[size]; for (int i = 0; i < size; i++) { array[i] = Next(); } return array; } public int[] NextIntArray(int size) { int[] array = new int[size]; for (int i = 0; i < size; i++) { array[i] = NextInt(); } return array; } public long[] NextLongArray(int size) { long[] array = new long[size]; for (int i = 0; i < size; i++) { array[i] = NextLong(); } return array; } public double[] NextDoubleArray(int size) { double[] array = new double[size]; for (int i = 0; i < size; i++) { array[i] = NextDouble(); } return array; } public string Next() { if (Token == null) { if (!StockToken()) { throw new InvalidOperationException(); } } var token = Token; Token = null; return token; } public bool HasNext() { if (Token != null) { return true; } return StockToken(); } private bool StockToken() { while (true) { sb.Clear(); while (true) { if (cursor >= length) { cursor = 0; if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) { break; } } var c = buffer[cursor++]; if (33 <= c && c <= 126) { sb.Append(c); } else { if (sb.Length > 0) break; } } if (sb.Length > 0) { Token = sb.ToString(); return true; } return false; } } }