#137989 (Java21) No.461 三角形はいくつ？

提出ソース

結果

問題	No.461 三角形はいくつ？
ユーザー	tanzaku
提出日時	2016-12-12 20:13:01
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	11,266 bytes
コンパイル時間	5,043 ms
コンパイル使用メモリ	90,264 KB
実行使用メモリ	59,072 KB
最終ジャッジ日時	2024-11-29 17:21:02
合計ジャッジ時間	141,240 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	57 ms 50,160 KB
testcase_01	AC	56 ms 50,128 KB
testcase_02	AC	56 ms 50,388 KB
testcase_03	AC	56 ms 50,384 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	TLE	-
testcase_15	TLE	-
testcase_16	AC	3,903 ms 55,176 KB
testcase_17	AC	3,945 ms 55,052 KB
testcase_18	TLE	-
testcase_19	TLE	-
testcase_20	TLE	-
testcase_21	TLE	-
testcase_22	TLE	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	AC	3,071 ms 54,664 KB
testcase_26	AC	3,079 ms 54,692 KB
testcase_27	TLE	-
testcase_28	AC	3,091 ms 54,548 KB
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	AC	100 ms 52,040 KB
testcase_34	AC	94 ms 52,000 KB
testcase_35	AC	96 ms 52,028 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	-

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

ソースコード

raw source code

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 {
		if (true) { mistake(); return; }
		
//		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);
			
			long ans = 1;
			for (int i = 0; i < n; i++) {
				ans++;
				for (int j = 0; j < i; j++) {
					int c1 = cross(qs[i], qs[j]);
					if (c1 == -1) continue;
					if (c1 == 1) ans++; 
					for (int k = 0; k < j; k++) {
						if (qs[i][0] == qs[k][0]) continue;
						if (qs[j][0] == qs[k][0]) continue;
						if (degenerated(qs[i], qs[j], qs[k])) continue;
						if (triangle(qs[i], qs[j], qs[k])) ans++;
					}
				}
			}
			
			io.out.println(ans);
		}
	}

	// p[i] = q[i][1] / (q[i][1] + q[i][2])
	// p[i] + p[j] - 1 + p[j] + p[k] - 1 = p[j]
	// p[i] + p[j] + p[k] = 2
	int cross(int[] q1, int[] q2) {
		if (q1[0] == q2[0]) return -1;
		long r1 = q1[1] + q1[2];
		long r2 = q2[1] + q2[2];
//		long cmp = q1[1] / (q1[1] + q1[2]) + q2[1] / (q2[1] + q2[2]) > 1;
		long cmp = q1[1] * r2 + q2[1] * r1 - r1 * r2;
		return cmp > 0 ? 1 : cmp < 0 ? -1 : 0;
	}
	
	boolean triangle(int[] q1, int[] q2, int[] q3) {
		long r1 = q1[1] + q1[2];
		long r2 = q2[1] + q2[2];
		long r3 = q3[1] + q3[2];
		return
				q1[1] * r2 + q2[1] * r1 >= r1 * r2 &&
				q1[1] * r3 + q3[1] * r1 >= r1 * r3 &&
				q2[1] * r3 + q3[1] * r2 >= r2 * r3;
	}
	
	boolean degenerated(int[] q1, int[] q2, int[] q3) {
		long r1 = q1[1] + q1[2];
		long r2 = q2[1] + q2[2];
		long r3 = q3[1] + q3[2];
		return q1[1] * r2 * r3 + q2[1] * r1 * r3 + q3[1] * r1 * r2 == 2 * r1 * r2 * r3;
	}
	
	void mistake() throws IOException {
		int n = io.nextInt();
		int[][] qs = io.nextIntArray2D(n, 3);
		RationalLong[] p = new RationalLong[n];
		List<RationalLong> y = new ArrayList<>();
		long ans = n + 1;
		for (int i = 0; i < n; i++) {
			p[i] = new RationalLong(qs[i][1], qs[i][1] + qs[i][2]);
			if (qs[i][0] == 0) {
				y.add(p[i]);
			}
		}
		
		Collections.sort(y);

		RationalLong two = RationalLong.ONE.mul(2);
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < i; j++) if (qs[i][0] != qs[j][0]) {
				if (p[i].add(p[j]).compareTo(RationalLong.ONE) > 0) {
					ans++;
				}
				if (p[i].add(p[j]).compareTo(RationalLong.ONE) < 0) continue;
				if (qs[i][0] == 0 || qs[j][0] == 0) continue;
				
				RationalLong p1 = RationalLong.min(p[i], p[j]);
				RationalLong p2 = two.sub(p[i].add(p[j]));
				
				// p3 >= 1-min(p1,p2)
				ans += query(y, p1);
				
				// degenerated : p1 + p2 + p3 == 2
				ans -= find(y, p2);
				
//				dump(i, j, query(y, p1), find(y, p2));
			}
		}
		
		io.out.println(ans);
	}
	
	long find(List<RationalLong> y, RationalLong key) {
		int idx = Collections.binarySearch(y, key);
		if (idx < 0) return 0;
		return 1;
	}
	
	long query(List<RationalLong> y, RationalLong key) {
		int idx = Collections.binarySearch(y, key);
		if (idx < 0) idx = -idx - 1;
//		else idx--;
		return y.size() - idx;
//		return idx;
	}
	
	static class RationalLong implements Comparable<RationalLong> {
		private long 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 RationalLong min(RationalLong r1, RationalLong r2) {
			return r1.compareTo(r2) < 0 ? r1 : r2;
		}

		public static RationalLong ZERO = new RationalLong(0, 1);
		public static RationalLong ONE = new RationalLong(1, 1);
		public static RationalLong TEN = new RationalLong(10, 1);

		public long denominator() { return denominator; }
		public long numerator() { return numerator; }
		
		public static RationalLong valueOf(final int x) { return new RationalLong(x); }
		public static RationalLong valueOf(final long x) { return new RationalLong(x); }

		public RationalLong() {
			denominator = 0;
			numerator = 1;
		}

		public RationalLong(long n, long d) {
			if(d < 0) { d = -d; n = -n; }
			final long x = gcd(Math.abs(n), d);
			denominator = d / x;
			numerator = n / x;
		}

		public RationalLong(final RationalLong r) {
			denominator = r.denominator;
			numerator = r.numerator;
		}

		public RationalLong(final long x) {
			denominator = 1;
			numerator = x;
		}

		private void reduce() {
			final long x = gcd(numerator, denominator);
			if(x != 1) {
				numerator = numerator / x;
				denominator = denominator / x;
			}

			if(denominator < 0) {
				denominator = -denominator;
				numerator = -numerator;
			}
		}

		public RationalLong negate() { RationalLong r = new RationalLong(this); r.numerator = -r.numerator; return r; }

		public RationalLong add(final long b) { return new RationalLong(denominator() * b + numerator(), denominator()); }
		public RationalLong add(final RationalLong b) {
			return new RationalLong(
					numerator * b.denominator + denominator * b.numerator,
					denominator * b.denominator);
		}

		public RationalLong sub(final long b) { return add(-b); }
		public RationalLong sub(final RationalLong b) { return add(b.negate()); }

		public RationalLong mul(final long b) { return new RationalLong(b * numerator(), denominator()); }
		public RationalLong mul(final RationalLong b) {
			return new RationalLong(
					numerator * b.numerator,
					denominator * b.denominator);
		}

		public RationalLong div(final long b) { return new RationalLong(numerator(), denominator() * b); }
		public RationalLong div(final RationalLong b) {
			return new RationalLong(
					numerator * b.denominator,
					denominator * b.numerator);
		}
		
		@Override
		public String toString() {
			return numerator + "/" + denominator;
		}
		
		@Override
		public int compareTo(RationalLong o) {
			return Long.compare(numerator() * o.denominator(), denominator() * o.numerator());
		}
		
		@Override
		public boolean equals(Object obj) {
			// TODO Auto-generated method stub
			return compareTo((RationalLong)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; }
	}
}

yukicoder

結果

テストケース

ソースコード