結果

問題 No.635 自然門松列
ユーザー uwiuwi
提出日時 2018-01-19 21:50:23
言語 Java21
(openjdk 21)
結果
AC  
実行時間 70 ms / 650 ms
コード長 5,843 bytes
コンパイル時間 4,435 ms
コンパイル使用メモリ 86,352 KB
実行使用メモリ 37,672 KB
最終ジャッジ日時 2024-06-23 08:47:24
合計ジャッジ時間 6,107 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
37,448 KB
testcase_01 AC 55 ms
37,392 KB
testcase_02 AC 54 ms
37,604 KB
testcase_03 AC 56 ms
37,356 KB
testcase_04 AC 57 ms
37,628 KB
testcase_05 AC 60 ms
37,280 KB
testcase_06 AC 57 ms
37,260 KB
testcase_07 AC 64 ms
37,216 KB
testcase_08 AC 57 ms
37,188 KB
testcase_09 AC 58 ms
37,212 KB
testcase_10 AC 60 ms
37,628 KB
testcase_11 AC 57 ms
37,388 KB
testcase_12 AC 59 ms
37,336 KB
testcase_13 AC 61 ms
37,128 KB
testcase_14 AC 59 ms
37,228 KB
testcase_15 AC 55 ms
37,604 KB
testcase_16 AC 56 ms
36,952 KB
testcase_17 AC 57 ms
37,548 KB
testcase_18 AC 70 ms
37,612 KB
testcase_19 AC 57 ms
37,428 KB
testcase_20 AC 60 ms
37,140 KB
testcase_21 AC 63 ms
37,472 KB
testcase_22 AC 67 ms
37,356 KB
testcase_23 AC 66 ms
37,672 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180119;
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 = "";
	
	long[] low, high;
	
	void solve()
	{
		outer:
		for(int T = ni();T > 0;T--){
			int x1 = ni(), x2 = ni(), x3 = ni();
			int y1 = ni(), y2 = ni(), y3 = ni();
			
			if(x1 == x2 && y1 == y2){
				out.println("NO");
				continue;
			}
			if(x1 == x3 && y1 == y3){
				out.println("NO");
				continue;
			}
			if(x2 == x3 && y2 == y3){
				out.println("NO");
				continue;
			}
			
			{
				low = new long[]{0L, 1L};
				high = new long[]{1L, 0L};
				
				comp(x1, x2, y1, y2);
				comp(x3, x2, y3, y2);
				if(!(low[0] == 1 && low[1] == 0)){
					if(compare(low, high) < 0){
						if(y1 != y3 || x1 != x3){
							out.println("YES");
							continue outer;
						}
					}
				}
			}
			{
				low = new long[]{0L, 1L};
				high = new long[]{1L, 0L};
				
				comp(x2, x1, y2, y1);
				comp(x2, x3, y2, y3);
				if(!(low[0] == 1 && low[1] == 0)){
					if(compare(low, high) < 0){
						if(y1 != y3 || x1 != x3){
							out.println("YES");
							continue outer;
						}
					}
				}
			}
			out.println("NO");
		}
	}
	
	// x1+y1*t <= x2+y2*t
	// t*(y1-y2) <= x2-x1
	void comp(int x1, int x2, int y1, int y2)
	{
		if(y1-y2 == 0){
			if(x2-x1 >= 0){
			}else{
				low = new long[]{1L, 0L};
			}
		}else if(y1-y2 > 0){
			long[] up = {x2-x1, y1-y2};
			up = reduce(up);
			if(compare(up, high) < 0){
				high = up;
			}
		}else{
			long[] up = {x2-x1, y1-y2};
			up = reduce(up);
			if(compare(low, up) < 0){
				low = up;
			}
		}
	}
	
	public static long[] reduce(long[] f)
	{
		if(f[1] == 0) { // n/0
			f[0] = 1;
		}else if(f[0] == 0) { // 0/n
			f[1] = 1;
		}else {
			if(f[1] < 0) { // -a/-b ->a/b
				f[0] = -f[0];
				f[1] = -f[1];
			}
			long a = Math.abs(f[0]), b = f[1];
			while (b > 0) {
				long c = a;
				a = b;
				b = c % b;
			}
			f[0] /= a;
			f[1] /= a;
		}
		return f;
	}
	
	public static long[] add(long[] a, long[] b){ return reduce(new long[]{a[0]*b[1]+a[1]*b[0], a[1]*b[1]}); }
	public static long[] sub(long[] a, long[] b){ return reduce(new long[]{a[0]*b[1]-a[1]*b[0], a[1]*b[1]}); }
	public static long[] mul(long[] a, long[] b){ return reduce(new long[]{a[0]*b[0], a[1]*b[1]}); }
	public static long[] div(long[] a, long[] b){ return reduce(new long[]{a[0]*b[1], a[1]*b[0]}); }
		
	public static int compare(long[] a, long[] b){return Long.signum(a[0] * b[1] - a[1] * b[0]);}
	
	public static long[] min(long[] a, long[] b){ return compare(a, b) <= 0 ? a : b; }
	public static long[] max(long[] a, long[] b){ return compare(a, b) >= 0 ? a : b; }
	
	public static int lowerBound(long[][] es, int p, long[] r)
	{
		int low = -1, high = p;
		while(high-low > 1){
			int h = high+low>>>1;
			if(Long.compare(r[0]*es[h][1], r[1]*es[h][0]) <= 0){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}
	
	public static Comparator<long[]> comp = (a, b) -> Long.signum(a[0]*b[1]-a[1]*b[0]);

	
	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)); }
}
0