結果

問題 No.199 星を描こう
ユーザー uwiuwi
提出日時 2015-04-29 00:19:13
言語 Java21
(openjdk 21)
結果
AC  
実行時間 54 ms / 2,000 ms
コード長 4,732 bytes
コンパイル時間 5,654 ms
コンパイル使用メモリ 84,900 KB
実行使用メモリ 50,432 KB
最終ジャッジ日時 2024-06-09 13:46:41
合計ジャッジ時間 6,412 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
50,128 KB
testcase_01 AC 53 ms
50,120 KB
testcase_02 AC 53 ms
50,236 KB
testcase_03 AC 54 ms
50,152 KB
testcase_04 AC 54 ms
49,656 KB
testcase_05 AC 51 ms
50,152 KB
testcase_06 AC 53 ms
50,164 KB
testcase_07 AC 52 ms
50,208 KB
testcase_08 AC 52 ms
49,908 KB
testcase_09 AC 52 ms
50,240 KB
testcase_10 AC 52 ms
50,024 KB
testcase_11 AC 53 ms
50,172 KB
testcase_12 AC 54 ms
50,220 KB
testcase_13 AC 53 ms
50,308 KB
testcase_14 AC 53 ms
49,876 KB
testcase_15 AC 52 ms
50,080 KB
testcase_16 AC 53 ms
50,036 KB
testcase_17 AC 53 ms
50,068 KB
testcase_18 AC 54 ms
50,040 KB
testcase_19 AC 53 ms
50,188 KB
testcase_20 AC 53 ms
50,020 KB
testcase_21 AC 52 ms
49,764 KB
testcase_22 AC 52 ms
49,940 KB
testcase_23 AC 53 ms
50,432 KB
testcase_24 AC 53 ms
49,620 KB
testcase_25 AC 52 ms
50,100 KB
testcase_26 AC 54 ms
50,096 KB
testcase_27 AC 52 ms
50,072 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

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 Q433 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = 5;
		long[][] co = new long[n][];
		for(int i = 0;i < n;i++){
			co[i] = new long[]{ni(), ni()};
		}
		int[] a = new int[5];
		for(int i = 0;i < 5;i++)a[i] = i;
		outer:
		do{
			for(int i = 0, j = 2;i < 5;i++,j++){
				if(j == 5) j = 0;
				if(!(ccw(co[a[i]], co[a[j]], co[a[(i+1)%5]]) > 0))continue outer;
				if(!(ccw(co[a[i]], co[a[j]], co[a[(i+3)%5]]) < 0))continue outer;
				if(!(ccw(co[a[i]], co[a[j]], co[a[(i+4)%5]]) < 0))continue outer;
				{
					long[] il = interLinesS(
							co[a[i]][0], co[a[i]][1],
							co[a[j]][0], co[a[j]][1],
							co[a[(i+1)%5]][0], co[a[(i+1)%5]][1],
							co[a[(i+3)%5]][0], co[a[(i+3)%5]][1]
							);
					if(!(il != null && 0 < il[0] && il[0] < il[2] && 0 < il[1] && il[1] < il[2]))continue outer;
				}
			}
			out.println("YES");
			return;
		}while(nextPermutation(a));
		out.println("NO");
	}
	
	public static int ccw(long[] a, long[] b, long[] t)
	{
		return Long.signum((t[0]-a[0])*(b[1]-a[1])-(b[0]-a[0])*(t[1]-a[1]));
	}

	
	public static long[] interLinesS(long ax, long ay, long bx, long by, long cx, long cy, long dx, long dy)
	{
		long aa = bx - ax;
		long cc = by - ay;
		long bb = cx - dx;
		long dd = cy - dy;
		long xx = cx - ax;
		long yy = cy - ay;
		long det = aa * dd - bb * cc;
		if(det == 0)return null;
		long tnum = dd*xx-bb*yy;
		long unum = -cc*xx+aa*yy;
		if(det < 0){
			det = -det;
			tnum = -tnum;
			unum = -unum;
		}
//		if(tnum < 0 || tnum > det || unum < 0 || unum > det)return null;
		return new long[]{
				tnum,
				unum,
				det
		};
	}

	
	static boolean nextPermutation(int[] src) {
		int i;
		for (i = src.length - 2; i >= 0 && src[i] > src[i + 1]; i--)
			;
		if (i == -1)
			return false;
		int j;
		for (j = i + 1; j < src.length && src[i] < src[j]; j++)
			;
		int d = src[i];
		src[i] = src[j - 1];
		src[j - 1] = d;
		for (int p = i + 1, q = src.length - 1; p < q; p++, q--) {
			d = src[p];
			src[p] = src[q];
			src[q] = d;
		}
		return true;
	}
	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q433().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, 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 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