結果

問題 No.616 へんなソート
ユーザー GrenacheGrenache
提出日時 2018-01-04 11:19:44
言語 Java21
(openjdk 21)
結果
AC  
実行時間 282 ms / 2,000 ms
コード長 4,642 bytes
コンパイル時間 3,967 ms
コンパイル使用メモリ 75,356 KB
実行使用メモリ 52,348 KB
最終ジャッジ日時 2023-08-24 18:28:10
合計ジャッジ時間 7,279 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,564 KB
testcase_01 AC 43 ms
49,296 KB
testcase_02 AC 44 ms
49,300 KB
testcase_03 AC 43 ms
49,904 KB
testcase_04 AC 45 ms
49,488 KB
testcase_05 AC 42 ms
49,252 KB
testcase_06 AC 45 ms
49,688 KB
testcase_07 AC 43 ms
49,356 KB
testcase_08 AC 46 ms
49,384 KB
testcase_09 AC 50 ms
49,468 KB
testcase_10 AC 43 ms
49,860 KB
testcase_11 AC 45 ms
49,416 KB
testcase_12 AC 58 ms
49,656 KB
testcase_13 AC 141 ms
51,744 KB
testcase_14 AC 57 ms
49,596 KB
testcase_15 AC 44 ms
49,512 KB
testcase_16 AC 46 ms
49,528 KB
testcase_17 AC 103 ms
52,348 KB
testcase_18 AC 72 ms
50,620 KB
testcase_19 AC 74 ms
51,876 KB
testcase_20 AC 46 ms
49,440 KB
testcase_21 AC 46 ms
49,512 KB
testcase_22 AC 59 ms
49,420 KB
testcase_23 AC 43 ms
49,316 KB
testcase_24 AC 43 ms
49,564 KB
testcase_25 AC 43 ms
49,400 KB
testcase_26 AC 47 ms
48,056 KB
testcase_27 AC 48 ms
49,648 KB
testcase_28 AC 282 ms
51,968 KB
testcase_29 AC 282 ms
51,956 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder616_1 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		final int MOD = 1_000_000_007;

		int n = sc.nextInt();
		int k = sc.nextInt();

		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}

		//		T(n, k) = T(n, k-1) + T(n-1, k) - T(n-1, k-n). (End)


		int[][] dp = new int[2][k + 1];
		dp[0][0] = 1;
		for (int i = 1; i <= n; i++) {
			for (int j = 0; j <= k; j++) {
				dp[i % 2][j] = dp[(i + 1) % 2][j];
				if (j > 0) {
					dp[i % 2][j] += dp[i % 2][j - 1];
					dp[i % 2][j] %= MOD;
				}
				if (j - i >= 0) {
					dp[i % 2][j] -= dp[(i + 1) % 2][j - i];
					dp[i % 2][j] %= MOD;
					dp[i % 2][j] += MOD;
					dp[i % 2][j] %= MOD;
				}
			}
		}

		int ans = 0;
		for (int i = 0; i <= k; i++) {
//			pr.println(dp[n % 2][i]);
			ans += dp[n % 2][i];
			ans %= MOD;
		}

		pr.println(ans);
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0