結果
問題 | No.910 素数部分列 |
ユーザー | uwi |
提出日時 | 2019-10-18 22:40:57 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 170 ms / 1,000 ms |
コード長 | 6,525 bytes |
コンパイル時間 | 4,752 ms |
コンパイル使用メモリ | 86,056 KB |
実行使用メモリ | 40,756 KB |
最終ジャッジ日時 | 2024-06-25 21:49:16 |
合計ジャッジ時間 | 10,304 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
37,024 KB |
testcase_01 | AC | 50 ms
36,892 KB |
testcase_02 | AC | 49 ms
37,032 KB |
testcase_03 | AC | 48 ms
37,120 KB |
testcase_04 | AC | 49 ms
36,928 KB |
testcase_05 | AC | 48 ms
36,820 KB |
testcase_06 | AC | 47 ms
36,960 KB |
testcase_07 | AC | 47 ms
36,964 KB |
testcase_08 | AC | 48 ms
37,100 KB |
testcase_09 | AC | 48 ms
36,900 KB |
testcase_10 | AC | 48 ms
36,624 KB |
testcase_11 | AC | 49 ms
36,980 KB |
testcase_12 | AC | 48 ms
36,940 KB |
testcase_13 | AC | 50 ms
36,824 KB |
testcase_14 | AC | 48 ms
36,984 KB |
testcase_15 | AC | 48 ms
36,844 KB |
testcase_16 | AC | 50 ms
36,956 KB |
testcase_17 | AC | 50 ms
36,956 KB |
testcase_18 | AC | 50 ms
37,056 KB |
testcase_19 | AC | 49 ms
36,808 KB |
testcase_20 | AC | 48 ms
36,744 KB |
testcase_21 | AC | 48 ms
36,972 KB |
testcase_22 | AC | 48 ms
37,236 KB |
testcase_23 | AC | 121 ms
39,192 KB |
testcase_24 | AC | 114 ms
40,112 KB |
testcase_25 | AC | 111 ms
39,132 KB |
testcase_26 | AC | 114 ms
40,212 KB |
testcase_27 | AC | 114 ms
39,592 KB |
testcase_28 | AC | 114 ms
39,628 KB |
testcase_29 | AC | 131 ms
40,316 KB |
testcase_30 | AC | 130 ms
39,132 KB |
testcase_31 | AC | 132 ms
40,304 KB |
testcase_32 | AC | 132 ms
39,272 KB |
testcase_33 | AC | 132 ms
40,256 KB |
testcase_34 | AC | 130 ms
39,140 KB |
testcase_35 | AC | 123 ms
39,008 KB |
testcase_36 | AC | 135 ms
40,644 KB |
testcase_37 | AC | 130 ms
40,528 KB |
testcase_38 | AC | 128 ms
40,280 KB |
testcase_39 | AC | 127 ms
40,376 KB |
testcase_40 | AC | 130 ms
39,084 KB |
testcase_41 | AC | 120 ms
39,120 KB |
testcase_42 | AC | 128 ms
38,972 KB |
testcase_43 | AC | 122 ms
39,944 KB |
testcase_44 | AC | 124 ms
40,364 KB |
testcase_45 | AC | 123 ms
40,140 KB |
testcase_46 | AC | 125 ms
38,992 KB |
testcase_47 | AC | 129 ms
39,920 KB |
testcase_48 | AC | 104 ms
38,640 KB |
testcase_49 | AC | 142 ms
39,056 KB |
testcase_50 | AC | 170 ms
40,756 KB |
testcase_51 | AC | 91 ms
38,424 KB |
testcase_52 | AC | 135 ms
40,672 KB |
ソースコード
package contest191018;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.ArrayList;import java.util.Arrays;import java.util.InputMismatchException;import java.util.List;public class C2 {InputStream is;PrintWriter out;String INPUT = "";// 5は素数だったvoid solve(){int n = ni();char[] s = ns(n);int ans = 0;// 3 5 7// 11 19 991for(char c : s) {if(c == '3' || c == '5' || c == '7') {ans++;}}LST nine = new LST(n);LST one = new LST(n);int none = 0;for(int i = 0;i < n;i++) {if(s[i] == '1') {one.set(i);none++;}else if(s[i] == '9') {nine.set(i);}}// 19for(int i = n-1;i >= 0;i--) {if(s[i] == '1' && one.get(i)) {int nn = nine.next(i);if(nn != -1) {nine.unset(nn);one.unset(i);ans++;none--;}}}for(int i = 0;i < n;i++) {if(s[i] == '1' && one.get(i)) {int nn = nine.prev(i);if(nn != -1) {int nnn = nine.prev(nn-1);if(nnn != -1) {nine.unset(nn);nine.unset(nnn);one.unset(i);ans++;none--;}}}}ans += none/2;out.println(ans);}public static class LST {public long[][] set;public int n;// public int size;public LST(int n) {this.n = n;int d = 1;for(int m = n;m > 1;m>>>=6, d++);set = new long[d][];for(int i = 0, m = n>>>6;i < d;i++, m>>>=6){set[i] = new long[m+1];}// size = 0;}// [0,r)public LST setRange(int r){for(int i = 0;i < set.length;i++, r=r+63>>>6){for(int j = 0;j < r>>>6;j++){set[i][j] = -1L;}if((r&63) != 0)set[i][r>>>6] |= (1L<<r)-1;}return this;}// [0,r)public LST unsetRange(int r){if(r >= 0){for(int i = 0;i < set.length;i++, r=r+63>>>6){for(int j = 0;j < r+63>>>6;j++){set[i][j] = 0;}if((r&63) != 0)set[i][r>>>6] &= ~((1L<<r)-1);}}return this;}public LST set(int pos){if(pos >= 0 && pos < n){// if(!get(pos))size++;for(int i = 0;i < set.length;i++, pos>>>=6){set[i][pos>>>6] |= 1L<<pos;}}return this;}public LST unset(int pos){if(pos >= 0 && pos < n){// if(get(pos))size--;for(int i = 0;i < set.length && (i == 0 || set[i-1][pos] == 0L);i++, pos>>>=6){set[i][pos>>>6] &= ~(1L<<pos);}}return this;}public boolean get(int pos){return pos >= 0 && pos < n && set[0][pos>>>6]<<~pos<0;}public LST toggle(int pos){return get(pos) ? unset(pos) : set(pos);}public int prev(int pos){for(int i = 0;i < set.length && pos >= 0;i++, pos>>>=6, pos--){int pre = prev(set[i][pos>>>6], pos&63);if(pre != -1){pos = pos>>>6<<6|pre;while(i > 0)pos = pos<<6|63-Long.numberOfLeadingZeros(set[--i][pos]);return pos;}}return -1;}public int next(int pos){for(int i = 0;i < set.length && pos>>>6 < set[i].length;i++, pos>>>=6, pos++){int nex = next(set[i][pos>>>6], pos&63);if(nex != -1){pos = pos>>>6<<6|nex;while(i > 0)pos = pos<<6|Long.numberOfTrailingZeros(set[--i][pos]);return pos;}}return -1;}private static int prev(long set, int n){long h = set<<~n;if(h == 0L)return -1;return -Long.numberOfLeadingZeros(h)+n;}private static int next(long set, int n){long h = set>>>n;if(h == 0L)return -1;return Long.numberOfTrailingZeros(h)+n;}@Overridepublic String toString(){List<Integer> list = new ArrayList<Integer>();for(int pos = next(0);pos != -1;pos = next(pos+1)){list.add(pos);}return list.toString();}}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 C2().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)); }}