結果

問題 No.732 3PrimeCounting
ユーザー uwiuwi
提出日時 2018-09-07 22:08:53
言語 Java21
(openjdk 21)
結果
AC  
実行時間 704 ms / 3,000 ms
コード長 4,828 bytes
コンパイル時間 4,305 ms
コンパイル使用メモリ 84,004 KB
実行使用メモリ 52,248 KB
最終ジャッジ日時 2024-05-07 02:21:45
合計ジャッジ時間 20,470 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
50,196 KB
testcase_01 AC 53 ms
50,124 KB
testcase_02 AC 53 ms
50,036 KB
testcase_03 AC 53 ms
50,128 KB
testcase_04 AC 52 ms
50,048 KB
testcase_05 AC 54 ms
50,012 KB
testcase_06 AC 54 ms
49,872 KB
testcase_07 AC 56 ms
50,176 KB
testcase_08 AC 54 ms
49,960 KB
testcase_09 AC 56 ms
50,220 KB
testcase_10 AC 55 ms
49,924 KB
testcase_11 AC 54 ms
50,104 KB
testcase_12 AC 54 ms
50,260 KB
testcase_13 AC 53 ms
50,124 KB
testcase_14 AC 56 ms
49,876 KB
testcase_15 AC 54 ms
50,068 KB
testcase_16 AC 53 ms
50,000 KB
testcase_17 AC 56 ms
50,240 KB
testcase_18 AC 53 ms
49,824 KB
testcase_19 AC 54 ms
50,132 KB
testcase_20 AC 55 ms
50,000 KB
testcase_21 AC 84 ms
50,824 KB
testcase_22 AC 67 ms
50,560 KB
testcase_23 AC 53 ms
50,032 KB
testcase_24 AC 54 ms
50,180 KB
testcase_25 AC 88 ms
51,380 KB
testcase_26 AC 85 ms
51,340 KB
testcase_27 AC 56 ms
50,368 KB
testcase_28 AC 57 ms
50,268 KB
testcase_29 AC 66 ms
50,000 KB
testcase_30 AC 64 ms
50,452 KB
testcase_31 AC 83 ms
50,980 KB
testcase_32 AC 81 ms
51,044 KB
testcase_33 AC 85 ms
51,588 KB
testcase_34 AC 87 ms
51,408 KB
testcase_35 AC 82 ms
50,764 KB
testcase_36 AC 82 ms
50,640 KB
testcase_37 AC 54 ms
50,064 KB
testcase_38 AC 53 ms
50,036 KB
testcase_39 AC 85 ms
51,328 KB
testcase_40 AC 71 ms
50,428 KB
testcase_41 AC 83 ms
50,952 KB
testcase_42 AC 83 ms
50,880 KB
testcase_43 AC 67 ms
50,608 KB
testcase_44 AC 67 ms
50,464 KB
testcase_45 AC 58 ms
50,052 KB
testcase_46 AC 58 ms
50,264 KB
testcase_47 AC 61 ms
50,340 KB
testcase_48 AC 80 ms
51,356 KB
testcase_49 AC 86 ms
51,268 KB
testcase_50 AC 84 ms
50,984 KB
testcase_51 AC 79 ms
50,460 KB
testcase_52 AC 56 ms
49,912 KB
testcase_53 AC 118 ms
51,724 KB
testcase_54 AC 337 ms
52,024 KB
testcase_55 AC 337 ms
51,996 KB
testcase_56 AC 338 ms
51,936 KB
testcase_57 AC 150 ms
51,744 KB
testcase_58 AC 150 ms
51,800 KB
testcase_59 AC 121 ms
51,860 KB
testcase_60 AC 174 ms
51,796 KB
testcase_61 AC 171 ms
51,900 KB
testcase_62 AC 412 ms
52,088 KB
testcase_63 AC 231 ms
51,744 KB
testcase_64 AC 193 ms
51,736 KB
testcase_65 AC 195 ms
51,832 KB
testcase_66 AC 54 ms
49,960 KB
testcase_67 AC 52 ms
50,004 KB
testcase_68 AC 367 ms
51,652 KB
testcase_69 AC 371 ms
51,844 KB
testcase_70 AC 338 ms
51,984 KB
testcase_71 AC 345 ms
52,248 KB
testcase_72 AC 220 ms
51,760 KB
testcase_73 AC 601 ms
51,748 KB
testcase_74 AC 602 ms
51,868 KB
testcase_75 AC 86 ms
50,788 KB
testcase_76 AC 362 ms
51,872 KB
testcase_77 AC 151 ms
51,964 KB
testcase_78 AC 488 ms
51,916 KB
testcase_79 AC 372 ms
51,760 KB
testcase_80 AC 443 ms
51,800 KB
testcase_81 AC 340 ms
51,932 KB
testcase_82 AC 54 ms
49,812 KB
testcase_83 AC 150 ms
51,688 KB
testcase_84 AC 154 ms
51,844 KB
testcase_85 AC 306 ms
51,760 KB
testcase_86 AC 466 ms
51,772 KB
testcase_87 AC 696 ms
52,144 KB
testcase_88 AC 704 ms
51,812 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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[2*n+1];
		for(int p : primes) {
			if(p <= n) {
				p2[2*p] -= 3;
				for(int q : primes) {
					if(q > n)break;
					p2[p+q]++;
				}
			}
		}
		
		long ans = 0;
		for(int p : primes) {
			for(int q : primes) {
				if(q > n || p-q < 1)break;
				if(p-q <= 2*n) {
					ans += p2[p-q];
				}
			}
		}
		
		out.println(ans/6);
	}
	
	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)); }
}
0