#283786 (Java21) No.732 3PrimeCounting

提出ソース

結果

問題	No.732 3PrimeCounting
ユーザー	hiromi_ayase
提出日時	2018-09-08 15:22:52
言語	Java21 (openjdk 21)
結果	AC
実行時間	2,547 ms / 3,000 ms
コード長	4,388 bytes
コンパイル時間	2,301 ms
コンパイル使用メモリ	90,756 KB
実行使用メモリ	42,040 KB
最終ジャッジ日時	2024-05-09 16:16:25
合計ジャッジ時間	37,397 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	63 ms 38,116 KB
testcase_01	AC	63 ms 38,116 KB
testcase_02	AC	64 ms 38,416 KB
testcase_03	AC	63 ms 38,448 KB
testcase_04	AC	64 ms 38,448 KB
testcase_05	AC	64 ms 38,212 KB
testcase_06	AC	63 ms 37,904 KB
testcase_07	AC	62 ms 38,268 KB
testcase_08	AC	62 ms 38,072 KB
testcase_09	AC	67 ms 37,920 KB
testcase_10	AC	73 ms 38,344 KB
testcase_11	AC	69 ms 38,092 KB
testcase_12	AC	67 ms 38,268 KB
testcase_13	AC	62 ms 38,048 KB
testcase_14	AC	63 ms 38,268 KB
testcase_15	AC	63 ms 38,212 KB
testcase_16	AC	63 ms 38,420 KB
testcase_17	AC	64 ms 38,232 KB
testcase_18	AC	65 ms 38,460 KB
testcase_19	AC	63 ms 37,904 KB
testcase_20	AC	66 ms 38,344 KB
testcase_21	AC	83 ms 39,624 KB
testcase_22	AC	83 ms 39,312 KB
testcase_23	AC	64 ms 37,920 KB
testcase_24	AC	64 ms 38,024 KB
testcase_25	AC	96 ms 39,444 KB
testcase_26	AC	92 ms 39,340 KB
testcase_27	AC	74 ms 38,628 KB
testcase_28	AC	87 ms 39,440 KB
testcase_29	AC	85 ms 39,344 KB
testcase_30	AC	86 ms 39,256 KB
testcase_31	AC	84 ms 39,116 KB
testcase_32	AC	93 ms 39,384 KB
testcase_33	AC	100 ms 39,420 KB
testcase_34	AC	92 ms 39,176 KB
testcase_35	AC	97 ms 39,200 KB
testcase_36	AC	87 ms 39,256 KB
testcase_37	AC	63 ms 38,420 KB
testcase_38	AC	64 ms 38,212 KB
testcase_39	AC	87 ms 39,440 KB
testcase_40	AC	89 ms 39,200 KB
testcase_41	AC	89 ms 39,600 KB
testcase_42	AC	88 ms 39,316 KB
testcase_43	AC	88 ms 39,192 KB
testcase_44	AC	85 ms 39,292 KB
testcase_45	AC	81 ms 39,012 KB
testcase_46	AC	82 ms 39,472 KB
testcase_47	AC	87 ms 39,404 KB
testcase_48	AC	96 ms 39,364 KB
testcase_49	AC	94 ms 39,168 KB
testcase_50	AC	88 ms 39,244 KB
testcase_51	AC	87 ms 39,492 KB
testcase_52	AC	90 ms 39,328 KB
testcase_53	AC	133 ms 39,576 KB
testcase_54	AC	964 ms 40,968 KB
testcase_55	AC	997 ms 40,984 KB
testcase_56	AC	968 ms 40,960 KB
testcase_57	AC	224 ms 39,712 KB
testcase_58	AC	226 ms 39,748 KB
testcase_59	AC	120 ms 39,312 KB
testcase_60	AC	308 ms 40,136 KB
testcase_61	AC	308 ms 39,832 KB
testcase_62	AC	1,270 ms 41,236 KB
testcase_63	AC	572 ms 40,260 KB
testcase_64	AC	387 ms 40,184 KB
testcase_65	AC	379 ms 40,328 KB
testcase_66	AC	64 ms 38,288 KB
testcase_67	AC	64 ms 38,212 KB
testcase_68	AC	1,117 ms 40,908 KB
testcase_69	AC	1,102 ms 40,716 KB
testcase_70	AC	989 ms 40,856 KB
testcase_71	AC	990 ms 40,728 KB
testcase_72	AC	278 ms 40,292 KB
testcase_73	AC	1,167 ms 42,032 KB
testcase_74	AC	1,142 ms 42,008 KB
testcase_75	AC	97 ms 39,728 KB
testcase_76	AC	1,059 ms 40,700 KB
testcase_77	AC	153 ms 40,004 KB
testcase_78	AC	1,496 ms 41,572 KB
testcase_79	AC	1,131 ms 40,924 KB
testcase_80	AC	1,423 ms 41,144 KB
testcase_81	AC	512 ms 41,088 KB
testcase_82	AC	79 ms 38,732 KB
testcase_83	AC	239 ms 39,688 KB
testcase_84	AC	259 ms 39,996 KB
testcase_85	AC	881 ms 40,980 KB
testcase_86	AC	1,317 ms 41,292 KB
testcase_87	AC	2,547 ms 42,040 KB
testcase_88	AC	1,916 ms 41,848 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.util.Arrays;

public class Main {
 
  private static void solve() {
    int n = ni();
    int[] primes = sieveEratosthenes(3 * n);
    boolean[] isPrime = new boolean[3 * n + 1];
    for (int p : primes) {
      isPrime[p] = true;
    }

    long[] cnt = new long[3 * n];

    long ret = 0;
    for (int i = 2; primes[i] <= n; i ++) {
      int c = primes[i];
      int b = primes[i - 1];
      for (int j = 0; primes[j] < primes[i - 1]; j ++) {
        int a = primes[j];
        cnt[b + a] ++;
      }

      for (int j = 0; j <= 2*c ; j++) {
        if (isPrime[c + j] && cnt[j] > 0) {
          ret += cnt[j];
        }
      }
    }
    System.out.println(ret);
  }
  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;
      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);
  }

  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));
  }
 }

yukicoder

結果

テストケース

ソースコード