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

提出ソース

結果

問題	No.308 素数は通れません
ユーザー	threepipes_s
提出日時	2015-12-05 10:10:33
言語	Java21 (openjdk 21)
結果	AC
実行時間	93 ms / 1,000 ms
コード長	4,183 bytes
コンパイル時間	2,879 ms
コンパイル使用メモリ	81,324 KB
実行使用メモリ	39,660 KB
最終ジャッジ日時	2024-11-27 18:40:30
合計ジャッジ時間	9,760 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	48 ms 37,080 KB
testcase_01	AC	48 ms 36,788 KB
testcase_02	AC	48 ms 37,296 KB
testcase_03	AC	48 ms 36,988 KB
testcase_04	AC	48 ms 37,328 KB
testcase_05	AC	47 ms 37,188 KB
testcase_06	AC	46 ms 37,192 KB
testcase_07	AC	46 ms 36,704 KB
testcase_08	AC	46 ms 37,296 KB
testcase_09	AC	45 ms 37,172 KB
testcase_10	AC	46 ms 37,336 KB
testcase_11	AC	46 ms 37,220 KB
testcase_12	AC	46 ms 36,632 KB
testcase_13	AC	46 ms 37,308 KB
testcase_14	AC	47 ms 37,332 KB
testcase_15	AC	48 ms 37,216 KB
testcase_16	AC	47 ms 36,908 KB
testcase_17	AC	49 ms 37,300 KB
testcase_18	AC	48 ms 36,784 KB
testcase_19	AC	48 ms 37,172 KB
testcase_20	AC	48 ms 37,344 KB
testcase_21	AC	48 ms 36,864 KB
testcase_22	AC	47 ms 36,984 KB
testcase_23	AC	47 ms 37,188 KB
testcase_24	AC	48 ms 37,320 KB
testcase_25	AC	48 ms 37,328 KB
testcase_26	AC	44 ms 36,904 KB
testcase_27	AC	45 ms 37,036 KB
testcase_28	AC	47 ms 37,428 KB
testcase_29	AC	46 ms 36,752 KB
testcase_30	AC	46 ms 36,784 KB
testcase_31	AC	46 ms 37,156 KB
testcase_32	AC	49 ms 37,200 KB
testcase_33	AC	45 ms 37,060 KB
testcase_34	AC	45 ms 37,464 KB
testcase_35	AC	44 ms 37,288 KB
testcase_36	AC	46 ms 37,368 KB
testcase_37	AC	45 ms 37,456 KB
testcase_38	AC	46 ms 37,428 KB
testcase_39	AC	47 ms 36,784 KB
testcase_40	AC	45 ms 37,356 KB
testcase_41	AC	45 ms 37,372 KB
testcase_42	AC	44 ms 37,084 KB
testcase_43	AC	46 ms 37,320 KB
testcase_44	AC	45 ms 37,044 KB
testcase_45	AC	46 ms 36,788 KB
testcase_46	AC	46 ms 37,316 KB
testcase_47	AC	47 ms 37,208 KB
testcase_48	AC	46 ms 36,984 KB
testcase_49	AC	50 ms 37,484 KB
testcase_50	AC	45 ms 37,300 KB
testcase_51	AC	44 ms 37,352 KB
testcase_52	AC	45 ms 37,348 KB
testcase_53	AC	44 ms 37,324 KB
testcase_54	AC	44 ms 37,100 KB
testcase_55	AC	45 ms 37,116 KB
testcase_56	AC	49 ms 37,416 KB
testcase_57	AC	46 ms 37,108 KB
testcase_58	AC	45 ms 37,304 KB
testcase_59	AC	45 ms 36,892 KB
testcase_60	AC	45 ms 37,352 KB
testcase_61	AC	44 ms 37,012 KB
testcase_62	AC	46 ms 37,072 KB
testcase_63	AC	45 ms 37,344 KB
testcase_64	AC	44 ms 37,080 KB
testcase_65	AC	45 ms 37,296 KB
testcase_66	AC	46 ms 37,300 KB
testcase_67	AC	47 ms 36,916 KB
testcase_68	AC	45 ms 37,112 KB
testcase_69	AC	46 ms 37,328 KB
testcase_70	AC	46 ms 37,356 KB
testcase_71	AC	46 ms 37,304 KB
testcase_72	AC	47 ms 37,080 KB
testcase_73	AC	45 ms 37,212 KB
testcase_74	AC	46 ms 37,168 KB
testcase_75	AC	45 ms 37,232 KB
testcase_76	AC	53 ms 37,248 KB
testcase_77	AC	49 ms 37,232 KB
testcase_78	AC	48 ms 36,748 KB
testcase_79	AC	46 ms 36,840 KB
testcase_80	AC	56 ms 37,556 KB
testcase_81	AC	58 ms 36,880 KB
testcase_82	AC	47 ms 37,036 KB
testcase_83	AC	47 ms 37,064 KB
testcase_84	AC	66 ms 38,628 KB
testcase_85	AC	47 ms 37,036 KB
testcase_86	AC	63 ms 38,304 KB
testcase_87	AC	84 ms 38,588 KB
testcase_88	AC	50 ms 36,916 KB
testcase_89	AC	46 ms 37,288 KB
testcase_90	AC	74 ms 38,108 KB
testcase_91	AC	46 ms 37,304 KB
testcase_92	AC	46 ms 36,892 KB
testcase_93	AC	45 ms 37,288 KB
testcase_94	AC	46 ms 37,244 KB
testcase_95	AC	46 ms 37,336 KB
testcase_96	AC	48 ms 37,344 KB
testcase_97	AC	45 ms 36,776 KB
testcase_98	AC	45 ms 37,264 KB
testcase_99	AC	48 ms 36,912 KB
testcase_100	AC	47 ms 37,388 KB
testcase_101	AC	93 ms 39,660 KB
testcase_102	AC	45 ms 37,296 KB
testcase_103	AC	45 ms 36,704 KB
testcase_104	AC	46 ms 37,404 KB
testcase_105	AC	48 ms 37,288 KB
testcase_106	AC	47 ms 37,196 KB

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

ソースコード

raw source code

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.BitSet;
import java.util.HashMap;
import java.util.Queue;
 
public class Main {
	public static void main(String[] args) throws NumberFormatException,
	IOException {Solve solve = new Solve();solve.solve();}
}
class Solve{
	void solve() throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		Writer out = new Writer();
//		if(exp()) return;
		BigInteger bi = new BigInteger(in.readLine());
		if(bi.compareTo(BigInteger.valueOf(40L))>=0){
			if(bi.mod(BigInteger.valueOf(8)).equals(BigInteger.valueOf(1))
					&& bi.add(BigInteger.valueOf(-8)).isProbablePrime(100)) System.out.println(14);
			else System.out.println(8);
			return;
		}
		BitSet p = prime(50);
		int n = bi.intValue();
		for(int w=3; w<n; w++){
			final int h = (n+w-1)/w;
			boolean[][] map = new boolean[h][w];
			for(int i=0; i<n; i++){
				final int y = i/w;
				final int x = i%w;
				map[y][x] = p.get(i+1);
			}
			if(n%w!=0) for(int i=n%w; i<w; i++){
				map[h-1][i] = true;
			}
//			for(int i=0; i<h; i++){
//				for(int j=0; j<w; j++){
//					System.out.print(map[i][j]?'X':'.');
//				}
//				System.out.println();
//			}
//			System.out.println();
			if(check(map, n-1)){
				System.out.println(w);
				return;
			}
		}
		System.out.println(n-1);
	}
	
	boolean exp(){
		int n = 100;
		BitSet p = prime(n);
		for(int i=1; i<=n; i++){
			if(p.get(i)) System.out.print('X');
			else System.out.print('.');
			if(i%8==0) System.out.println();
		}
		return true;
	}
	
	final int[] dx = {0, 1, 0, -1};
	final int[] dy = {1, 0, -1, 0};
	boolean check(boolean[][] map, int goal){
		final int h = map.length;
		final int w = map[0].length;
		Queue<Integer> qu = new ArrayDeque<>();
		qu.add(0);
		BitSet used = new BitSet(h*w);
		while(!qu.isEmpty()){
			int p = qu.poll();
			if(used.get(p)) continue;
			used.set(p);
			if(goal==p) return true;
			final int y = p/w;
			final int x = p%w;
			for(int i=0; i<4; i++){
				final int ny = dy[i]+y;
				final int nx = dx[i]+x;
				if(ny<0||ny>=h||nx<0||nx>=w||map[ny][nx])
					continue;
				qu.add(ny*w+nx);
			}
		}
		return false;
	}
	
	public static BitSet prime(int max){
		// こちらを使うように
		BitSet prime = new BitSet(max+1);
		prime.set(2, max+1);
		for(int i=2; i!=-1 && i*i<=max; i=prime.nextSetBit(i+1))
			for(int j=i*2; j<=max; j+=i) prime.clear(j);
		return prime;
	}
}
 
class MultiSet<T> extends HashMap<T, Integer>{
	@Override
	public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
}
class Timer{
	long time;
	public void set(){time = System.currentTimeMillis();}
	public long stop(){return System.currentTimeMillis()-time;}
}
class Writer extends PrintWriter{
	public Writer(String filename) throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer() throws IOException{super(System.out);}
}
class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException 
	{reader = new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename) throws FileNotFoundException
	{reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	public String readLine() throws IOException{return reader.readLine();}
	public long nextLong() throws IOException, NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt() throws NumberFormatException, IOException
	{return (int) nextLong();}
	public double nextDouble() throws NumberFormatException, IOException 
	{return Double.parseDouble(nextToken());}
}

yukicoder

結果

テストケース

ソースコード