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

提出ソース

結果

問題	No.308 素数は通れません
ユーザー	threepipes_s
提出日時	2015-12-01 18:27:31
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	4,012 bytes
コンパイル時間	2,592 ms
コンパイル使用メモリ	88,552 KB
実行使用メモリ	52,232 KB
最終ジャッジ日時	2024-09-14 05:38:37
合計ジャッジ時間	11,813 ms
ジャッジサーバーID （参考情報）	judge3 / judge6

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	AC	56 ms 50,040 KB
testcase_27	AC	54 ms 50,152 KB
testcase_28	AC	56 ms 49,952 KB
testcase_29	AC	55 ms 50,068 KB
testcase_30	AC	54 ms 50,056 KB
testcase_31	AC	56 ms 50,320 KB
testcase_32	WA	-
testcase_33	AC	54 ms 50,052 KB
testcase_34	AC	56 ms 50,412 KB
testcase_35	AC	55 ms 50,080 KB
testcase_36	AC	55 ms 50,328 KB
testcase_37	AC	55 ms 50,356 KB
testcase_38	AC	56 ms 50,184 KB
testcase_39	AC	55 ms 50,284 KB
testcase_40	AC	54 ms 50,516 KB
testcase_41	AC	55 ms 50,260 KB
testcase_42	AC	56 ms 50,196 KB
testcase_43	AC	57 ms 50,264 KB
testcase_44	AC	54 ms 50,112 KB
testcase_45	AC	55 ms 49,928 KB
testcase_46	AC	55 ms 50,148 KB
testcase_47	AC	53 ms 49,900 KB
testcase_48	AC	54 ms 50,368 KB
testcase_49	AC	55 ms 50,052 KB
testcase_50	AC	55 ms 50,316 KB
testcase_51	AC	54 ms 50,216 KB
testcase_52	AC	55 ms 50,300 KB
testcase_53	AC	55 ms 50,308 KB
testcase_54	AC	54 ms 50,268 KB
testcase_55	AC	55 ms 50,180 KB
testcase_56	AC	54 ms 50,180 KB
testcase_57	AC	54 ms 50,196 KB
testcase_58	AC	55 ms 50,148 KB
testcase_59	AC	55 ms 50,112 KB
testcase_60	AC	55 ms 50,336 KB
testcase_61	AC	53 ms 50,148 KB
testcase_62	AC	54 ms 50,080 KB
testcase_63	AC	55 ms 50,064 KB
testcase_64	AC	54 ms 50,100 KB
testcase_65	AC	55 ms 50,036 KB
testcase_66	AC	55 ms 50,108 KB
testcase_67	AC	54 ms 50,624 KB
testcase_68	AC	55 ms 50,200 KB
testcase_69	AC	55 ms 50,256 KB
testcase_70	AC	55 ms 50,484 KB
testcase_71	AC	55 ms 50,576 KB
testcase_72	AC	55 ms 50,220 KB
testcase_73	AC	55 ms 50,068 KB
testcase_74	AC	54 ms 50,268 KB
testcase_75	AC	55 ms 50,396 KB
testcase_76	WA	-
testcase_77	AC	54 ms 50,024 KB
testcase_78	AC	54 ms 50,300 KB
testcase_79	AC	54 ms 49,908 KB
testcase_80	WA	-
testcase_81	WA	-
testcase_82	AC	54 ms 50,356 KB
testcase_83	AC	54 ms 50,156 KB
testcase_84	WA	-
testcase_85	AC	55 ms 50,468 KB
testcase_86	WA	-
testcase_87	WA	-
testcase_88	AC	55 ms 50,188 KB
testcase_89	AC	54 ms 50,272 KB
testcase_90	WA	-
testcase_91	AC	55 ms 50,332 KB
testcase_92	AC	55 ms 50,344 KB
testcase_93	AC	55 ms 50,088 KB
testcase_94	AC	55 ms 50,448 KB
testcase_95	AC	55 ms 50,468 KB
testcase_96	AC	53 ms 50,188 KB
testcase_97	AC	55 ms 50,464 KB
testcase_98	AC	54 ms 50,440 KB
testcase_99	AC	55 ms 49,952 KB
testcase_100	AC	55 ms 50,132 KB
testcase_101	WA	-
testcase_102	AC	56 ms 50,304 KB
testcase_103	AC	55 ms 50,000 KB
testcase_104	AC	56 ms 50,376 KB
testcase_105	AC	56 ms 50,312 KB
testcase_106	AC	54 ms 50,056 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){
			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 = 70;
		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

結果

テストケース

ソースコード