#283786 (Java21) No.732 3PrimeCounting

提出ソース

結果

問題	No.732 3PrimeCounting
ユーザー	hiromi_ayase
提出日時	2018-09-08 15:22:52
言語	Java21 (openjdk 21)
結果	TLE (最新) AC (最初)
実行時間	-
コード長	4,388 bytes
コンパイル時間	4,156 ms
コンパイル使用メモリ	80,136 KB
実行使用メモリ	55,540 KB
最終ジャッジ日時	2023-08-22 10:36:32
合計ジャッジ時間	44,721 ms
ジャッジサーバーID （参考情報）	judge11 / judge14

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	69 ms 51,112 KB
testcase_01	AC	70 ms 50,940 KB
testcase_02	AC	70 ms 51,008 KB
testcase_03	AC	69 ms 50,828 KB
testcase_04	AC	68 ms 51,100 KB
testcase_05	AC	70 ms 50,752 KB
testcase_06	AC	70 ms 50,860 KB
testcase_07	AC	70 ms 51,032 KB
testcase_08	AC	70 ms 50,980 KB
testcase_09	AC	70 ms 51,064 KB
testcase_10	AC	70 ms 50,948 KB
testcase_11	AC	69 ms 50,848 KB
testcase_12	AC	69 ms 51,036 KB
testcase_13	AC	69 ms 50,804 KB
testcase_14	AC	70 ms 50,784 KB
testcase_15	AC	69 ms 50,740 KB
testcase_16	AC	71 ms 50,992 KB
testcase_17	AC	69 ms 51,080 KB
testcase_18	AC	69 ms 50,748 KB
testcase_19	AC	69 ms 50,728 KB
testcase_20	AC	72 ms 51,312 KB
testcase_21	AC	96 ms 53,428 KB
testcase_22	AC	98 ms 53,696 KB
testcase_23	AC	71 ms 50,812 KB
testcase_24	AC	70 ms 50,800 KB
testcase_25	AC	102 ms 52,652 KB
testcase_26	AC	93 ms 52,860 KB
testcase_27	AC	87 ms 52,968 KB
testcase_28	AC	87 ms 52,968 KB
testcase_29	AC	91 ms 52,900 KB
testcase_30	AC	89 ms 52,900 KB
testcase_31	AC	91 ms 52,652 KB
testcase_32	AC	94 ms 52,856 KB
testcase_33	AC	95 ms 52,660 KB
testcase_34	AC	95 ms 52,840 KB
testcase_35	AC	92 ms 52,860 KB
testcase_36	AC	91 ms 52,868 KB
testcase_37	AC	71 ms 51,020 KB
testcase_38	AC	70 ms 50,808 KB
testcase_39	AC	93 ms 51,764 KB
testcase_40	AC	91 ms 50,844 KB
testcase_41	AC	90 ms 52,912 KB
testcase_42	AC	90 ms 52,984 KB
testcase_43	AC	91 ms 52,720 KB
testcase_44	AC	91 ms 52,968 KB
testcase_45	AC	88 ms 52,864 KB
testcase_46	AC	88 ms 52,824 KB
testcase_47	AC	89 ms 53,312 KB
testcase_48	AC	103 ms 52,852 KB
testcase_49	AC	100 ms 52,848 KB
testcase_50	AC	97 ms 53,284 KB
testcase_51	AC	98 ms 53,272 KB
testcase_52	AC	88 ms 52,876 KB
testcase_53	AC	131 ms 53,104 KB
testcase_54	AC	1,090 ms 54,748 KB
testcase_55	AC	1,090 ms 53,272 KB
testcase_56	AC	1,087 ms 54,904 KB
testcase_57	AC	257 ms 53,128 KB
testcase_58	AC	247 ms 52,832 KB
testcase_59	AC	136 ms 52,684 KB
testcase_60	AC	343 ms 52,748 KB
testcase_61	AC	347 ms 52,876 KB
testcase_62	AC	1,435 ms 55,044 KB
testcase_63	AC	616 ms 53,092 KB
testcase_64	AC	443 ms 53,248 KB
testcase_65	AC	430 ms 52,884 KB
testcase_66	AC	69 ms 50,816 KB
testcase_67	AC	69 ms 50,808 KB
testcase_68	AC	1,246 ms 54,704 KB
testcase_69	AC	1,242 ms 54,876 KB
testcase_70	AC	1,108 ms 55,012 KB
testcase_71	AC	1,110 ms 55,200 KB
testcase_72	AC	372 ms 53,344 KB
testcase_73	AC	1,544 ms 54,952 KB
testcase_74	AC	2,355 ms 55,412 KB
testcase_75	AC	111 ms 53,712 KB
testcase_76	AC	1,211 ms 54,772 KB
testcase_77	AC	183 ms 53,380 KB
testcase_78	AC	1,825 ms 55,108 KB
testcase_79	AC	1,265 ms 54,900 KB
testcase_80	AC	1,609 ms 54,872 KB
testcase_81	AC	691 ms 55,540 KB
testcase_82	AC	78 ms 52,428 KB
testcase_83	AC	258 ms 53,220 KB
testcase_84	AC	282 ms 52,856 KB
testcase_85	AC	941 ms 55,328 KB
testcase_86	AC	1,664 ms 53,384 KB
testcase_87	TLE	-
testcase_88	TLE	-

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

ソースコード

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

結果

テストケース

ソースコード