#653840 (Java21) No.1497 Triangle

提出ソース
結果

問題	No.1497 Triangle
ユーザー	uwi
提出日時	2021-05-03 22:23:40
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	18,101 bytes
コンパイル時間	4,878 ms
コンパイル使用メモリ	88,796 KB
実行使用メモリ	57,496 KB
最終ジャッジ日時	2023-09-29 18:40:08
合計ジャッジ時間	16,291 ms
ジャッジサーバーID （参考情報）	judge13 / judge11
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	65 ms 50,540 KB
testcase_01	AC	74 ms 50,532 KB
testcase_02	AC	59 ms 50,284 KB
testcase_03	AC	1,725 ms 57,496 KB
testcase_04	WA	-
testcase_05	WA	-
testcase_06	AC	60 ms 50,280 KB
testcase_07	AC	62 ms 50,448 KB
testcase_08	WA	-
testcase_09	WA	-
testcase_10	AC	56 ms 50,304 KB
testcase_11	AC	57 ms 50,524 KB
testcase_12	AC	57 ms 50,656 KB
testcase_13	AC	57 ms 50,504 KB
testcase_14	AC	60 ms 50,464 KB
testcase_15	AC	66 ms 50,320 KB
testcase_16	AC	75 ms 50,352 KB
testcase_17	AC	74 ms 50,552 KB
testcase_18	AC	87 ms 51,772 KB
testcase_19	AC	119 ms 54,488 KB
testcase_20	AC	131 ms 54,628 KB
testcase_21	AC	126 ms 55,132 KB
testcase_22	TLE	-
testcase_23	--	-
testcase_24	--	-
testcase_25	--	-
testcase_26	--	-
testcase_27	--	-
testcase_28	--	-
testcase_29	--	-
testcase_30	--	-
testcase_31	--	-
testcase_32	--	-
testcase_33	--	-
testcase_34	--	-
testcase_35	--	-
testcase_36	--	-
testcase_37	--	-
testcase_38	--	-
testcase_39	--	-
testcase_40	--	-
testcase_41	--	-
testcase_42	--	-
testcase_43	--	-
testcase_44	--	-
testcase_45	--	-
testcase_46	--	-
testcase_47	--	-
testcase_48	--	-
testcase_49	--	-
testcase_50	--	-
権限があれば一括ダウンロードができます
ソースコード

raw source code
package extra;

import java.io.*;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

// つらい
public class P6408_5 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		int n = ni();
		int[][] co = new int[n][];
		for(int i = 0;i < n;i++){
			co[i] = na(2);
			co[i][0] *= 5; co[i][1] *= 5;
		}

		boolean[] ret = new boolean[1<<n];
		// 0点の場合
		ret[0] = true;

		// 1点の場合
		for(int i = 0;i < n;i++){
			ret[1<<i] = true;
		}

		// 2点の場合
		for(int i = 0;i < n;i++){
			for(int j = i+1;j < n;j++){
				int ptn = 0;
				for(int k = 0;k < n;k++){
					if(isACB(co[i], co[j], co[k])){
						ptn |= 1<<k;
					}
				}
				ret[ptn] = true;
			}
		}

		List<Line> lines = new ArrayList<>();
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				if (i == j) continue;
				lines.add(new Line(i, co[i], new int[]{co[j][0] - co[i][0], co[j][1] - co[i][1]}));
				int x = (co[j][0] - co[i][0]) * 10000;
				int y = (co[j][1] - co[i][1]) * 10000;
				for(int k = 1;k <= 1;k++) {
					if ((y >= x) == (y >= -x)) {
						lines.add(new Line(i, co[i], new int[]{x - k, y}));
						lines.add(new Line(i, co[i], new int[]{x + k, y}));
						//						lines.add(new Line(i, new int[]{co[i][0] - x + 1, co[i][1] - y}, new int[]{2*x, 2*y}));
						//						lines.add(new Line(i, new int[]{co[i][0] - x - 1, co[i][1] - y}, new int[]{2*x, 2*y}));
						lines.add(new Line(i, new int[]{co[i][0] - x - 2, co[i][1] - y}, new int[]{2 * x + 3, 2 * y}));
						//						lines.add(new Line(i, new int[]{co[i][0] - x - 1, co[i][1] - y}, new int[]{2*x + 3, 2*y}));
						lines.add(new Line(i, new int[]{co[i][0] - x + 2, co[i][1] - y}, new int[]{2 * x - 3, 2 * y}));
					} else {
						lines.add(new Line(i, co[i], new int[]{x, y + k}));
						lines.add(new Line(i, co[i], new int[]{x, y - k}));
						lines.add(new Line(i, new int[]{co[i][0] - x, co[i][1] - y - 2}, new int[]{2*x, 2*y + 3}));
//						lines.add(new Line(i, new int[]{co[i][0] - x, co[i][1] - y - 1}, new int[]{2*x, 2*y + 3}));
						lines.add(new Line(i, new int[]{co[i][0] - x, co[i][1] - y + 2}, new int[]{2*x, 2*y - 3}));
//						lines.add(new Line(i, new int[]{co[i][0] - x, co[i][1] - y + 1}, new int[]{2*x, 2*y - 3}));
					}
				}

//				lines.add(new Line(i, new int[]{co[i][0] - x, co[i][1] - y + 1}, new int[]{2*x, 2*y}));
//				lines.add(new Line(i, new int[]{co[i][0] - x, co[i][1] - y - 1}, new int[]{2*x, 2*y}));
//				lines.add(new Line(i, new int[]{co[i][0] - x + 1, co[i][1] - y}, new int[]{2*x, 2*y}));
//				lines.add(new Line(i, new int[]{co[i][0] - x - 1, co[i][1] - y}, new int[]{2*x, 2*y}));
//				lines.add(new Line(i, new int[]{co[i][0] - x - 1, co[i][1] - y - 1}, new int[]{2*x, 2*y}));
//				lines.add(new Line(i, new int[]{co[i][0] - x + 1, co[i][1] - y + 1}, new int[]{2*x, 2*y}));
//				lines.add(new Line(i, new int[]{co[i][0] - x - 1, co[i][1] - y + 1}, new int[]{2*x, 2*y}));
//				lines.add(new Line(i, new int[]{co[i][0] - x + 1, co[i][1] - y - 1}, new int[]{2*x, 2*y}));
			}
		}

		for(Line l : lines){
			int ptn = 0;
			for(int j = 0;j < n;j++){
				if(ccw(l.cent[0], l.cent[1], l.cent[0] + l.d[0], l.cent[1] + l.d[1], co[j][0], co[j][1]) >= 0){
					ptn |= 1<<j;
				}
			}
			l.ptn = ptn;
		}

		// 開いた台形みたいなやつを除きたい

//		tr(lines.size());
		for(int i = 0;i < lines.size();i++) {
			for (int j = i + 1; j < lines.size(); j++) {
				inner:
				for (int k = j + 1; k < lines.size(); k++) {
					Line A = lines.get(i);
					Line B = lines.get(j);
					Line C = lines.get(k);
					int inter = A.ptn & B.ptn & C.ptn;
					if (ret[inter]) continue;

					for (Line[] ll : new Line[][]{
							{A, B, C},
							{B, C, A},
							{C, A, B},
					}) {
						Line X = ll[0], Y = ll[1], Z = ll[2];
						long[] ine = interLinesS(
								X.cent[0], X.cent[1],
								X.cent[0] + X.d[0], X.cent[1] + X.d[1],
								Y.cent[0], Y.cent[1],
								Y.cent[0] + Y.d[0], Y.cent[1] + Y.d[1]
						);
//						if (ine == null) continue inner;

						if(ine != null) {
							if (ccw(Z.cent[0] * ine[2], Z.cent[1] * ine[2],
									(Z.cent[0] + Z.d[0]) * ine[2], (Z.cent[1] + Z.d[1]) * ine[2],
									X.cent[0] * ine[2] + X.d[0] * ine[0],
									X.cent[1] * ine[2] + X.d[1] * ine[0]
							) <= 0) {
//															tr(Z.cent[0] * ine[2], Z.cent[1] * ine[2],
//																	(Z.cent[0] + Z.d[0]) * ine[2], (Z.cent[1] + Z.d[1]) * ine[2]);
								continue inner;
							}
//							if (ccw(Z.cent[0] * ine[2], Z.cent[1] * ine[2],
//									(Z.cent[0] + Z.d[0]) * ine[2], (Z.cent[1] + Z.d[1]) * ine[2],
//									X.cent[0] * ine[2] + X.d[0] * ine[0],
//									X.cent[1] * ine[2] + X.d[1] * ine[0]
//							) <= 0) {
//								tr(X.cent, X.d, Y.cent, Y.d, Z.cent, Z.d);
//							}
						}
					}

					ret[inter] = true;
				}
			}
		}

		int ans = 0;
		for(boolean v : ret){
			if(v)ans++;
		}
		out.println(ans);
	}

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

	public static boolean isACB(long ax, long ay, long bx, long by, long cx, long cy)
	{
		return (cx-ax)*(by-ay)-(cy-ay)*(bx-ax)==0 && (cx-ax)*(cx-bx)+(cy-ay)*(cy-by) <= 0;
	}

	public static boolean isACB(long[] a, long[] b, long[] c) { return isACB(a[0], a[1], b[0], b[1], c[0], c[1]); }
	public static boolean isACB(int[] a, int[] b, int[] c) { return isACB(a[0], a[1], b[0], b[1], c[0], c[1]); }

//	public static int ccw(long ax, long ay, long bx, long by, long tx, long ty){ return Long.signum((tx-ax)*(by-ay)-(bx-ax)*(ty-ay)); }
	public static int ccw(long ax, long ay, long bx, long by, long tx, long ty) {
		long v = (tx - ax) * (by - ay) - (bx - ax) * (ty - ay);
		double vd = (double) (tx - ax) * (by - ay) - (double) (bx - ax) * (ty - ay);
		return Math.abs(vd) < 1e18 ? Long.signum(v) : (int)Math.signum(vd);
	}

	public static int ccw(int[] a, int[] b, int[] t){ return Long.signum((long)(t[0]-a[0])*(b[1]-a[1])-(long)(b[0]-a[0])*(t[1]-a[1])); }


	static class Line
	{
		int[] cent;
		int[] d;
		int id;
		int ptn;

		public Line(int id, int[] cent, int[] d) {
			this.id = id;
			this.cent = cent;
			this.d = d;
		}
	}

	public static Comparator<int[]> compArgi = new Comparator<int[]>(){
		public int compare(int[] a, int[] b)
		{
			long ax = a[0], ay = a[1];
			long bx = b[0], by = b[1];
			int za = ay > 0 || ay == 0 && ax > 0 ? 0 : 1;
			int zb = by > 0 || by == 0 && bx > 0 ? 0 : 1;
			if(za != zb)return za - zb;
			if(ay*bx-ax*by != 0)return Long.signum(ay*bx-ax*by);
			return Long.signum((ax*ax+ay*ay)-(bx*bx+by*by));
		}
	};


	public static void main(String[] args) {
		new P6408_5().run();
	}

	public void run()
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new FastWriter(System.out);

		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-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();
	}

	private boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;

		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}

	private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
			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 long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		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();
		}
	}

	public static class FastWriter
	{
		private static final int BUF_SIZE = 1<<13;
		private final byte[] buf = new byte[BUF_SIZE];
		private final OutputStream out;
		private int ptr = 0;

		private FastWriter(){out = null;}

		public FastWriter(OutputStream os)
		{
			this.out = os;
		}

		public FastWriter(String path)
		{
			try {
				this.out = new FileOutputStream(path);
			} catch (FileNotFoundException e) {
				throw new RuntimeException("FastWriter");
			}
		}

		public FastWriter write(byte b)
		{
			buf[ptr++] = b;
			if(ptr == BUF_SIZE)innerflush();
			return this;
		}

		public FastWriter write(char c)
		{
			return write((byte)c);
		}

		public FastWriter write(char[] s)
		{
			for(char c : s){
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			}
			return this;
		}

		public FastWriter write(String s)
		{
			s.chars().forEach(c -> {
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			});
			return this;
		}

		private static int countDigits(int l) {
			if (l >= 1000000000) return 10;
			if (l >= 100000000) return 9;
			if (l >= 10000000) return 8;
			if (l >= 1000000) return 7;
			if (l >= 100000) return 6;
			if (l >= 10000) return 5;
			if (l >= 1000) return 4;
			if (l >= 100) return 3;
			if (l >= 10) return 2;
			return 1;
		}

		public FastWriter write(int x)
		{
			if(x == Integer.MIN_VALUE){
				return write((long)x);
			}
			if(ptr + 12 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		private static int countDigits(long l) {
			if (l >= 1000000000000000000L) return 19;
			if (l >= 100000000000000000L) return 18;
			if (l >= 10000000000000000L) return 17;
			if (l >= 1000000000000000L) return 16;
			if (l >= 100000000000000L) return 15;
			if (l >= 10000000000000L) return 14;
			if (l >= 1000000000000L) return 13;
			if (l >= 100000000000L) return 12;
			if (l >= 10000000000L) return 11;
			if (l >= 1000000000L) return 10;
			if (l >= 100000000L) return 9;
			if (l >= 10000000L) return 8;
			if (l >= 1000000L) return 7;
			if (l >= 100000L) return 6;
			if (l >= 10000L) return 5;
			if (l >= 1000L) return 4;
			if (l >= 100L) return 3;
			if (l >= 10L) return 2;
			return 1;
		}

		public FastWriter write(long x)
		{
			if(x == Long.MIN_VALUE){
				return write("" + x);
			}
			if(ptr + 21 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		public FastWriter write(double x, int precision)
		{
			if(x < 0){
				write('-');
				x = -x;
			}
			x += Math.pow(10, -precision)/2;
			//		if(x < 0){ x = 0; }
			write((long)x).write(".");
			x -= (long)x;
			for(int i = 0;i < precision;i++){
				x *= 10;
				write((char)('0'+(int)x));
				x -= (int)x;
			}
			return this;
		}

		public FastWriter writeln(char c){ return write(c).writeln(); }
		public FastWriter writeln(int x){ return write(x).writeln(); }
		public FastWriter writeln(long x){ return write(x).writeln(); }
		public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); }

		public FastWriter write(int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(IntUnaryOperator f, int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsInt(x));
			}
			return this;
		}

		public FastWriter write(LongUnaryOperator f, long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsLong(x));
			}
			return this;
		}

		public FastWriter writeln()
		{
			return write((byte)'\n');
		}

		public FastWriter writeln(int... xs) { return write(xs).writeln(); }
		public FastWriter writeln(long... xs) { return write(xs).writeln(); }
		public FastWriter writeln(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(char[] line) { return write(line).writeln(); }
		public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln();return this; }
		public FastWriter writeln(String s) { return write(s).writeln(); }

		private void innerflush()
		{
			try {
				out.write(buf, 0, ptr);
				ptr = 0;
			} catch (IOException e) {
				throw new RuntimeException("innerflush");
			}
		}

		public void flush()
		{
			innerflush();
			try {
				out.flush();
			} catch (IOException e) {
				throw new RuntimeException("flush");
			}
		}

		public FastWriter print(byte b) { return write(b); }
		public FastWriter print(char c) { return write(c); }
		public FastWriter print(char[] s) { return write(s); }
		public FastWriter print(String s) { return write(s); }
		public FastWriter print(int x) { return write(x); }
		public FastWriter print(long x) { return write(x); }
		public FastWriter print(double x, int precision) { return write(x, precision); }
		public FastWriter println(char c){ return writeln(c); }
		public FastWriter println(int x){ return writeln(x); }
		public FastWriter println(long x){ return writeln(x); }
		public FastWriter println(double x, int precision){ return writeln(x, precision); }
		public FastWriter print(int... xs) { return write(xs); }
		public FastWriter print(long... xs) { return write(xs); }
		public FastWriter print(IntUnaryOperator f, int... xs) { return write(f, xs); }
		public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }
		public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, xs); }
		public FastWriter println(char[] line) { return writeln(line); }
		public FastWriter println(char[]... map) { return writeln(map); }
		public FastWriter println(String s) { return writeln(s); }
		public FastWriter println() { return writeln(); }
	}

	public static void trnz(int... o)
	{
		for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
		System.out.println();
	}

	// print ids which are 1
	public static void trt(long... o)
	{
		Queue<Integer> stands = new ArrayDeque<>();
		for(int i = 0;i < o.length;i++){
			for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
		}
		System.out.println(stands);
	}

	public static void tf(boolean... r)
	{
		for(boolean x : r)System.out.print(x?'#':'.');
		System.out.println();
	}

	public static void tf(boolean[]... b)
	{
		for(boolean[] r : b) {
			for(boolean x : r)System.out.print(x?'#':'.');
			System.out.println();
		}
		System.out.println();
	}

	public void tf(long[]... b)
	{
		if(INPUT.length() != 0) {
			for (long[] r : b) {
				for (long x : r) {
					for (int i = 0; i < 64; i++) {
						System.out.print(x << ~i < 0 ? '#' : '.');
					}
				}
				System.out.println();
			}
			System.out.println();
		}
	}

	public void tf(long... b)
	{
		if(INPUT.length() != 0) {
			for (long x : b) {
				for (int i = 0; i < 64; i++) {
					System.out.print(x << ~i < 0 ? '#' : '.');
				}
			}
			System.out.println();
		}
	}

	private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
yukicoder

結果

テストケース

ソースコード
