結果

問題 No.371 ぼく悪いプライムじゃないよ
ユーザー uwiuwi
提出日時 2016-05-13 22:51:43
言語 Java19
(openjdk 21)
結果
AC  
実行時間 301 ms / 1,000 ms
コード長 7,723 bytes
コンパイル時間 4,330 ms
コンパイル使用メモリ 80,556 KB
実行使用メモリ 269,076 KB
最終ジャッジ日時 2023-08-29 00:54:14
合計ジャッジ時間 19,285 ms
ジャッジサーバーID
(参考情報)
judge12 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 294 ms
267,428 KB
testcase_01 AC 292 ms
267,144 KB
testcase_02 AC 294 ms
269,040 KB
testcase_03 AC 291 ms
268,652 KB
testcase_04 AC 292 ms
268,708 KB
testcase_05 AC 289 ms
268,664 KB
testcase_06 AC 290 ms
268,728 KB
testcase_07 AC 295 ms
268,660 KB
testcase_08 AC 300 ms
268,720 KB
testcase_09 AC 298 ms
268,608 KB
testcase_10 AC 301 ms
268,688 KB
testcase_11 AC 300 ms
268,752 KB
testcase_12 AC 299 ms
268,632 KB
testcase_13 AC 301 ms
268,748 KB
testcase_14 AC 294 ms
268,584 KB
testcase_15 AC 293 ms
268,564 KB
testcase_16 AC 291 ms
268,700 KB
testcase_17 AC 291 ms
268,524 KB
testcase_18 AC 292 ms
269,076 KB
testcase_19 AC 292 ms
268,608 KB
testcase_20 AC 294 ms
268,720 KB
testcase_21 AC 291 ms
268,812 KB
testcase_22 AC 298 ms
268,692 KB
testcase_23 AC 287 ms
268,604 KB
testcase_24 AC 291 ms
268,524 KB
testcase_25 AC 286 ms
268,760 KB
testcase_26 AC 285 ms
268,884 KB
testcase_27 AC 283 ms
268,664 KB
testcase_28 AC 290 ms
269,072 KB
testcase_29 AC 288 ms
268,600 KB
testcase_30 AC 287 ms
268,708 KB
testcase_31 AC 290 ms
268,664 KB
testcase_32 AC 290 ms
268,760 KB
testcase_33 AC 290 ms
268,796 KB
testcase_34 AC 294 ms
268,556 KB
testcase_35 AC 292 ms
268,472 KB
testcase_36 AC 298 ms
268,584 KB
testcase_37 AC 293 ms
268,696 KB
testcase_38 AC 300 ms
268,808 KB
testcase_39 AC 297 ms
268,712 KB
testcase_40 AC 295 ms
268,872 KB
testcase_41 AC 293 ms
268,560 KB
testcase_42 AC 294 ms
268,768 KB
testcase_43 AC 288 ms
268,696 KB
testcase_44 AC 282 ms
268,564 KB
testcase_45 AC 284 ms
268,708 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package contest;

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 Q980_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	int Z = 10000000;
	int[] lpf = enumLowestPrimeFactors(Z);
	
	void solve()
	{
		int[] primes = sieveEratosthenes(100000);
		long L = nl(), H = nl();
		
		int[] mlpf = Arrays.copyOf(lpf, Z);
		for(int i = 0;i < mlpf.length;i++)mlpf[i] = -mlpf[i];
		SegmentTreeRMQ st = new SegmentTreeRMQ(mlpf);

		out:
		for(int i = primes.length-1;i >= 0;i--){
			int p = primes[i];
			long q = H/p*p;
			while(q >= L && q != p){
				if(q/p <= Z){
					int ind = st.lastle((int)(q/p), -p);
					if(ind == -1)break;
					if((long)ind*p < L || ind == 1)break;
					out.println((long)ind*p);
					break out;
				}
				if(ok(q, p, primes)){
					// found
					out.println(q);
					break out;
				}else{
					q -= p;
				}
			}
		}
		
	}
	
	public static class SegmentTreeRMQ {
		public int M, H, N;
		public int[] st;
		
		public SegmentTreeRMQ(int n)
		{
			N = n;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new int[M];
			Arrays.fill(st, 0, M, Integer.MAX_VALUE);
		}
		
		public SegmentTreeRMQ(int[] a)
		{
			N = a.length;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new int[M];
			for(int i = 0;i < N;i++){
				st[H+i] = a[i];
			}
			Arrays.fill(st, H+N, M, Integer.MAX_VALUE);
			for(int i = H-1;i >= 1;i--)propagate(i);
		}
		
		public void update(int pos, int x)
		{
			st[H+pos] = x;
			for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);
		}
		
		private void propagate(int i)
		{
			st[i] = Math.min(st[2*i], st[2*i+1]);
		}
		
		public int minx(int l, int r){
			if(l >= r)return 0;
			int min = Integer.MAX_VALUE;
			while(l != 0){
				int f = l&-l;
				if(l+f > r)break;
				int v = st[(H+l)/f];
				if(v < min)min = v;
				l += f;
			}
			
			while(l < r){
				int f = r&-r;
				int v = st[(H+r)/f-1];
				if(v < min)min = v;
				r -= f;
			}
			return min;
		}
		
		public int min(int l, int r){ return l >= r ? 0 : min(l, r, 0, H, 1);}
		
		private int min(int l, int r, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				return st[cur];
			}else{
				int mid = cl+cr>>>1;
				int ret = Integer.MAX_VALUE;
				if(cl < r && l < mid){
					ret = Math.min(ret, min(l, r, cl, mid, 2*cur));
				}
				if(mid < r && l < cr){
					ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1));
				}
				return ret;
			}
		}
		
		public int firstle(int l, int v) {
			int cur = H+l;
			while(true){
				if(st[cur] <= v){
					if(cur < H){
						cur = 2*cur;
					}else{
						return cur-H;
					}
				}else{
					cur++;
					if((cur&cur-1) == 0)return -1;
					if((cur&1)==0)cur>>>=1;
				}
			}
		}
		
		public int lastle(int l, int v) {
			int cur = H+l;
			while(true){
				if(st[cur] <= v){
					if(cur < H){
						cur = 2*cur+1;
					}else{
						return cur-H;
					}
				}else{
					if((cur&cur-1) == 0)return -1;
					cur--;
					if((cur&1)==1)cur>>>=1;
				}
			}
		}
	}

	
	boolean ok(long q, int p, int[] primes)
	{
		while(q % p == 0)q /= p;
		if(q == 1)return true;
		if(q < Z){
			return lpf[(int)q] >= p;
		}
		
		for(int x : primes){
			if(x == p)return true;
			if(q % x == 0)return false;
		}
		return true;
	}
	
	public static int[] enumLowestPrimeFactors(int n) {
		int tot = 0;
		int[] lpf = new int[n + 1];
		int u = n + 32;
		double lu = Math.log(u);
		int[] primes = new int[(int) (u / lu + u / lu / lu * 1.5)];
		for (int i = 2; i <= n; i++)
			lpf[i] = i;
		for (int p = 2; p <= n; p++) {
			if (lpf[p] == p)
				primes[tot++] = p;
			int tmp;
			for (int i = 0; i < tot && primes[i] <= lpf[p] && (tmp = primes[i] * p) <= n; i++) {
				lpf[tmp] = primes[i];
			}
		}
		return lpf;
	}

	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q980_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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, 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 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