結果
問題 | No.535 自然数の収納方法 |
ユーザー | uwi |
提出日時 | 2017-06-23 23:28:35 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 228 ms / 2,000 ms |
コード長 | 4,215 bytes |
コンパイル時間 | 4,130 ms |
コンパイル使用メモリ | 81,192 KB |
実行使用メモリ | 113,552 KB |
最終ジャッジ日時 | 2024-04-14 06:27:03 |
合計ジャッジ時間 | 7,526 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
49,892 KB |
testcase_01 | AC | 52 ms
49,984 KB |
testcase_02 | AC | 53 ms
50,332 KB |
testcase_03 | AC | 52 ms
50,128 KB |
testcase_04 | AC | 52 ms
49,920 KB |
testcase_05 | AC | 54 ms
50,268 KB |
testcase_06 | AC | 54 ms
49,864 KB |
testcase_07 | AC | 110 ms
60,808 KB |
testcase_08 | AC | 162 ms
84,608 KB |
testcase_09 | AC | 164 ms
83,856 KB |
testcase_10 | AC | 175 ms
84,488 KB |
testcase_11 | AC | 89 ms
54,356 KB |
testcase_12 | AC | 131 ms
63,724 KB |
testcase_13 | AC | 55 ms
50,040 KB |
testcase_14 | AC | 117 ms
64,604 KB |
testcase_15 | AC | 207 ms
112,164 KB |
testcase_16 | AC | 163 ms
84,340 KB |
testcase_17 | AC | 185 ms
112,240 KB |
testcase_18 | AC | 53 ms
50,248 KB |
testcase_19 | AC | 200 ms
111,948 KB |
testcase_20 | AC | 228 ms
113,552 KB |
testcase_21 | AC | 182 ms
112,204 KB |
testcase_22 | AC | 181 ms
111,928 KB |
ソースコード
package contest170623; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class F { InputStream is; PrintWriter out; String INPUT = ""; void solve() { // a[n-1]-(n-1) < a[n] // a[3]-3 < a[4] tight // a[3] < a[4]+4 // a[n]-n < a[1] // a[n] < a[1] + 1 int n = ni(); int mod = 1000000007; long ans = 0; { // a[n-1]-(n-1) < a[n] < a[1] + 1 // a[n-1] < a[n] + n // a[n-1] - (n-1) < a[n] // a[n] - 1 < a[1] // a[i-1] - (i-1) < a[i] // a[i-1] < a[i] + i long[][] dp = new long[n][n+1]; // 0:n // 1:1 for(int i = 1;i <= n;i++){ dp[0][i] = 1; } for(int i = 1;i < n;i++){ // a[i-1]-t < a[i] int p = 1; long s = 0; for(int j = 1;j <= n;j++){ int t = i == 1 ? 1 : i-1; while(p <= n && p-t < j){ s += dp[i-1][p]; if(s >= mod)s -= mod; p++; } dp[i][j] = s; } } for(int j = 1;j <= n;j++){ ans += dp[n-1][j]; } } { long[][] dp = new long[n][n+1]; // 0:n // 1:1 dp[0][1] = 1; for(int i = 1;i < n;i++){ // a[i-1]-t < a[i] int p = 1; long s = 0; for(int j = 1;j <= n;j++){ int t = i == 1 ? 1 : i-1; while(p <= n && p-t < j){ s += dp[i-1][p]; if(s >= mod)s -= mod; p++; } dp[i][j] = s; } } ans -= dp[n-1][n]; } ans += mod; out.println(ans%mod); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new F().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }