結果
問題 | No.616 へんなソート |
ユーザー |
|
提出日時 | 2018-01-04 11:19:44 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 315 ms / 2,000 ms |
コード長 | 4,642 bytes |
コンパイル時間 | 3,996 ms |
コンパイル使用メモリ | 78,228 KB |
実行使用メモリ | 39,348 KB |
最終ジャッジ日時 | 2024-12-23 03:04:18 |
合計ジャッジ時間 | 7,627 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
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);}}}