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

提出ソース

結果

問題	No.854 公平なりんご分配
ユーザー	uwi
提出日時	2019-07-26 21:58:06
言語	Java21 (openjdk 21)
結果	RE
実行時間	-
コード長	6,075 bytes
コンパイル時間	5,510 ms
コンパイル使用メモリ	85,372 KB
実行使用メモリ	46,656 KB
最終ジャッジ日時	2024-07-02 07:12:11
合計ジャッジ時間	13,748 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	54 ms 36,916 KB
testcase_01	AC	55 ms 36,664 KB
testcase_02	AC	55 ms 36,920 KB
testcase_03	AC	55 ms 36,564 KB
testcase_04	AC	55 ms 36,664 KB
testcase_05	AC	54 ms 36,560 KB
testcase_06	AC	55 ms 36,932 KB
testcase_07	AC	55 ms 36,616 KB
testcase_08	AC	53 ms 36,800 KB
testcase_09	AC	53 ms 36,612 KB
testcase_10	AC	53 ms 36,536 KB
testcase_11	AC	54 ms 36,916 KB
testcase_12	AC	54 ms 36,664 KB
testcase_13	AC	54 ms 36,932 KB
testcase_14	AC	54 ms 36,804 KB
testcase_15	AC	54 ms 36,456 KB
testcase_16	AC	54 ms 36,316 KB
testcase_17	AC	54 ms 36,316 KB
testcase_18	AC	55 ms 36,576 KB
testcase_19	AC	55 ms 36,800 KB
testcase_20	AC	54 ms 36,668 KB
testcase_21	AC	57 ms 36,744 KB
testcase_22	RE	-
testcase_23	RE	-
testcase_24	RE	-
testcase_25	RE	-
testcase_26	RE	-
testcase_27	RE	-
testcase_28	RE	-
testcase_29	RE	-
testcase_30	RE	-
testcase_31	RE	-
testcase_32	RE	-
testcase_33	RE	-
testcase_34	RE	-
testcase_35	RE	-
testcase_36	RE	-
testcase_37	RE	-
testcase_38	RE	-
testcase_39	RE	-
testcase_40	RE	-
testcase_41	RE	-
testcase_42	RE	-
testcase_43	RE	-
testcase_44	RE	-
testcase_45	RE	-
testcase_46	RE	-
testcase_47	RE	-
testcase_48	RE	-
testcase_49	RE	-
testcase_50	RE	-
testcase_51	RE	-
testcase_52	RE	-
testcase_53	RE	-
testcase_54	RE	-
testcase_55	RE	-
testcase_56	RE	-
testcase_57	RE	-
testcase_58	RE	-
testcase_59	RE	-
testcase_60	RE	-
testcase_61	RE	-
testcase_62	RE	-
testcase_63	RE	-
testcase_64	RE	-
testcase_65	RE	-
testcase_66	RE	-
testcase_67	RE	-
testcase_68	RE	-
testcase_69	RE	-
testcase_70	RE	-
testcase_71	RE	-
testcase_72	RE	-
testcase_73	RE	-
testcase_74	RE	-
testcase_75	RE	-
testcase_76	RE	-
testcase_77	RE	-
testcase_78	RE	-
testcase_79	RE	-
testcase_80	RE	-
testcase_81	RE	-
testcase_82	RE	-
testcase_83	RE	-
testcase_84	RE	-
testcase_85	RE	-
testcase_86	AC	231 ms 46,656 KB
testcase_87	RE	-
testcase_88	RE	-
testcase_89	RE	-
testcase_90	RE	-
testcase_91	RE	-
testcase_92	RE	-
testcase_93	RE	-

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

ソースコード

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 o = 0;
		for(int i = 0;i < Q;i++) {
			int val = ni();
			int l = ni()-1;
			int r = ni()-1;
			int[][] ff = factorFast(val, lpf);
			for(int[] f : ff) {
				qs[o++] = new int[] {f[0], f[1], l, r, i};
			}
		}
		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];
			}
		});
		
		boolean[] anss = new boolean[Q];
		Arrays.fill(anss, true);
		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[][] 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

結果

テストケース

ソースコード