#19305 (Java21) No.61 リベリオン

提出ソース

結果

問題	No.61 リベリオン
ユーザー	ぴろず
提出日時	2015-04-08 20:35:54
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	5,856 bytes
コンパイル時間	3,369 ms
コンパイル使用メモリ	78,660 KB
実行使用メモリ	55,132 KB
最終ジャッジ日時	2024-07-04 13:19:17
合計ジャッジ時間	4,219 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	53 ms 50,324 KB
testcase_01	AC	52 ms 50,040 KB
testcase_02	AC	53 ms 50,312 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	AC	55 ms 49,900 KB

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

ソースコード

raw source code

package no061;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	static IO io = new IO();
	public static void main(String[] args) {
		int q = io.nextInt();
		for(int qq=0;qq<q;qq++) {
			long w = io.nextInt();
			long h = io.nextInt();
			long d = io.nextInt();
			long mx = io.nextInt();
			long my = io.nextInt();
			long hx = io.nextInt();
			long hy = io.nextInt();
			long vx = io.nextInt();
			long vy = io.nextInt();

			long gcd = MOD.gcd(Math.abs(vx), Math.abs(vy));
			d *= gcd;
			vx /= gcd;
			vy /= gcd;

//			System.out.println("----");
			long min = Long.MAX_VALUE;
			min = Math.min(min, lc(vx,MOD.i(mx-hx,w*2), w*2, vy, MOD.i(my-hy, h*2), h*2));
			min = Math.min(min, lc(vx,MOD.i(-mx-hx,w*2), w*2, vy, MOD.i(my-hy, h*2), h*2));
			min = Math.min(min, lc(vx,MOD.i(mx-hx,w*2), w*2, vy, MOD.i(-my-hy, h*2), h*2));
			min = Math.min(min, lc(vx,MOD.i(-mx-hx,w*2), w*2, vy, MOD.i(-my-hy, h*2), h*2));
//			System.out.println(min + "," + d);
			io.println(min <= d ? "Hit" : "Miss");
		}
		io.flush();
	}
	public static long lc(long a1,long b1,long m1,long a2,long b2,long m2) {
		long[] A = {a1,a2};
		long[] B = {b1,b2};
		long[] M = {m1,m2};
		long[] x = MOD.linearCongruence(A, B, M);
//		System.out.println(Arrays.toString(x));
		if (x == null) {
			return Long.MAX_VALUE;
		}
		x[1] = Math.abs(x[1]);
		return MOD.i(x[0],x[1]);
	}
}
class MOD {
	public static long i(long x,long mod) {
		x %= mod;
		if (x < 0) {
			x += mod;
		}
		return x;
	}
	public static long inverse(long a,long mod) {
		long b = mod, u = 1, v = 0;
		while(b > 0) {
			long temp;
			long t = a / b;
			a -= t * b;
			temp = a; a = b; b = temp;
			u -= t * v;
			temp = u; u = v; v = temp;
		}
		return (u % mod + mod) % mod;
	}
	// x mod m
	public static long[] linearCongruence(long[] A,long[] B,long[] M) {
		long x = 0;
		long m = 1;
		for(int i=0;i<A.length;i++) {
			long a = A[i] * m;
			long b = B[i] - A[i] * x;
			long d = gcd(M[i],a);
			if (b % d != 0) {
				return null;
			}
			long t = b / d * inverse(a / d, M[i] / d) % (M[i] / d);
			x = x + m * t;
			m *= M[i] / d;
		}
		long[] ret = {x%m, m};
		return ret;
	}
	public static long gcd(long a,long b) {
		while(b!=0) {
			long r = a%b;
			a = b;
			b = r;
		}
		return a;
	}
}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}

yukicoder

結果

テストケース

ソースコード