#362563 (Java21) No.854 公平なりんご分配

提出ソース

結果

問題	No.854 公平なりんご分配
ユーザー	uwi
提出日時	2019-07-26 22:03:50
言語	Java21 (openjdk 21)
結果	RE
実行時間	-
コード長	7,776 bytes
コンパイル時間	4,961 ms
コンパイル使用メモリ	83,640 KB
実行使用メモリ	79,868 KB
最終ジャッジ日時	2024-07-02 07:20:49
合計ジャッジ時間	39,556 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	55 ms 36,716 KB
testcase_01	AC	55 ms 36,836 KB
testcase_02	AC	56 ms 36,824 KB
testcase_03	AC	56 ms 36,952 KB
testcase_04	AC	55 ms 36,880 KB
testcase_05	AC	55 ms 36,708 KB
testcase_06	AC	55 ms 36,696 KB
testcase_07	AC	55 ms 36,924 KB
testcase_08	AC	54 ms 36,652 KB
testcase_09	AC	55 ms 36,368 KB
testcase_10	AC	56 ms 36,836 KB
testcase_11	AC	55 ms 36,612 KB
testcase_12	AC	55 ms 36,452 KB
testcase_13	AC	55 ms 36,692 KB
testcase_14	AC	55 ms 36,748 KB
testcase_15	AC	54 ms 36,956 KB
testcase_16	AC	57 ms 36,744 KB
testcase_17	AC	56 ms 37,104 KB
testcase_18	AC	55 ms 36,960 KB
testcase_19	AC	55 ms 36,844 KB
testcase_20	AC	55 ms 36,636 KB
testcase_21	AC	55 ms 36,704 KB
testcase_22	AC	81 ms 38,372 KB
testcase_23	AC	67 ms 37,076 KB
testcase_24	AC	100 ms 39,020 KB
testcase_25	AC	63 ms 37,268 KB
testcase_26	AC	105 ms 38,932 KB
testcase_27	AC	81 ms 38,640 KB
testcase_28	AC	91 ms 38,240 KB
testcase_29	AC	61 ms 36,844 KB
testcase_30	AC	65 ms 37,120 KB
testcase_31	AC	99 ms 39,144 KB
testcase_32	AC	245 ms 47,560 KB
testcase_33	AC	255 ms 47,816 KB
testcase_34	AC	344 ms 50,136 KB
testcase_35	AC	277 ms 47,792 KB
testcase_36	AC	235 ms 43,924 KB
testcase_37	AC	234 ms 47,440 KB
testcase_38	AC	184 ms 46,848 KB
testcase_39	AC	474 ms 53,820 KB
testcase_40	AC	267 ms 48,100 KB
testcase_41	AC	280 ms 47,540 KB
testcase_42	AC	314 ms 50,056 KB
testcase_43	AC	387 ms 49,992 KB
testcase_44	AC	357 ms 50,432 KB
testcase_45	AC	403 ms 49,508 KB
testcase_46	AC	446 ms 53,164 KB
testcase_47	AC	282 ms 47,612 KB
testcase_48	AC	351 ms 50,048 KB
testcase_49	AC	355 ms 49,632 KB
testcase_50	AC	191 ms 47,212 KB
testcase_51	AC	488 ms 52,288 KB
testcase_52	AC	398 ms 51,768 KB
testcase_53	AC	291 ms 47,724 KB
testcase_54	AC	424 ms 51,604 KB
testcase_55	AC	233 ms 47,640 KB
testcase_56	AC	209 ms 47,072 KB
testcase_57	AC	259 ms 47,360 KB
testcase_58	AC	406 ms 49,576 KB
testcase_59	AC	198 ms 44,448 KB
testcase_60	AC	310 ms 48,156 KB
testcase_61	AC	224 ms 43,496 KB
testcase_62	AC	365 ms 47,844 KB
testcase_63	AC	340 ms 48,844 KB
testcase_64	AC	189 ms 43,068 KB
testcase_65	AC	299 ms 49,824 KB
testcase_66	AC	256 ms 48,484 KB
testcase_67	AC	378 ms 50,216 KB
testcase_68	AC	378 ms 49,920 KB
testcase_69	AC	221 ms 49,904 KB
testcase_70	AC	217 ms 44,916 KB
testcase_71	AC	255 ms 46,856 KB
testcase_72	AC	317 ms 45,236 KB
testcase_73	AC	298 ms 47,888 KB
testcase_74	AC	433 ms 50,088 KB
testcase_75	AC	267 ms 48,028 KB
testcase_76	AC	400 ms 50,464 KB
testcase_77	AC	382 ms 50,772 KB
testcase_78	AC	413 ms 49,492 KB
testcase_79	AC	411 ms 51,584 KB
testcase_80	AC	404 ms 50,216 KB
testcase_81	AC	341 ms 49,128 KB
testcase_82	AC	786 ms 58,140 KB
testcase_83	RE	-
testcase_84	AC	1,177 ms 79,868 KB
testcase_85	AC	589 ms 59,568 KB
testcase_86	AC	369 ms 49,192 KB
testcase_87	AC	1,321 ms 75,160 KB
testcase_88	AC	1,249 ms 75,500 KB
testcase_89	AC	1,378 ms 75,484 KB
testcase_90	AC	1,137 ms 75,464 KB
testcase_91	AC	1,247 ms 75,656 KB
testcase_92	AC	1,303 ms 75,680 KB
testcase_93	AC	1,319 ms 75,064 KB

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

ソースコード

raw source code

package contest190726;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;

public class D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int Q = ni();
		int[][] qs = new int[Q*7][];
		int[] lpf = enumLowestPrimeFactors(2001);
		
		int[] zero = new int[n+5];
		for(int i = 0;i < n;i++) {
			if(a[i] == 0) {
				addFenwick(zero, i, 1);
			}
		}
		
		boolean[] anss = new boolean[Q];
		Arrays.fill(anss, true);
		int[] primes = sieveEratosthenes(2001);
		int o = 0;
		for(int i = 0;i < Q;i++) {
			int val = ni();
			int l = ni()-1;
			int r = ni()-1;
			for(int p : primes) {
				int e = 0;
				while(val % p == 0) {
					val /= p;
					e++;
				}
				if(e > 0) {
					qs[o++] = new int[] {p, e, l, r, i};
				}
			}
			if(val != 1 && sumFenwick(zero, r) - sumFenwick(zero, l-1) == 0)anss[i] = false;
		}
		qs = Arrays.copyOf(qs, o);
			
		Arrays.sort(qs, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				return a[0] - b[0];
			}
		});
		
		int[][] ss = new int[n*7][];
		int p = 0;

		for(int i = 0;i  <n;i++) {
			if(a[i] == 0)continue;
			int[][] ff = factorFast(a[i], lpf);
			for(int[] f : ff) {
				ss[p++] = new int[] {f[0], f[1], i};
			}
		}
		ss = Arrays.copyOf(ss, p);
		Arrays.sort(ss, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				return a[0] - b[0];
			}
		});
		
		int sp = 0, qp = 0;
		int[] ft = new int[n+5];
		for(int i = 0;i < n;i++) {
			if(a[i] == 0) {
				addFenwick(ft, i, 99);
			}
		}
		
		for(int i = 1;i <= 2000;i++) {
			while(sp < p && ss[sp][0] < i)sp++;
			int nsp = sp;
			while(nsp < p && ss[nsp][0] == i) {
				addFenwick(ft, ss[nsp][2], ss[nsp][1]);
				nsp++;
			}
			
			while(qp < qs.length && qs[qp][0] == i) {
				int s = sumFenwick(ft, qs[qp][3]) - sumFenwick(ft, qs[qp][2]-1);
				if(s < qs[qp][1]) {
					anss[qs[qp][4]] = false;
				}
				qp++;
			}
			
			while(sp < nsp) {
				addFenwick(ft, ss[sp][2], -ss[sp][1]);
				sp++;
			}
		}
		for(boolean b : anss) {
			out.println(b ? "Yes" : "NO");
		}
	}
	
	
	
	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);
	}

	
	public static int[][] factorFast(int n, int[] lpf)
	{
		int[][] f = new int[9][];
		int q = 0;
		while(lpf[n] > 0){
			int p = lpf[n];
			if(q == 0 || p != f[q-1][0]){
				f[q++] = new int[]{p, 1};
			}else{
				f[q-1][1]++;
			}
			n /= p;
		}
		if(n > 1){
			// big prime
			return new int[][]{{n, 1}};
		}
		return Arrays.copyOf(f, q);
	}

	
	public static int sumFenwick(int[] ft, int i)
	{
		int sum = 0;
		for(i++;i > 0;i -= i&-i)sum += ft[i];
		return sum;
	}
	
	public static void addFenwick(int[] ft, int i, int v)
	{
		if(v == 0 || i < 0)return;
		int n = ft.length;
		for(i++;i < n;i += i&-i)ft[i] += v;
	}

	
	public static int[] enumDivisorsFast(int n, int[] lpf)
	{
		int[] divs = {1};
		while(lpf[n] > 0){
			int p = lpf[n];
			int e = 0;
			for(;p == lpf[n];e++, n /= p);
			int olen = divs.length;
			divs = Arrays.copyOf(divs, olen*(e+1));
			for(int i = olen;i < divs.length;i++)divs[i] = divs[i-olen] * p;
		}
		return divs;
	}

	
	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;
	}

	
	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 D().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)); }
}

yukicoder

結果

テストケース

ソースコード