結果

問題 No.62 リベリオン(Extra)
ユーザー GrenacheGrenache
提出日時 2016-11-03 11:05:12
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,057 ms / 5,000 ms
コード長 7,046 bytes
コンパイル時間 3,773 ms
コンパイル使用メモリ 75,992 KB
実行使用メモリ 64,800 KB
最終ジャッジ日時 2023-08-16 13:19:14
合計ジャッジ時間 6,248 ms
ジャッジサーバーID
(参考情報)
judge15 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
49,696 KB
testcase_01 AC 46 ms
49,596 KB
testcase_02 AC 292 ms
56,360 KB
testcase_03 AC 289 ms
56,000 KB
testcase_04 AC 1,057 ms
64,800 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.*;
import java.math.*;
import java.util.*;


public class Main_yukicoder62 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int q = sc.nextInt();

		for (int tcase = 0; tcase < q; tcase++) {
			long w = sc.nextInt();
			long h = sc.nextInt();
			long d = sc.nextInt();
			long mx = sc.nextInt();
			long my = sc.nextInt();
			long hx = sc.nextInt();
			long hy = sc.nextInt();
			long vx = sc.nextInt();
			long vy = sc.nextInt();

			if (vx < 0) {
				vx = -vx;
				mx = w - mx;
				hx = w - hx;
			}
			if (vy < 0) {
				vy = -vy;
				my = h - my;
				hy = h - hy;
			}

			if (isHit(vx, vy, hx, hy, mx, my, w, h, d)
					|| isHit(vx, vy, hx, hy, w + w - mx, my, w, h, d)
					|| isHit(vx, vy, hx, hy, mx, h + h - my, w, h, d)
					|| isHit(vx, vy, hx, hy, w + w - mx, h + h - my, w, h, d)) {
				pr.println("Hit");
			} else {
				pr.println("Miss");
			}
		}
	}

	private static boolean isHit(long vx, long vy, long hx, long hy, long mx, long my, long w, long h, long d) {
//		long x = (long)2 * w * vy;
//		long y = (long)2 * h * vx;
//		long z = (long)vx * (my - hy) - (long)vy * (mx - hx);
		BigInteger bx = bi(2).multiply(bi(w)).multiply(bi(vy));
		BigInteger by = bi(2).multiply(bi(h)).multiply(bi(vx));
		BigInteger bz = bi(vx).multiply(bi(my).subtract(bi(hy))).subtract(bi(vy).multiply(bi(mx).subtract(bi(hx))));

//		long[] ab = new long[2];
//		long gcd = extgcd(x, y, ab);
//		if (z % gcd != 0) {
//			return false;
//		}
		BigInteger[] bab = new BigInteger[2];
		BigInteger bgcd = bextgcd(bx, by, bab);
		if (bz.mod(bgcd).compareTo(BigInteger.ZERO) != 0) {
			return false;
		}


//		long mul = z / gcd;
		BigInteger bmul = bz.divide(bgcd);
//		ab[0] *= mul;
//		ab[1] *= mul;
//		x /= gcd;
//		y /= gcd;
		bab[0] = bab[0].multiply(bmul);
		bab[1] = bab[1].multiply(bmul);
		bx = bx.divide(bgcd);
		by = by.divide(bgcd);

		if (vx != 0) {
			BigInteger btmp = bi(2).multiply(bi(w)).multiply(by);
			BigInteger mdx = bi(mx).subtract(bi(hx)).add(bi(2).multiply(bi(w)).multiply(bab[0])).mod(btmp);
			if (mdx.compareTo(BigInteger.ZERO) < 0) {
				mdx = mdx.add(btmp);
			}

			if (mdx.compareTo(bi(d).multiply(bi(vx))) > 0) {
				return false;
			} else {
				return true;
			}
		}
		if (vy != 0) {
			BigInteger btmp = bi(2).multiply(bi(h)).multiply(bx);
			BigInteger mdy = bi(my).subtract(bi(hy)).subtract(bi(2).multiply(bi(h)).multiply(bab[1])).mod(btmp);
			if (mdy.compareTo(BigInteger.ZERO) < 0) {
				mdy = mdy.add(btmp);
			}

			if (mdy.compareTo(bi(d).multiply(bi(vy))) > 0) {
				return false;
			} else {
				return true;
			}
		}

		return true;
	}

	private static BigInteger bi(long x) {
		return BigInteger.valueOf(x);
	}

	private static BigInteger bextgcd(BigInteger n, BigInteger m, BigInteger[] xy) {
		if (m.compareTo(BigInteger.ZERO) == 0) {
			xy[0] = BigInteger.ONE;
			xy[1] = BigInteger.ZERO;

			return n;
		} else {
			BigInteger ret = bextgcd(m, n.mod(m), xy);

			BigInteger tmp = xy[1];
			xy[1] = xy[0].subtract(n.divide(m).multiply(tmp));
			xy[0] = tmp;

			return ret;
		}
	}

	/*
	private static long extgcd(long n, long m, long[] xy) {
		if (m == 0) {
			xy[0] = 1;
			xy[1] = 0;

			return n;
		} else {
			long ret = extgcd(m, n % m, xy);

			long tmp = xy[1];
			xy[1] = xy[0] - n / m * tmp;
			xy[0] = tmp;

			return ret;
		}
	}
	*/

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0