#61892 (Java21) No.308 素数は通れません

提出ソース

結果

問題	No.308 素数は通れません
ユーザー	uwi
提出日時	2015-12-01 22:11:05
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	6,167 bytes
コンパイル時間	4,361 ms
コンパイル使用メモリ	88,960 KB
実行使用メモリ	54,200 KB
最終ジャッジ日時	2024-09-14 06:40:28
合計ジャッジ時間	14,547 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	55 ms 49,792 KB
testcase_01	AC	56 ms 50,164 KB
testcase_02	AC	56 ms 50,072 KB
testcase_03	AC	56 ms 50,452 KB
testcase_04	AC	58 ms 50,172 KB
testcase_05	AC	53 ms 36,704 KB
testcase_06	AC	53 ms 36,364 KB
testcase_07	AC	55 ms 37,116 KB
testcase_08	AC	57 ms 37,064 KB
testcase_09	AC	57 ms 36,644 KB
testcase_10	AC	54 ms 36,924 KB
testcase_11	WA	-
testcase_12	AC	58 ms 36,944 KB
testcase_13	WA	-
testcase_14	WA	-
testcase_15	AC	58 ms 37,088 KB
testcase_16	AC	59 ms 37,076 KB
testcase_17	WA	-
testcase_18	AC	59 ms 37,152 KB
testcase_19	AC	63 ms 37,360 KB
testcase_20	AC	59 ms 37,084 KB
testcase_21	AC	60 ms 37,260 KB
testcase_22	WA	-
testcase_23	WA	-
testcase_24	AC	60 ms 37,224 KB
testcase_25	AC	60 ms 37,200 KB
testcase_26	AC	60 ms 37,260 KB
testcase_27	WA	-
testcase_28	AC	63 ms 37,388 KB
testcase_29	AC	65 ms 37,316 KB
testcase_30	AC	61 ms 37,256 KB
testcase_31	AC	65 ms 36,888 KB
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	AC	61 ms 36,796 KB
testcase_40	AC	84 ms 38,176 KB
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	AC	79 ms 38,464 KB
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	WA	-
testcase_63	WA	-
testcase_64	WA	-
testcase_65	WA	-
testcase_66	WA	-
testcase_67	WA	-
testcase_68	WA	-
testcase_69	WA	-
testcase_70	WA	-
testcase_71	WA	-
testcase_72	WA	-
testcase_73	WA	-
testcase_74	WA	-
testcase_75	WA	-
testcase_76	WA	-
testcase_77	WA	-
testcase_78	WA	-
testcase_79	WA	-
testcase_80	WA	-
testcase_81	WA	-
testcase_82	WA	-
testcase_83	WA	-
testcase_84	WA	-
testcase_85	WA	-
testcase_86	WA	-
testcase_87	WA	-
testcase_88	WA	-
testcase_89	WA	-
testcase_90	WA	-
testcase_91	WA	-
testcase_92	WA	-
testcase_93	WA	-
testcase_94	WA	-
testcase_95	WA	-
testcase_96	WA	-
testcase_97	WA	-
testcase_98	WA	-
testcase_99	WA	-
testcase_100	WA	-
testcase_101	WA	-
testcase_102	WA	-
testcase_103	WA	-
testcase_104	WA	-
testcase_105	WA	-
testcase_106	WA	-

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

ソースコード

raw source code

package q8xx;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q840_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		String N = ns();
		if(N.length() <= 2){
			int n = Integer.parseInt(N);
			if(n == 4 || n == 6 || n == 12 || n == 14 || n == 20){
				out.println(n-1);
				return;
			}
		}
		
		BigInteger bn = new BigInteger(N);
		int mt = bn.mod(BigInteger.valueOf(210)).intValue();
		if(mt == 0)mt = 210;
		BigInteger base = bn.divide(BigInteger.valueOf(210)).multiply(BigInteger.valueOf(210));
		if(mt == 210)base = base.subtract(BigInteger.valueOf(210));
		
		boolean[] ok = new boolean[211];
		for(int num = 1;num <= 210;num++){
			if(num > mt){
				ok[num] = false;
			}else if(num == mt){
				ok[num] = true;
			}else if(num % 2 == 0 || num % 3 == 0 || num % 5 == 0 || num % 7 == 0){
				ok[num] = true;
			}else{
				BigInteger x = base.add(BigInteger.valueOf(num));
				if(x.isProbablePrime(30)){
					ok[num] = false;
				}else{
					ok[num] = true;
				}
			}
		}
		out.println(check(mt, 7, ok) ? 7 : 8);
	}
	
	static boolean check(int n, int w, boolean[] ok)
	{
		DJSet ds = new DJSet(n+1);
		for(int j = 1;j <= n;j++){
			if(j+1 <= n && j%w < w-1 && ok[j] && ok[j+1]){
				ds.union(j, j+1);
			}
			if(j+w <= n && ok[j] && ok[j+w]){
				ds.union(j, j+w);
			}
		}
		for(int i = 1;i <= w;i++){
			if(ok[i] && ds.equiv(i, n))return true;
		}
		return false;
	}
	
	public static long[] isp(int n)
	{
		int[] tprimes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61};
		if(n <= 64){
			long ptn = 0;
			for(int p : tprimes)if(p <= n)ptn |= 1L<<p;
			return new long[]{ptn};
		}
		
		long[] isnp = new long[(n+1)/64+1];
		int sup = (n+1)/64+1;
		
		isnp[0] |= 1<<1;
		for(int tp : tprimes){
			long[] ptn = new long[tp];
			for(int i = 0;i < tp<<6;i+=tp)ptn[i>>>6] |= 1L<<i;
			for(int j = 0;j < sup;j += tp){
				for(int i = 0;i < tp && i+j < sup;i++){
					isnp[j+i] |= ptn[i];
				}
			}
		}
		
		final int[] magic = {0, 1, 2, 53, 3, 7, 54, 27, 4, 38, 41, 8, 34, 55, 48, 28, 62, 5, 39, 46, 44, 42, 22, 9, 24, 35, 59, 56, 49, 18, 29, 11, 63, 52, 6, 26, 37, 40, 33, 47, 61, 45, 43, 21, 23, 58, 17, 10, 51, 25, 36, 32,
	              60, 20, 57, 16, 50, 31, 19, 15, 30, 14, 13, 12};
		out:
		for(int i = 0;i < sup;i++){
			for(long j = ~isnp[i];j != 0;j &= j-1){
				int p = i<<6|magic[(int)((j&-j)*0x022fdd63cc95386dL>>>58)];
				if((long)p*p > n)break out;
				for(int q = p*p;q <= n;q += p)isnp[q>>6] |= 1L<<q;
			}
		}
		
		for(int i = 0;i < isnp.length;i++)isnp[i] = ~isnp[i];
		for(int tp : tprimes)isnp[0] |= 1L<<tp;
		isnp[isnp.length-1] &= (1L<<n+1)-1;
		
		return isnp;
	}

	
	public static class DJSet {
		public int[] upper;

		public DJSet(int n) {
			upper = new int[n];
			Arrays.fill(upper, -1);
		}

		public int root(int x) {
			return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
		}

		public boolean equiv(int x, int y) {
			return root(x) == root(y);
		}

		public boolean union(int x, int y) {
			x = root(x);
			y = root(y);
			if (x != y) {
				if (upper[y] < upper[x]) {
					int d = x;
					x = y;
					y = d;
				}
				upper[x] += upper[y];
				upper[y] = x;
			}
			return x == y;
		}

		public int count() {
			int ct = 0;
			for (int u : upper)
				if (u < 0)
					ct++;
			return ct;
		}
	}
	
	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 Q840_2().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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)); }
}

yukicoder

結果

テストケース

ソースコード