結果
問題 | No.732 3PrimeCounting |
ユーザー |
|
提出日時 | 2018-09-07 22:41:56 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 575 ms / 3,000 ms |
コード長 | 4,791 bytes |
コンパイル時間 | 4,707 ms |
コンパイル使用メモリ | 86,856 KB |
実行使用メモリ | 52,456 KB |
最終ジャッジ日時 | 2024-05-07 04:01:23 |
合計ジャッジ時間 | 18,635 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
50,320 KB |
testcase_01 | AC | 53 ms
50,396 KB |
testcase_02 | AC | 51 ms
50,304 KB |
testcase_03 | AC | 53 ms
49,956 KB |
testcase_04 | AC | 52 ms
50,456 KB |
testcase_05 | AC | 52 ms
50,312 KB |
testcase_06 | AC | 52 ms
50,280 KB |
testcase_07 | AC | 53 ms
50,292 KB |
testcase_08 | AC | 51 ms
50,364 KB |
testcase_09 | AC | 54 ms
50,340 KB |
testcase_10 | AC | 53 ms
50,012 KB |
testcase_11 | AC | 53 ms
49,992 KB |
testcase_12 | AC | 52 ms
50,048 KB |
testcase_13 | AC | 55 ms
50,424 KB |
testcase_14 | AC | 53 ms
50,372 KB |
testcase_15 | AC | 53 ms
50,312 KB |
testcase_16 | AC | 52 ms
50,080 KB |
testcase_17 | AC | 52 ms
50,292 KB |
testcase_18 | AC | 54 ms
49,996 KB |
testcase_19 | AC | 53 ms
50,316 KB |
testcase_20 | AC | 54 ms
50,068 KB |
testcase_21 | AC | 64 ms
50,540 KB |
testcase_22 | AC | 63 ms
50,772 KB |
testcase_23 | AC | 54 ms
49,928 KB |
testcase_24 | AC | 53 ms
50,080 KB |
testcase_25 | AC | 87 ms
51,424 KB |
testcase_26 | AC | 82 ms
51,176 KB |
testcase_27 | AC | 55 ms
50,312 KB |
testcase_28 | AC | 53 ms
50,076 KB |
testcase_29 | AC | 60 ms
50,404 KB |
testcase_30 | AC | 59 ms
50,232 KB |
testcase_31 | AC | 64 ms
50,520 KB |
testcase_32 | AC | 84 ms
51,576 KB |
testcase_33 | AC | 82 ms
51,188 KB |
testcase_34 | AC | 84 ms
51,184 KB |
testcase_35 | AC | 69 ms
50,748 KB |
testcase_36 | AC | 67 ms
50,820 KB |
testcase_37 | AC | 56 ms
50,296 KB |
testcase_38 | AC | 54 ms
50,268 KB |
testcase_39 | AC | 82 ms
51,468 KB |
testcase_40 | AC | 65 ms
50,816 KB |
testcase_41 | AC | 64 ms
50,312 KB |
testcase_42 | AC | 64 ms
50,680 KB |
testcase_43 | AC | 67 ms
50,704 KB |
testcase_44 | AC | 64 ms
50,376 KB |
testcase_45 | AC | 56 ms
50,256 KB |
testcase_46 | AC | 56 ms
49,948 KB |
testcase_47 | AC | 58 ms
50,216 KB |
testcase_48 | AC | 82 ms
51,800 KB |
testcase_49 | AC | 80 ms
51,160 KB |
testcase_50 | AC | 63 ms
50,708 KB |
testcase_51 | AC | 64 ms
50,276 KB |
testcase_52 | AC | 54 ms
50,096 KB |
testcase_53 | AC | 96 ms
51,884 KB |
testcase_54 | AC | 259 ms
51,832 KB |
testcase_55 | AC | 262 ms
51,924 KB |
testcase_56 | AC | 266 ms
51,868 KB |
testcase_57 | AC | 130 ms
51,684 KB |
testcase_58 | AC | 130 ms
51,608 KB |
testcase_59 | AC | 110 ms
52,456 KB |
testcase_60 | AC | 144 ms
51,812 KB |
testcase_61 | AC | 145 ms
51,888 KB |
testcase_62 | AC | 317 ms
51,680 KB |
testcase_63 | AC | 188 ms
51,904 KB |
testcase_64 | AC | 157 ms
51,776 KB |
testcase_65 | AC | 152 ms
51,572 KB |
testcase_66 | AC | 53 ms
50,060 KB |
testcase_67 | AC | 53 ms
50,388 KB |
testcase_68 | AC | 293 ms
51,956 KB |
testcase_69 | AC | 290 ms
51,876 KB |
testcase_70 | AC | 264 ms
51,696 KB |
testcase_71 | AC | 266 ms
51,768 KB |
testcase_72 | AC | 177 ms
51,604 KB |
testcase_73 | AC | 449 ms
51,920 KB |
testcase_74 | AC | 447 ms
51,852 KB |
testcase_75 | AC | 84 ms
51,260 KB |
testcase_76 | AC | 289 ms
51,940 KB |
testcase_77 | AC | 132 ms
51,944 KB |
testcase_78 | AC | 360 ms
51,872 KB |
testcase_79 | AC | 292 ms
51,972 KB |
testcase_80 | AC | 345 ms
51,936 KB |
testcase_81 | AC | 268 ms
51,840 KB |
testcase_82 | AC | 57 ms
50,360 KB |
testcase_83 | AC | 134 ms
51,968 KB |
testcase_84 | AC | 136 ms
51,844 KB |
testcase_85 | AC | 237 ms
51,656 KB |
testcase_86 | AC | 338 ms
51,904 KB |
testcase_87 | AC | 572 ms
51,956 KB |
testcase_88 | AC | 575 ms
51,956 KB |
ソースコード
package contest180907; 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 D2 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] primes = sieveEratosthenes(3*n); short[] p2 = new short[3*n+1]; for(int p : primes) { if(p > n)break; p2[2*p]--; for(int q : primes) { if(q >= p)break; p2[p+q]++; } } long ans = 0; for(int p : primes) { for(int q : primes) { if(q > n || p-q < 1)break; ans += p2[p-q]; } } out.println(ans/3); } public static int[] sieveEratosthenes(int n) { if (n <= 32) { int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 }; for (int i = 0; i < primes.length; i++) { if (n < primes[i]) { return Arrays.copyOf(primes, i); } } return primes; } int u = n + 32; double lu = Math.log(u); int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)]; ret[0] = 2; int pos = 1; int[] isnp = new int[(n + 1) / 32 / 2 + 1]; int sup = (n + 1) / 32 / 2 + 1; int[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 }; for (int tp : tprimes) { ret[pos++] = tp; int[] ptn = new int[tp]; for (int i = (tp - 3) / 2; i < tp << 5; i += tp) ptn[i >> 5] |= 1 << (i & 31); for (int j = 0; j < sup; j += tp) { for (int i = 0; i < tp && i + j < sup; i++) { isnp[j + i] |= ptn[i]; } } } // 3,5,7 // 2x+3=n int[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14 }; int h = n / 2; for (int i = 0; i < sup; i++) { for (int j = ~isnp[i]; j != 0; j &= j - 1) { int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27]; int p = 2 * pp + 3; if (p > n) break; ret[pos++] = p; if ((long) p * p > n) continue; for (int q = (p * p - 3) / 2; q <= h; q += p) isnp[q >> 5] |= 1 << q; } } return Arrays.copyOf(ret, pos); } 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 D2().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)); } }