結果
問題 | No.461 三角形はいくつ? |
ユーザー | uwi |
提出日時 | 2016-12-12 00:18:13 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 2,847 ms / 5,000 ms |
コード長 | 5,418 bytes |
コンパイル時間 | 3,708 ms |
コンパイル使用メモリ | 85,968 KB |
実行使用メモリ | 56,468 KB |
最終ジャッジ日時 | 2023-08-19 11:41:07 |
合計ジャッジ時間 | 45,892 ms |
ジャッジサーバーID (参考情報) |
judge10 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
49,444 KB |
testcase_01 | AC | 39 ms
47,372 KB |
testcase_02 | AC | 38 ms
49,564 KB |
testcase_03 | AC | 37 ms
49,404 KB |
testcase_04 | AC | 55 ms
50,484 KB |
testcase_05 | AC | 1,070 ms
56,020 KB |
testcase_06 | AC | 614 ms
55,536 KB |
testcase_07 | AC | 742 ms
55,528 KB |
testcase_08 | AC | 524 ms
55,000 KB |
testcase_09 | AC | 46 ms
49,896 KB |
testcase_10 | AC | 236 ms
55,240 KB |
testcase_11 | AC | 824 ms
55,916 KB |
testcase_12 | AC | 426 ms
55,312 KB |
testcase_13 | AC | 1,160 ms
55,824 KB |
testcase_14 | AC | 1,115 ms
55,860 KB |
testcase_15 | AC | 1,189 ms
56,004 KB |
testcase_16 | AC | 655 ms
55,680 KB |
testcase_17 | AC | 687 ms
55,668 KB |
testcase_18 | AC | 1,346 ms
56,468 KB |
testcase_19 | AC | 1,370 ms
55,900 KB |
testcase_20 | AC | 1,226 ms
56,348 KB |
testcase_21 | AC | 1,184 ms
55,784 KB |
testcase_22 | AC | 1,187 ms
56,272 KB |
testcase_23 | AC | 610 ms
56,284 KB |
testcase_24 | AC | 590 ms
55,912 KB |
testcase_25 | AC | 2,810 ms
55,784 KB |
testcase_26 | AC | 2,847 ms
55,612 KB |
testcase_27 | AC | 58 ms
50,748 KB |
testcase_28 | AC | 56 ms
48,768 KB |
testcase_29 | AC | 2,613 ms
56,124 KB |
testcase_30 | AC | 2,727 ms
55,748 KB |
testcase_31 | AC | 2,395 ms
56,368 KB |
testcase_32 | AC | 2,207 ms
56,164 KB |
testcase_33 | AC | 56 ms
48,644 KB |
testcase_34 | AC | 56 ms
50,668 KB |
testcase_35 | AC | 53 ms
51,044 KB |
testcase_36 | AC | 675 ms
56,232 KB |
testcase_37 | AC | 637 ms
56,096 KB |
testcase_38 | AC | 638 ms
55,792 KB |
testcase_39 | AC | 629 ms
55,744 KB |
testcase_40 | AC | 687 ms
55,872 KB |
testcase_41 | AC | 664 ms
55,656 KB |
testcase_42 | AC | 869 ms
55,864 KB |
testcase_43 | AC | 879 ms
55,544 KB |
testcase_44 | AC | 914 ms
55,760 KB |
ソースコード
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 { 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[2], 0, ep[2], new Comparator<long[]>() { public int compare(long[] a, long[] b) { return Long.compare((long)a[0]*b[1], (long)a[1]*b[0]); } }); long ret = 0; for(int i = 0;i < ep[0];i++){ for(int j = 0;j < ep[1];j++){ long[] ad = add(es[0][i], es[1][j]); if(ad[0] < ad[1])continue; long[] low0 = {es[0][i][1]-es[0][i][0], es[0][i][1]}; 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; } int lb = lowerBound(es[2], ep[2], low); long[] rem = sub(new long[]{2, 1}, ad); ret += ep[2]-lb; int hit = lowerBound(es[2], ep[2], rem); if(hit < ep[2] && compare(es[2][hit], rem) == 0){ ret--; } } } out.println(ret); } 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().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)); } }