結果
| 問題 | No.461 三角形はいくつ？ |
| コンテスト | |
| ユーザー |
 tanzaku
|
| 提出日時 | 2016-12-12 18:17:54 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 12,216 bytes |
| 記録 | |
| コンパイル時間 | 4,907 ms |
| コンパイル使用メモリ | 94,688 KB |
| 実行使用メモリ | 112,540 KB |
| 最終ジャッジ日時 | 2024-11-29 17:01:40 |
| 合計ジャッジ時間 | 213,543 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 3 WA * 12 TLE * 26 |
ソースコード
import java.io.*;
import java.math.*;
import java.util.*;
import static java.util.Arrays.*;
public class _461 {
private static final int mod = (int)1e9+7;
final Random random = new Random(0);
final IOFast io = new IOFast();
final double eps = 1e-9;
/// MAIN CODE
public void run() throws IOException {
// int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
int TEST_CASE = 1;
while(TEST_CASE-- != 0) {
int n = io.nextInt();
int[][] qs = io.nextIntArray2D(n, 3);
Rational[] p = new Rational[n];
List<Rational> y = new ArrayList<>();
long ans = n + 1;
for (int i = 0; i < n; i++) {
p[i] = new Rational(qs[i][1], qs[i][1] + qs[i][2]);
for (int j = 0; j < i; j++) {
if (p[i].add(p[j]).compareTo(Rational.ONE) > 0 && qs[i][0] != qs[j][0]) {
ans++;
// dump(i, j);
}
}
if (qs[i][0] == 0) {
p[i] = Rational.ONE.sub(p[i]);
y.add(p[i]);
}
}
Collections.sort(y);
for (int i = 0; i < n; i++) {
if (qs[i][0] != 0) {
for (int j = 0; j < i; j++) if (qs[j][0] != 0 && qs[j][0] != qs[i][0]) {
if (p[i].add(p[j]).compareTo(Rational.ONE) < 0) {
continue;
}
Rational p1 = Rational.min(p[i], p[j]);
Rational p2 = p[i].add(p[j]).sub(Rational.ONE);
long c1 = query(y, p1);
long c2 = find(y, p2);
ans += c1 - c2;
}
}
}
io.out.println(ans);
}
}
long find(List<Rational> y, Rational key) {
int idx = Collections.binarySearch(y, key);
if (idx < 0) return 0;
return 1;
}
long query(List<Rational> y, Rational key) {
int idx = Collections.binarySearch(y, key);
if (idx < 0) idx = -idx - 1;
else idx++;
// return y.size() - idx;
return idx;
}
static class Rational implements Comparable<Rational> {
private BigInteger denominator, numerator;
private static long gcd(long n, long r) { while(r != 0) { final long t = n % r; n = r; r = t; } return n; }
public static Rational min(Rational r1, Rational r2) {
return r1.compareTo(r2) < 0 ? r1 : r2;
}
public static Rational ZERO = new Rational(0, 1);
public static Rational ONE = new Rational(1, 1);
public static Rational TEN = new Rational(10, 1);
public BigInteger denominator() { return denominator; }
public BigInteger numerator() { return numerator; }
public static Rational valueOf(final int x) { return new Rational(x); }
public static Rational valueOf(final long x) { return new Rational(x); }
public static Rational valueOf(final BigInteger x) { return new Rational(x); }
public static Rational valueOf(final double x) { return new Rational(x); }
public Rational() {
denominator = BigInteger.ZERO;
numerator = BigInteger.ONE;
}
public Rational(long n, long d) {
if(d < 0) { d = -d; n = -n; }
final long x = gcd(Math.abs(n), d);
denominator = BigInteger.valueOf(d / x);
numerator = BigInteger.valueOf(n / x);
}
public Rational(double x) {
final int sign = Math.signum(x) < 0 ? -1 : 1;
x = Math.abs(x);
double y;
final BigInteger BRADIX = BigInteger.valueOf(1L<<62);
denominator = BigInteger.ONE;
numerator = BigInteger.ONE;
final long RADIX = 1L << 62;
for(y = x; y >= 1; y /= RADIX) {
numerator = numerator.multiply(BRADIX);
}
BigInteger b = BigInteger.ZERO;
for(; y > 0; ) {
y *= RADIX;
final long v = (long)Math.floor(y);
b = b.multiply(BRADIX).add(BigInteger.valueOf(v));
denominator = denominator.multiply(BRADIX);
y -= v;
}
numerator = numerator.multiply(b);
if(sign == -1) {
numerator = numerator.negate();
}
reduce();
// System.err.println(x + " " + this);
}
public Rational(final Rational r) {
denominator = r.denominator;
numerator = r.numerator;
}
public Rational(BigInteger n, BigInteger d) {
denominator = d;
numerator = n;
reduce();
}
public Rational(BigInteger x) {
denominator = BigInteger.ONE;
numerator = x;
reduce();
}
public Rational(final long x) {
denominator = BigInteger.ONE;
numerator = BigInteger.valueOf(x);
}
private void reduce() {
final BigInteger x = numerator.gcd(denominator);
if(!x.equals(BigInteger.ONE)) {
numerator = numerator.divide(x);
denominator = denominator.divide(x);
}
if(denominator.signum() == -1) {
denominator = denominator.negate();
numerator = numerator.negate();
}
}
public Rational negate() { Rational r = new Rational(this); r.numerator = r.numerator.negate(); return r; }
public Rational add(final int b) { return add(BigInteger.valueOf(b)); }
public Rational add(final long b) { return add(BigInteger.valueOf(b)); }
public Rational add(final BigInteger b) { return new Rational(denominator().multiply(b).add(numerator()), denominator()); }
public Rational add(final Rational b) {
return new Rational(
numerator.multiply(b.denominator).add(denominator.multiply(b.numerator)),
denominator.multiply(b.denominator));
}
public Rational sub(final int b) { return sub(BigInteger.valueOf(b)); }
public Rational sub(final long b) { return sub(BigInteger.valueOf(b)); }
public Rational sub(final BigInteger b) { return add(b.negate()); }
public Rational sub(final Rational b) { return add(b.negate()); }
public Rational mul(final int b) { return mul(BigInteger.valueOf(b)); }
public Rational mul(final long b) { return mul(BigInteger.valueOf(b)); }
public Rational mul(final BigInteger b) {
return new Rational(
numerator.multiply(b),
denominator);
}
public Rational mul(final Rational b) {
return new Rational(
numerator.multiply(b.numerator),
denominator.multiply(b.denominator));
}
public Rational div(final int b) { return div(BigInteger.valueOf(b)); }
public Rational div(final long b) { return div(BigInteger.valueOf(b)); }
public Rational div(final BigInteger b) {
return new Rational(
numerator,
denominator.multiply(b));
}
public Rational div(final Rational b) {
return new Rational(
numerator.multiply(b.denominator),
denominator.multiply(b.numerator));
}
public Rational pow(final int r) { return new Rational(numerator().pow(r), denominator().pow(r)); }
public BigInteger floor() {
return numerator().divide(denominator());
}
public BigInteger ceil() {
return numerator().add(denominator()).subtract(BigInteger.ONE).divide(denominator());
}
public double doubleValue() {
final BigInteger f = floor();
double ret = f.doubleValue();
Rational r = sub(f);
final BigInteger b = BigInteger.TEN.pow(12);
ret += r.mul(b).floor().doubleValue() / b.doubleValue();
return ret;
}
@Override
public String toString() {
return numerator.toString() + "/" + denominator.toString();
}
@Override
public int compareTo(Rational o) {
return numerator().multiply(o.denominator()).compareTo(denominator().multiply(o.numerator()));
}
@Override
public boolean equals(Object obj) {
// TODO Auto-generated method stub
return compareTo((Rational)obj) == 0;
}
}
/// TEMPLATE
static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); }
void main() throws IOException {
// IOFast.setFileIO("rle-size.in", "rle-size.out");
try { run(); }
catch (EndOfFileRuntimeException e) { }
io.out.flush();
}
public static void main(String[] args) throws IOException { new _461().main(); }
static class EndOfFileRuntimeException extends RuntimeException {
private static final long serialVersionUID = -8565341110209207657L; }
static
public class IOFast {
private InputStream in = System.in;
private PrintWriter out = new PrintWriter(System.out);
private static int pos, readLen;
private static final byte[] buffer = new byte[1024 * 8];
private static char[] str = new char[500*8*2];
private static boolean[] isDigit = new boolean[256];
private static boolean[] isSpace = new boolean[256];
private static boolean[] isLineSep = new boolean[256];
static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
public byte read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
public int nextInt() throws IOException {
byte first = (byte)nextChar();
boolean minus = false;
int res = 0;
if (first == '-') {
minus = true;
} else {
res = first - '0';
}
while (true) {
byte b = read();
if (isSpace[b]) break;
res = res * 10 + b - '0';
}
return minus ? -res : res;
}
public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
public String nextString() throws IOException { return new String(next()); }
public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
// public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
// public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
public double nextDouble() throws IOException {
double res = nextChar() - '0';
while (true) {
byte c = read();
if (isSpace[c]) return res;
if (c == '.') break;
res = res * 10 + c - '0';
}
double d = 1;
while (true) {
byte c = read();
// dump(c);
if (!isDigit[c]) break;
res = res * 10 + c - '0';
d *= 10;
}
// dump(1);
return res / d;
}
public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
}
}