結果
| 問題 |
No.461 三角形はいくつ？
|
| コンテスト | |
| ユーザー |
 Grenache
|
| 提出日時 | 2016-12-12 15:03:24 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,220 bytes |
| コンパイル時間 | 4,738 ms |
| コンパイル使用メモリ | 79,892 KB |
| 実行使用メモリ | 85,984 KB |
| 最終ジャッジ日時 | 2024-11-29 15:59:52 |
| 合計ジャッジ時間 | 161,357 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 10 WA * 12 TLE * 19 |
ソースコード
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, b));
}
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), 0, ">", ab.get((i - 1 + 3) % 3), 1) + ab.get((i - 1 + 3) % 3).size();
// pr.printf("%d %d\n", i, cnt(ab.get(i), 0, ">", ab.get((i - 1 + 3) % 3), 1) + ab.get((i - 1 + 3) % 3).size());
ret += cnt(ab.get(i), 0, ">", ab.get((i + 1) % 3), 1) + ab.get((i + 1) % 3).size();
// pr.printf("%d %d\n", i, cnt(ab.get(i), 0, ">", ab.get((i + 1) % 3), 1) + ab.get((i + 1) % 3).size());
for (Pair e1 : ab.get((i + 1) % 3)) {
for (Pair e2 : ab.get((i + 2) % 3)) {
if (e1.b * (e2.a + e2.b) + e2.b * (e1.a + e1.b) > (e1.a + e1.b) * (e2.a + e2.b)) {
continue;
}
ret += cnt2(e1, e2, ab.get(i));
if (e1.b * (e2.a + e2.b) + e2.b * (e1.a + e1.b) < (e1.a + e1.b) * (e2.a + e2.b)) {
ret++;
}
}
}
}
// pr.println(ret);
pr.println(ret / 3);
}
private static int cnt(List<Pair> l1, int ab1, String op, List<Pair> l2, int ab2) {
int ret = 0;
if (op.equals(">")) {
for (Pair e1 : l1) {
for (Pair e2 : l2) {
// if ((ab1 == 0 ? e1.a : e1.b * (e2.a + e2.b)) > (ab2 == 0 ? e2.a : e2.b * (e1.a + e1.b))) {
if (e1.compareTob(e2) > 0) {
ret++;
}
}
}
}
return ret;
}
private static int cnt2(Pair e1, Pair e2, List<Pair> l) {
int ret = 0;
Pair max;
if (e1.b * (e2.a + e2.b) > e2.b * (e1.a + e1.b)) {
max = e1;
} else {
max = e2;
}
long e12a = e1.b * (e2.a + e2.b) + e2.b * (e1.a + e1.b);
long e12ab = (e1.a + e1.b) * (e2.a + e2.b);
for (Pair e : l) {
if (e12a * (e.a + e.b) < e.a * e12ab || max.b * (e.a + e.b) >= e.a * (max.a + max.b)) {
ret++;
}
}
return ret;
}
private static class Pair implements Comparable<Pair> {
long a;
long b;
Pair(int a, int b) {
this.a = a;
this.b = b;
}
@Override
public int compareTo(Pair o) {
return Long.compare(a * (o.a + o.b), o.a * (a + b));
}
public int compareTob(Pair o) {
return Long.compare(a * (o.a + o.b), o.b * (a + b));
}
}
// ---------------------------------------------------
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);
}
}
}