結果
問題 | No.910 素数部分列 |
ユーザー | hiromi_ayase |
提出日時 | 2019-10-18 21:59:26 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,905 bytes |
コンパイル時間 | 4,236 ms |
コンパイル使用メモリ | 83,556 KB |
実行使用メモリ | 55,196 KB |
最終ジャッジ日時 | 2023-09-07 22:24:53 |
合計ジャッジ時間 | 12,225 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
50,752 KB |
testcase_01 | AC | 70 ms
51,424 KB |
testcase_02 | AC | 70 ms
50,812 KB |
testcase_03 | AC | 71 ms
50,788 KB |
testcase_04 | AC | 70 ms
48,900 KB |
testcase_05 | AC | 70 ms
51,268 KB |
testcase_06 | AC | 70 ms
50,792 KB |
testcase_07 | AC | 69 ms
50,780 KB |
testcase_08 | AC | 70 ms
50,724 KB |
testcase_09 | AC | 71 ms
50,892 KB |
testcase_10 | AC | 70 ms
50,704 KB |
testcase_11 | AC | 70 ms
50,916 KB |
testcase_12 | AC | 70 ms
48,856 KB |
testcase_13 | AC | 75 ms
50,984 KB |
testcase_14 | AC | 70 ms
51,124 KB |
testcase_15 | WA | - |
testcase_16 | AC | 70 ms
50,988 KB |
testcase_17 | AC | 70 ms
51,076 KB |
testcase_18 | AC | 72 ms
51,072 KB |
testcase_19 | AC | 70 ms
50,812 KB |
testcase_20 | WA | - |
testcase_21 | AC | 70 ms
51,032 KB |
testcase_22 | AC | 71 ms
51,092 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | AC | 164 ms
54,712 KB |
testcase_42 | WA | - |
testcase_43 | AC | 160 ms
54,596 KB |
testcase_44 | AC | 158 ms
54,604 KB |
testcase_45 | AC | 158 ms
54,800 KB |
testcase_46 | AC | 157 ms
55,036 KB |
testcase_47 | WA | - |
testcase_48 | AC | 155 ms
54,748 KB |
testcase_49 | AC | 157 ms
54,696 KB |
testcase_50 | AC | 157 ms
54,612 KB |
testcase_51 | AC | 153 ms
54,512 KB |
testcase_52 | AC | 155 ms
54,252 KB |
ソースコード
public class Main { private static void solve() { int n = ni(); char[] s = ns(); int ret = 0; int nine = 0; int one = 0; for (char c : s) { int d = c - '0'; if (d == 3 || d == 5 || d == 7) { ret++; } else if (d == 1) { one++; if (nine >= 2) { nine -= 2; one--; ret++; } } else { nine++; if (one >= 1) { nine--; one--; ret++; } } } ret += one / 2; System.out.println(ret); } 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)); } }