#414378 (Java21) No.947 ABC包囲網

提出ソース

結果

問題	No.947 ABC包囲網
ユーザー	uwi
提出日時	2020-01-05 04:29:40
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	4,842 bytes
コンパイル時間	4,332 ms
コンパイル使用メモリ	89,796 KB
実行使用メモリ	51,488 KB
最終ジャッジ日時	2024-11-22 21:54:25
合計ジャッジ時間	10,114 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	56 ms 50,248 KB
testcase_01	AC	56 ms 50,168 KB
testcase_02	AC	57 ms 50,352 KB
testcase_03	AC	57 ms 50,452 KB
testcase_04	AC	59 ms 49,968 KB
testcase_05	AC	57 ms 50,220 KB
testcase_06	AC	55 ms 50,200 KB
testcase_07	AC	57 ms 49,972 KB
testcase_08	WA	-
testcase_09	AC	56 ms 50,316 KB
testcase_10	AC	57 ms 50,120 KB
testcase_11	AC	58 ms 49,824 KB
testcase_12	AC	55 ms 50,232 KB
testcase_13	AC	54 ms 50,188 KB
testcase_14	AC	55 ms 49,972 KB
testcase_15	AC	56 ms 50,088 KB
testcase_16	WA	-
testcase_17	AC	56 ms 50,264 KB
testcase_18	AC	56 ms 50,148 KB
testcase_19	AC	56 ms 50,148 KB
testcase_20	AC	56 ms 50,392 KB
testcase_21	AC	56 ms 50,164 KB
testcase_22	AC	56 ms 50,148 KB
testcase_23	AC	56 ms 50,156 KB
testcase_24	AC	56 ms 49,948 KB
testcase_25	AC	57 ms 49,808 KB
testcase_26	AC	57 ms 50,364 KB
testcase_27	AC	56 ms 50,480 KB
testcase_28	WA	-
testcase_29	AC	79 ms 50,892 KB
testcase_30	AC	74 ms 51,008 KB
testcase_31	AC	81 ms 51,216 KB
testcase_32	AC	82 ms 51,276 KB
testcase_33	AC	83 ms 51,236 KB
testcase_34	AC	83 ms 51,444 KB
testcase_35	AC	82 ms 51,168 KB
testcase_36	AC	81 ms 50,692 KB
testcase_37	AC	81 ms 51,020 KB
testcase_38	AC	80 ms 51,188 KB
testcase_39	AC	82 ms 50,724 KB
testcase_40	AC	80 ms 51,108 KB
testcase_41	AC	77 ms 50,932 KB
testcase_42	AC	78 ms 50,932 KB
testcase_43	AC	78 ms 51,208 KB
testcase_44	AC	78 ms 50,844 KB
testcase_45	AC	77 ms 50,864 KB
testcase_46	AC	78 ms 51,160 KB
testcase_47	AC	78 ms 51,080 KB
testcase_48	AC	78 ms 51,128 KB
testcase_49	AC	78 ms 50,952 KB
testcase_50	AC	77 ms 50,796 KB
testcase_51	AC	55 ms 50,328 KB
testcase_52	AC	56 ms 49,936 KB
testcase_53	AC	56 ms 50,416 KB
testcase_54	AC	55 ms 50,388 KB
testcase_55	AC	56 ms 50,180 KB
testcase_56	AC	56 ms 50,232 KB
testcase_57	AC	56 ms 50,208 KB
testcase_58	AC	57 ms 50,256 KB
testcase_59	AC	57 ms 50,232 KB

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

ソースコード

raw source code

package adv2019;
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 D10_5 {
	InputStream is;
	PrintWriter out;
	String INPUT = ""; 
	
	void solve()
	{
		int n = ni();
		int[][] co = new int[n][];
		for(int i = 0;i < n;i++) {
			co[i] = na(2);
		}
		out.println(countTrianglesContainingOX(co));
	}
	
	public static long countTrianglesContainingO(int[][] co)
	{
		int n = co.length;
		Arrays.sort(co, compArgi);

		long ret = (long)n*(n-1)*(n-2)/6;
		for(int h = 0, t = 0, hm = 0, tm = 0;h < 2*n;h++, hm++) {
			if(hm == n)hm = 0;
			while(t < h && cross(co[hm], co[tm]) > 0) {
				if(++tm == n)tm = 0;
				t++;
			}
			if(h >= n)ret -= (long)(h-t)*(h-t-1)/2;
		}
		return ret;
	}
	
	public static long countTrianglesContainingOX(int[][] co)
	{
		int n = co.length;
		Arrays.sort(co, compArgi);

		long ret = (long)n*(n-1)*(n-2)/6;
		long sameline = 0;
		for(int h = 0, t = 0, t2 = 0, hm = 0, tm = 0, t2m = 0;h < 2*n;h++, hm++) {
			if(hm == n)hm = 0;
			while(t < h && (cross(co[hm], co[tm]) > 0 || cross(co[hm], co[tm]) == 0 && dot(co[hm], co[tm]) > 0)) {
				if(++tm == n)tm = 0;
				t++;
			}
			while(t2 < h && (cross(co[hm], co[t2m]) > 0 || cross(co[hm], co[t2m]) == 0 && dot(co[hm], co[t2m]) < 0)) {
				if(++t2m == n)t2m = 0;
				t2++;
			}
			if(h >= n) {
				ret -= (long)(h-t)*(h-t-1)/2 - (t2-t)*(t2-t-1)/2;
			}
		}
		return ret + sameline;
	}
	
	public static long dot(int[] a, int[] b){ return (long)a[0]*b[0]+(long)a[1]*b[1]; }
	public static long cross(int[] a, int[] b){ return (long)a[0]*b[1]-(long)a[1]*b[0];	}

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

	
	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 D10_5().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)); }
}

yukicoder

結果

テストケース

ソースコード