#541749 (Java21) No.1200 お菓子配り-3

提出ソース

結果

問題	No.1200 お菓子配り-3
ユーザー	uwi
提出日時	2020-08-28 21:33:50
言語	Java21 (openjdk 21)
結果	AC
実行時間	355 ms / 4,000 ms
コード長	5,879 bytes
コンパイル時間	4,534 ms
コンパイル使用メモリ	86,776 KB
実行使用メモリ	59,372 KB
最終ジャッジ日時	2023-08-13 05:39:55
合計ジャッジ時間	9,394 ms
ジャッジサーバーID （参考情報）	judge15 / judge13

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	44 ms 49,184 KB
testcase_01	AC	44 ms 49,284 KB
testcase_02	AC	44 ms 49,320 KB
testcase_03	AC	44 ms 49,240 KB
testcase_04	AC	43 ms 49,240 KB
testcase_05	AC	44 ms 49,164 KB
testcase_06	AC	44 ms 49,360 KB
testcase_07	AC	47 ms 49,472 KB
testcase_08	AC	47 ms 49,180 KB
testcase_09	AC	47 ms 49,240 KB
testcase_10	AC	48 ms 49,272 KB
testcase_11	AC	48 ms 49,228 KB
testcase_12	AC	93 ms 52,324 KB
testcase_13	AC	93 ms 52,100 KB
testcase_14	AC	78 ms 52,256 KB
testcase_15	AC	90 ms 52,136 KB
testcase_16	AC	92 ms 52,452 KB
testcase_17	AC	121 ms 54,412 KB
testcase_18	AC	144 ms 56,564 KB
testcase_19	AC	97 ms 52,172 KB
testcase_20	AC	171 ms 57,748 KB
testcase_21	AC	181 ms 57,392 KB
testcase_22	AC	185 ms 57,836 KB
testcase_23	AC	175 ms 59,196 KB
testcase_24	AC	171 ms 57,640 KB
testcase_25	AC	181 ms 57,080 KB
testcase_26	AC	177 ms 57,664 KB
testcase_27	AC	44 ms 49,260 KB
testcase_28	AC	355 ms 59,372 KB
testcase_29	AC	179 ms 57,504 KB
testcase_30	AC	189 ms 57,672 KB
testcase_31	AC	44 ms 49,464 KB
testcase_32	AC	43 ms 49,364 KB

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

ソースコード

raw source code

package contest200828;
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 C2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		// AB+C=X
		// AC+B=Y
		for(int T = ni();T > 0;T--)go();
	}
	
	int[] primes = sieveEratosthenes(100000);

	void go()
	{
		long X = nl(), Y = nl();
		// A(B-C)+(C-B) = X-Y
		// A(B+C)+(C+B) = X+Y
		int ans = 0;
		for(long d : enumDivisors(factor((int)(X+Y), primes))){
			ans += test(d, X, Y);
		}
		out.println(ans);
	}
	
	public static int[][] factor(int n, int[] primes)
	{
		int[][] ret = new int[9][2];
		int rp = 0;
		for(int p : primes){
			if(p * p > n)break;
			int i;
			for(i = 0;n % p == 0;n /= p, i++);
			if(i > 0){
				ret[rp][0] = p;
				ret[rp][1] = i;
				rp++;
			}
		}
		if(n != 1){
			ret[rp][0] = n;
			ret[rp][1] = 1;
			rp++;
		}
		return Arrays.copyOf(ret, rp);
	}

	
	// (A+1)(B+C)=X+Y
	// (A-1)(B-C) = X-Y
	long test(long d, long X, long Y)
	{
		long A = d - 1;
		long BC = (X+Y)/d;
		if(A <= 0)return 0L;
		if(A == 1){
			return X == Y ? X-1 : 0;
		}
		long BmC = (X-Y)/(A-1);
		long B = (BC + BmC) / 2;
		long C = (BC - BmC) / 2;
		if(B <= 0 || C <= 0)return 0;
		if(A*B+C == X && A*C+B == Y)return 1;
		return 0;
	}
	
	public static long[] enumDivisors(int[][] f)
	{
		int n = 1;
		for(int j = 0;j < f.length;j++){
			n *= f[j][1]+1;
		}
		long[] divs = new long[n];
		int p = 1;
		divs[0] = 1;
		for(int j = 0;j < f.length;j++){
			for(int q = p-1;q >= 0;q--){
				long b = divs[q];
				for(int k = 0;k < f[j][1];k++){
					b *= f[j][0];
//					if((long)b*b <= n)divs[p++] = b;
					divs[p++] = b;
				}
			}
		}
		return divs;
	}

	
	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");
//		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 C2().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

結果

テストケース

ソースコード