結果
問題 | No.1694 ZerOne |
ユーザー | hiromi_ayase |
提出日時 | 2021-10-02 04:26:51 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 186 ms / 2,000 ms |
コード長 | 3,041 bytes |
コンパイル時間 | 3,324 ms |
コンパイル使用メモリ | 84,536 KB |
実行使用メモリ | 115,264 KB |
最終ジャッジ日時 | 2023-09-27 04:38:28 |
合計ジャッジ時間 | 7,692 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
50,908 KB |
testcase_01 | AC | 66 ms
51,148 KB |
testcase_02 | AC | 69 ms
50,880 KB |
testcase_03 | AC | 92 ms
56,968 KB |
testcase_04 | AC | 68 ms
50,844 KB |
testcase_05 | AC | 75 ms
50,984 KB |
testcase_06 | AC | 69 ms
50,852 KB |
testcase_07 | AC | 73 ms
48,900 KB |
testcase_08 | AC | 83 ms
54,904 KB |
testcase_09 | AC | 93 ms
61,524 KB |
testcase_10 | AC | 71 ms
50,988 KB |
testcase_11 | AC | 69 ms
50,880 KB |
testcase_12 | AC | 69 ms
50,800 KB |
testcase_13 | AC | 84 ms
54,556 KB |
testcase_14 | AC | 92 ms
61,344 KB |
testcase_15 | AC | 73 ms
50,804 KB |
testcase_16 | AC | 74 ms
50,900 KB |
testcase_17 | AC | 69 ms
50,896 KB |
testcase_18 | AC | 68 ms
50,848 KB |
testcase_19 | AC | 69 ms
51,068 KB |
testcase_20 | AC | 71 ms
50,816 KB |
testcase_21 | AC | 186 ms
115,264 KB |
testcase_22 | AC | 68 ms
50,932 KB |
testcase_23 | AC | 176 ms
115,108 KB |
testcase_24 | AC | 104 ms
65,056 KB |
testcase_25 | AC | 102 ms
65,156 KB |
testcase_26 | AC | 70 ms
51,144 KB |
testcase_27 | AC | 144 ms
89,600 KB |
testcase_28 | AC | 92 ms
61,340 KB |
testcase_29 | AC | 83 ms
54,568 KB |
testcase_30 | AC | 92 ms
56,816 KB |
testcase_31 | AC | 96 ms
61,324 KB |
testcase_32 | AC | 107 ms
64,964 KB |
testcase_33 | AC | 106 ms
65,144 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { char[] s = ns(); int cnt = 0; int sum = 0; int n = s.length; for (int i = 0; i < n; i++) { if (s[i] == '1') { cnt++; sum += i; } } long[][][] dp = new long[n + 1][cnt + 1][sum + 1]; dp[0][0][0] = 1; for (int i = 0; i < n; i ++) { for (int j = 0; j <= cnt; j ++) { for (int k = 0; k <= sum; k ++) { dp[i + 1][j][k] += dp[i][j][k]; if (j + 1 <= cnt && k + i <= sum) { dp[i + 1][j + 1][k + i] += dp[i][j][k]; } } } } System.out.println(dp[n][cnt][sum]); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }