結果

問題 No.461 三角形はいくつ？
ユーザー GrenacheGrenache
提出日時 2016-12-12 16:24:25
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 6,564 bytes
コンパイル時間 7,030 ms
コンパイル使用メモリ 80,924 KB
実行使用メモリ 61,456 KB
最終ジャッジ日時 2024-11-29 16:31:26
合計ジャッジ時間 28,679 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
48,296 KB
testcase_01 AC 56 ms
48,216 KB
testcase_02 AC 56 ms
47,744 KB
testcase_03 AC 56 ms
50,064 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 239 ms
53,252 KB
testcase_17 AC 239 ms
53,108 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 284 ms
54,500 KB
testcase_26 AC 276 ms
54,628 KB
testcase_27 AC 281 ms
55,344 KB
testcase_28 AC 290 ms
55,580 KB
testcase_29 WA -
testcase_30 AC 553 ms
56,920 KB
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 113 ms
50,512 KB
testcase_34 AC 114 ms
50,500 KB
testcase_35 AC 113 ms
50,684 KB
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder461 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();

		List<List<Pair>> ab = new ArrayList<>();
		for (int i = 0; i < 3; i++) {
			ab.add(new ArrayList<>());
		}
		for (int i = 0; i < n; i++) {
			int p = sc.nextInt();
			int a = sc.nextInt();
			int b = sc.nextInt();

			ab.get(p).add(new Pair(a, a + b));
		}
		for (int i = 0; i < 3; i++) {
			Collections.sort(ab.get(i));
		}

		int ret = 0;

		for (int i = 0; i < 3; i++) {
			ret += ab.get(i).size() + 1;
//			pr.printf("%d %d\n", i, ab.get(i).size() + 1);
			ret += cnt(ab.get(i), ab.get((i - 1 + 3) % 3)) + ab.get((i - 1 + 3) % 3).size();
//			pr.printf("%d %d\n", i, cnt(ab.get(i), ab.get((i - 1 + 3) % 3)) + ab.get((i - 1 + 3) % 3).size());
			ret += cnt(ab.get(i), ab.get((i + 1) % 3)) + ab.get((i + 1) % 3).size();
//			pr.printf("%d %d\n", i, cnt(ab.get(i), ab.get((i + 1) % 3)) + ab.get((i + 1) % 3).size());

			Pair tmp = new Pair(0, 0);
			Pair tmpone = new Pair(1, 1);
			for (Pair e1 : ab.get((i + 1) % 3)) {
				for (Pair e2 : ab.get((i + 2) % 3)) {
					tmp.a = (e1.ab - e1.a) * e2.ab + (e2.ab - e2.a) * e1.ab;
					tmp.ab = e1.ab * e2.ab;

					if (tmp.compareTo(tmpone) > 0) {
						continue;
					}

					ret += cnt2(e1, e2, ab.get(i));
					if (tmp.compareTo(tmpone) < 0) {
						ret++;
					}
				}
			}
		}

//		pr.println(ret);
		pr.println(ret / 3);
	}

	private static int cnt(List<Pair> l1, List<Pair> l2) {
		int ret = 0;
		int n = l1.size();

		Pair tmp = new Pair(0, 0);
		for (Pair e2 : l2) {
			tmp.a = e2.ab - e2.a;
			tmp.ab = e2.ab;
			int index = Collections.binarySearch(l1, tmp);
			if (index >= 0) {
				ret += n - (index + 1);
			} else {
				index = -(index + 1);
				ret += n - index;
			}
		}

		return ret;
	}

	private static int cnt2(Pair e1, Pair e2, List<Pair> l) {
		int ret = 0;
		int n = l.size();

		Pair max;
		Pair e1b = new Pair(e1.ab - e1.a, e1.ab);
		Pair e2b = new Pair(e2.ab - e2.a, e2.ab);
		if (e1b.compareTo(e2b) > 0) {
			max = e1b;
		} else {
			max = e2b;
		}

		Pair tmp = new Pair(0, 0);
		tmp.a = (e1.ab - e1.a) * e2.ab + (e2.ab - e2.a) * e1.ab;
		tmp.ab = e1.ab * e2.ab;

		int index = Collections.binarySearch(l, tmp);
		if (index >= 0) {
			ret += n - (index + 1);
		} else {
			index = -(index + 1);
			ret += n - index;
		}

		int index2 = Collections.binarySearch(l, max);
		if (index2 >= 0) {
			ret += index - index2;
		} else {
			index2 = -(index + 1);
			ret += index - index;
		}

		return ret;
	}

	private static class Pair implements Comparable<Pair> {
		long a;
		long ab;

		Pair(long l, long ab2) {
			this.a = l;
			this.ab = ab2;
		}

		@Override
		public int compareTo(Pair o) {
//			return Long.compare(a * (o.a + o.b), o.a * (a + b));
			return Long.compare(a * o.ab, o.a * ab);
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0