結果

問題 No.461 三角形はいくつ？
ユーザー uwiuwi
提出日時 2016-12-12 17:23:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 3,134 ms / 5,000 ms
コード長 5,564 bytes
コンパイル時間 4,599 ms
コンパイル使用メモリ 89,800 KB
実行使用メモリ 57,400 KB
最終ジャッジ日時 2024-05-07 04:00:49
合計ジャッジ時間 49,746 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
50,552 KB
testcase_01 AC 66 ms
50,792 KB
testcase_02 AC 67 ms
50,848 KB
testcase_03 AC 70 ms
51,008 KB
testcase_04 AC 80 ms
51,520 KB
testcase_05 AC 1,141 ms
57,160 KB
testcase_06 AC 652 ms
56,284 KB
testcase_07 AC 851 ms
57,400 KB
testcase_08 AC 596 ms
56,916 KB
testcase_09 AC 74 ms
51,248 KB
testcase_10 AC 306 ms
57,136 KB
testcase_11 AC 846 ms
56,340 KB
testcase_12 AC 454 ms
56,496 KB
testcase_13 AC 1,216 ms
56,980 KB
testcase_14 AC 1,148 ms
56,784 KB
testcase_15 AC 1,269 ms
57,028 KB
testcase_16 AC 781 ms
56,360 KB
testcase_17 AC 812 ms
56,224 KB
testcase_18 AC 1,499 ms
57,120 KB
testcase_19 AC 1,494 ms
57,012 KB
testcase_20 AC 1,322 ms
57,268 KB
testcase_21 AC 1,217 ms
56,692 KB
testcase_22 AC 1,247 ms
56,980 KB
testcase_23 AC 719 ms
56,628 KB
testcase_24 AC 703 ms
56,224 KB
testcase_25 AC 3,027 ms
56,376 KB
testcase_26 AC 3,134 ms
56,136 KB
testcase_27 AC 94 ms
52,028 KB
testcase_28 AC 183 ms
53,784 KB
testcase_29 AC 2,864 ms
57,012 KB
testcase_30 AC 2,994 ms
56,436 KB
testcase_31 AC 2,625 ms
56,508 KB
testcase_32 AC 2,347 ms
56,456 KB
testcase_33 AC 95 ms
51,360 KB
testcase_34 AC 99 ms
51,992 KB
testcase_35 AC 96 ms
52,060 KB
testcase_36 AC 772 ms
56,508 KB
testcase_37 AC 707 ms
56,772 KB
testcase_38 AC 712 ms
56,772 KB
testcase_39 AC 729 ms
56,860 KB
testcase_40 AC 728 ms
56,780 KB
testcase_41 AC 753 ms
56,400 KB
testcase_42 AC 944 ms
57,192 KB
testcase_43 AC 936 ms
57,008 KB
testcase_44 AC 964 ms
56,716 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2016;
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 N461_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		long[][][] es = new long[3][n+1][];
		int[] ep = new int[3];
		for(int i = 0;i < 3;i++){
			es[i][ep[i]++] = new long[]{1, 1};
		}
		for(int i = 0;i < n;i++){
			int t = ni();
			int x = ni(), y = ni();
			es[t][ep[t]++] = new long[]{x, x+y};
		}
		Arrays.sort(es[1], 0, ep[1], comp);
		Arrays.sort(es[2], 0, ep[2], comp);
		
		long ret = 0;
		for(int i = 0;i < ep[0];i++){
			long[] low0 = {es[0][i][1]-es[0][i][0], es[0][i][1]};
			int lowp = ep[2];
			int remp = ep[2];
			for(int j = 0;j < ep[1];j++){
				long[] ad = add(es[0][i], es[1][j]);
				if(ad[0] < ad[1])continue;
				long[] low1 = {es[1][j][1]-es[1][j][0], es[1][j][1]};
				long[] low = null;
				if(compare(low0, low1) < 0){
					low = low1;
				}else{
					low = low0;
				}
				// low:decreasing
				// rem:decreasing
				while(lowp-1 >= 0 && compare(low, es[2][lowp-1]) <= 0)lowp--;
				long[] rem = sub(new long[]{2, 1}, ad);
				ret += ep[2]-lowp;
				while(remp-1 >= 0 && compare(rem, es[2][remp-1]) < 0)remp--;
				if(remp >= 1 && lowp <= remp-1 && compare(rem, es[2][remp-1]) == 0){
					ret--;
				}
			}
		}
		out.println(ret);
		
	}

	public static Comparator<long[]> comp = (a, b) -> Long.signum(a[0]*b[1]-a[1]*b[0]);

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

	
	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 N461_2().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