結果
| 問題 |
No.62 リベリオン(Extra)
|
| コンテスト | |
| ユーザー |
 Grenache
|
| 提出日時 | 2016-11-02 00:19:52 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,578 bytes |
| コンパイル時間 | 3,679 ms |
| コンパイル使用メモリ | 79,404 KB |
| 実行使用メモリ | 90,392 KB |
| 最終ジャッジ日時 | 2024-11-25 01:22:20 |
| 合計ジャッジ時間 | 6,859 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 2 WA * 1 |
ソースコード
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++) {
int w = sc.nextInt();
int h = sc.nextInt();
int d = sc.nextInt();
int mx = sc.nextInt();
int my = sc.nextInt();
int hx = sc.nextInt();
int hy = sc.nextInt();
int vx = sc.nextInt();
int 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(int vx, int vy, int hx, int hy, int mx, int my, int w, int h, int d) {
long x = (long)2 * w * vy;
long y = (long)2 * h * vx;
long z = (long)vx *(my - hy) - (long)vy * (mx - hx);
// BigInteger x = BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(BigInteger.valueOf(vy));
// BigInteger y = BigInteger.valueOf(2).multiply(BigInteger.valueOf(h)).multiply(BigInteger.valueOf(vx));
long[] ab = new long[2];
long gcd = extgcd(x, y, ab);
if (z % gcd != 0) {
return false;
}
long mul = z / gcd;
// ab[0] *= mul;
// ab[1] *= mul;
// x /= gcd;
// y /= gcd;
BigInteger ab0 = BigInteger.valueOf(ab[0]).multiply(BigInteger.valueOf(mul));
BigInteger ab1 = BigInteger.valueOf(ab[1]).multiply(BigInteger.valueOf(mul));
BigInteger bx = BigInteger.valueOf(x).divide(BigInteger.valueOf(gcd));
BigInteger by = BigInteger.valueOf(y).divide(BigInteger.valueOf(gcd));
long l = -1_000_000_000_000_000_000L;
long r = 1_000_000_000_000_000_000L;
while (r - l > 1) {
long mid = l + (r - l) / 2;
// long mdx = mx + 2 * w * (ab[0] + y * mid) - hx;
// long mdy = my + 2 * w * -(ab[1] - x * mid) - hy;
BigInteger mdx = BigInteger.valueOf(mx).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(ab0.add(by.multiply(BigInteger.valueOf(mid))))).subtract(BigInteger.valueOf(hx));
BigInteger mdy = BigInteger.valueOf(my).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(ab1.negate().add(bx.multiply(BigInteger.valueOf(mid))))).subtract(BigInteger.valueOf(hy));
// if (ab[0] + y * mid >= 0 && ab[1] - x * mid >= 0) {
// if (mdx >= 0 && mdy >= 0) {
if (mdx.compareTo(BigInteger.ZERO) >= 0 && mdy.compareTo(BigInteger.ZERO) >= 0) {
r = mid;
} else {
l = mid;
}
}
// return r;
// ab[0] = r * y + ab[0];
// ab[1] = r * (-x) + ab[1];
// long mdx = mx + 2 * w * ab[0] - hx;
// long mdy = my + 2 * w * -ab[1] - hy;
BigInteger mdx = BigInteger.valueOf(mx).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(ab0.add(by.multiply(BigInteger.valueOf(r))))).subtract(BigInteger.valueOf(hx));
BigInteger mdy = BigInteger.valueOf(my).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(ab1.negate().add(bx.multiply(BigInteger.valueOf(r))))).subtract(BigInteger.valueOf(hy));
// if (mdx < 0 || mdx > (long)d * vx) {
if (mdx.compareTo(BigInteger.ZERO) < 0 || mdx.compareTo(BigInteger.valueOf(d).multiply(BigInteger.valueOf(vx))) > 0) {
return false;
}
// if (mdy < 0 || mdy > (long)d * vy) {
if (mdy.compareTo(BigInteger.ZERO) < 0 || mdy.compareTo(BigInteger.valueOf(d).multiply(BigInteger.valueOf(vy))) > 0) {
return false;
}
return true;
}
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);
}
}
}